A small tool to view real-world ActivityPub objects as JSON! Enter a URL
or username from Mastodon or a similar service below, and we'll send a
request with
the right
Accept
header
to the server to view the underlying object.
{
"@context": [
"https://www.w3.org/ns/activitystreams",
{
"ostatus": "http://ostatus.org#",
"atomUri": "ostatus:atomUri",
"inReplyToAtomUri": "ostatus:inReplyToAtomUri",
"conversation": "ostatus:conversation",
"sensitive": "as:sensitive",
"toot": "http://joinmastodon.org/ns#",
"votersCount": "toot:votersCount",
"Hashtag": "as:Hashtag"
}
],
"id": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473",
"type": "Note",
"summary": null,
"inReplyTo": null,
"published": "2025-05-07T09:36:43Z",
"url": "https://mathstodon.xyz/@ccppurcell/114465872532612473",
"attributedTo": "https://mathstodon.xyz/users/ccppurcell",
"to": [
"https://www.w3.org/ns/activitystreams#Public"
],
"cc": [
"https://mathstodon.xyz/users/ccppurcell/followers"
],
"sensitive": false,
"atomUri": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473",
"inReplyToAtomUri": null,
"conversation": "tag:mathstodon.xyz,2025-05-07:objectId=152016770:objectType=Conversation",
"content": "<p>Does anyone know of any article dealing with binary strings that have \\(n\\) 0's and \\(n\\) 1's but are neither Dyck words nor inverse Dyck words (obtainable from a Dyck word by swapping 0 and 1)?</p><p>They seem to be connected to questions similar to the following: how many equivalence classes of solutions to a set of equations are there, where two solutions are equivalent if the variables have the same order? For example:<br />\\(a+b+c = 6; a+2a+3c=14\\) has solutions \\(a=0, b=4, c=2\\) and \\(a=-1, b=6, c=1\\) which are equivalent since \\(a < c < b\\) (there are of course infinitely many solutions, and probably all possible orderings, but this is just a toy example)</p><p>I can't find any references for these questions either! It seems like a nice connection though, so if you have any references or ideas let me know <a href=\"https://mathstodon.xyz/tags/mathematics\" class=\"mention hashtag\" rel=\"tag\">#<span>mathematics</span></a></p>",
"contentMap": {
"en": "<p>Does anyone know of any article dealing with binary strings that have \\(n\\) 0's and \\(n\\) 1's but are neither Dyck words nor inverse Dyck words (obtainable from a Dyck word by swapping 0 and 1)?</p><p>They seem to be connected to questions similar to the following: how many equivalence classes of solutions to a set of equations are there, where two solutions are equivalent if the variables have the same order? For example:<br />\\(a+b+c = 6; a+2a+3c=14\\) has solutions \\(a=0, b=4, c=2\\) and \\(a=-1, b=6, c=1\\) which are equivalent since \\(a < c < b\\) (there are of course infinitely many solutions, and probably all possible orderings, but this is just a toy example)</p><p>I can't find any references for these questions either! It seems like a nice connection though, so if you have any references or ideas let me know <a href=\"https://mathstodon.xyz/tags/mathematics\" class=\"mention hashtag\" rel=\"tag\">#<span>mathematics</span></a></p>"
},
"attachment": [],
"tag": [
{
"type": "Hashtag",
"href": "https://mathstodon.xyz/tags/mathematics",
"name": "#mathematics"
}
],
"replies": {
"id": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473/replies",
"type": "Collection",
"first": {
"type": "CollectionPage",
"next": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473/replies?only_other_accounts=true&page=true",
"partOf": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473/replies",
"items": []
}
},
"likes": {
"id": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473/likes",
"type": "Collection",
"totalItems": 1
},
"shares": {
"id": "https://mathstodon.xyz/users/ccppurcell/statuses/114465872532612473/shares",
"type": "Collection",
"totalItems": 0
}
}