{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7I3XV7GD2J6KAK2VT625P3MOQA","short_pith_number":"pith:7I3XV7GD","schema_version":"1.0","canonical_sha256":"fa377afcc3d27ca02b559fb5d7ed8e800a7f6ff17edea33ba4795c558a71b074","source":{"kind":"arxiv","id":"1509.07674","version":1},"attestation_state":"computed","paper":{"title":"$2^{\\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\\mathbb{N})$ via the classification of the reducts of the Henson digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.LO","authors_text":"Lovkush Agarwal, Michael Kompatscher","submitted_at":"2015-09-25T11:02:44Z","abstract_excerpt":"Given two structures $\\mathcal{M}$ and $\\mathcal{N}$ on the same domain, we say that $\\mathcal{N}$ is a reduct of $\\mathcal{M}$ if all $\\emptyset$-definable relations of $\\mathcal{N}$ are $\\emptyset$-definable in $\\mathcal{M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are $\\aleph_0$-categorical, determining their reducts is equivalent to determining all closed supergroups $G<$ Sym$(\\mathbb{N})$ of their automorphism groups.\n  A consequence of the classif"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.07674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-09-25T11:02:44Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"27a7ec9e1ac609065e2fe02804bbc56062b5f6680fb77ef3eec132ddbce78bb8","abstract_canon_sha256":"6923239a2f665f91be02ac9b90e819c0977b269bdb4a565bf96af86a55b28935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:02.213200Z","signature_b64":"No44MDYeQGlPWkt7cSMctS8BvzxVgn9I48+dk1IIJ+NdJKgCQSxuwxEXXWx0RrbbWh3g5G4iJ+I8YarerpzPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa377afcc3d27ca02b559fb5d7ed8e800a7f6ff17edea33ba4795c558a71b074","last_reissued_at":"2026-05-18T01:32:02.212776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:02.212776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$2^{\\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\\mathbb{N})$ via the classification of the reducts of the Henson digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.LO","authors_text":"Lovkush Agarwal, Michael Kompatscher","submitted_at":"2015-09-25T11:02:44Z","abstract_excerpt":"Given two structures $\\mathcal{M}$ and $\\mathcal{N}$ on the same domain, we say that $\\mathcal{N}$ is a reduct of $\\mathcal{M}$ if all $\\emptyset$-definable relations of $\\mathcal{N}$ are $\\emptyset$-definable in $\\mathcal{M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are $\\aleph_0$-categorical, determining their reducts is equivalent to determining all closed supergroups $G<$ Sym$(\\mathbb{N})$ of their automorphism groups.\n  A consequence of the classif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07674","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07674","created_at":"2026-05-18T01:32:02.212847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07674v1","created_at":"2026-05-18T01:32:02.212847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07674","created_at":"2026-05-18T01:32:02.212847+00:00"},{"alias_kind":"pith_short_12","alias_value":"7I3XV7GD2J6K","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7I3XV7GD2J6KAK2V","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7I3XV7GD","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA","json":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA.json","graph_json":"https://pith.science/api/pith-number/7I3XV7GD2J6KAK2VT625P3MOQA/graph.json","events_json":"https://pith.science/api/pith-number/7I3XV7GD2J6KAK2VT625P3MOQA/events.json","paper":"https://pith.science/paper/7I3XV7GD"},"agent_actions":{"view_html":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA","download_json":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA.json","view_paper":"https://pith.science/paper/7I3XV7GD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07674&json=true","fetch_graph":"https://pith.science/api/pith-number/7I3XV7GD2J6KAK2VT625P3MOQA/graph.json","fetch_events":"https://pith.science/api/pith-number/7I3XV7GD2J6KAK2VT625P3MOQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA/action/storage_attestation","attest_author":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA/action/author_attestation","sign_citation":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA/action/citation_signature","submit_replication":"https://pith.science/pith/7I3XV7GD2J6KAK2VT625P3MOQA/action/replication_record"}},"created_at":"2026-05-18T01:32:02.212847+00:00","updated_at":"2026-05-18T01:32:02.212847+00:00"}