{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AJNICQCMKXBV2S2HX3MJ5CDBAL","short_pith_number":"pith:AJNICQCM","schema_version":"1.0","canonical_sha256":"025a81404c55c35d4b47bed89e886102fe0bd0ffa48a2257a608dd90145e488b","source":{"kind":"arxiv","id":"1507.04471","version":2},"attestation_state":"computed","paper":{"title":"Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Ilan Newman, Rogers Mathew, Yuri Rabinovich","submitted_at":"2015-07-16T07:34:47Z","abstract_excerpt":"A $d$-hypertree on $[n]$ is a maximal acyclic $d$-dimensional simplicial complex with full $(d-1)$-skeleton on the vertex set $[n]$. Alternatively, in the language of algebraic topology, it is a minimal $d$-dimensional simplicial complex $T$ (assuming full $(d-1)$-skeleton) such that $\\tilde{H}_{d-1}(T;\\mathbb{F})=0$.\n  The $d$-hypertrees are a basic object in combinatorial theory of simplicial complexes. They have been studied; and yet, many of their structural aspects remain poorly understood.\n  In this paper we study the boundaries $\\partial_d T$ of $d$-hypertrees, and the fundamental $d$-c"},"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":"1507.04471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T07:34:47Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"9c8ff64cc23337d4e5e0eba47660985d718fbe6d504c2890a0227300f620c899","abstract_canon_sha256":"56b4b6ef1a1ed815a84c2c1563cb978b6c243d4c1a01ac049c1bddce481c7cc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.592534Z","signature_b64":"FZ1tMoEeS1IoOfU+fEVTVp5dIQ9aM6l/go3JfOHI1Kfe/bqVtsCBrVfQkUciU/mzHU2gxittoNG2NwiApcWYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025a81404c55c35d4b47bed89e886102fe0bd0ffa48a2257a608dd90145e488b","last_reissued_at":"2026-05-18T01:25:11.591837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.591837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boundaries of Hypertrees, and Hamiltonian Cycles in Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Ilan Newman, Rogers Mathew, Yuri Rabinovich","submitted_at":"2015-07-16T07:34:47Z","abstract_excerpt":"A $d$-hypertree on $[n]$ is a maximal acyclic $d$-dimensional simplicial complex with full $(d-1)$-skeleton on the vertex set $[n]$. Alternatively, in the language of algebraic topology, it is a minimal $d$-dimensional simplicial complex $T$ (assuming full $(d-1)$-skeleton) such that $\\tilde{H}_{d-1}(T;\\mathbb{F})=0$.\n  The $d$-hypertrees are a basic object in combinatorial theory of simplicial complexes. They have been studied; and yet, many of their structural aspects remain poorly understood.\n  In this paper we study the boundaries $\\partial_d T$ of $d$-hypertrees, and the fundamental $d$-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04471","kind":"arxiv","version":2},"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":"1507.04471","created_at":"2026-05-18T01:25:11.591956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04471v2","created_at":"2026-05-18T01:25:11.591956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04471","created_at":"2026-05-18T01:25:11.591956+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJNICQCMKXBV","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJNICQCMKXBV2S2H","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJNICQCM","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/AJNICQCMKXBV2S2HX3MJ5CDBAL","json":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL.json","graph_json":"https://pith.science/api/pith-number/AJNICQCMKXBV2S2HX3MJ5CDBAL/graph.json","events_json":"https://pith.science/api/pith-number/AJNICQCMKXBV2S2HX3MJ5CDBAL/events.json","paper":"https://pith.science/paper/AJNICQCM"},"agent_actions":{"view_html":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL","download_json":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL.json","view_paper":"https://pith.science/paper/AJNICQCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04471&json=true","fetch_graph":"https://pith.science/api/pith-number/AJNICQCMKXBV2S2HX3MJ5CDBAL/graph.json","fetch_events":"https://pith.science/api/pith-number/AJNICQCMKXBV2S2HX3MJ5CDBAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL/action/storage_attestation","attest_author":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL/action/author_attestation","sign_citation":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL/action/citation_signature","submit_replication":"https://pith.science/pith/AJNICQCMKXBV2S2HX3MJ5CDBAL/action/replication_record"}},"created_at":"2026-05-18T01:25:11.591956+00:00","updated_at":"2026-05-18T01:25:11.591956+00:00"}