{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KTRBC5WJKDWLOHSFDOADY5MKBQ","short_pith_number":"pith:KTRBC5WJ","schema_version":"1.0","canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","source":{"kind":"arxiv","id":"1907.07907","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonian and Pseudo-Hamiltonian Cycles and Fillings In Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Ilan Newman, Rogers Mathew, Yuri Rabinovich","submitted_at":"2019-07-18T07:15:10Z","abstract_excerpt":"We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \\choose d}$.\n  The discussion is restricted to the fields $F_2$ and $Q$. For $d=2$, we characterize the $n$'s for which Hamiltonian $2$-cycles exist. For $d=3$ it is shown that Hamiltonian $3$-cycles exist for infinitely many $n$'s. In general, it is shown that there always exist simple $d$-cycles of size ${{n-1"},"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":"1907.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T07:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"e3f11bd32061eb548b782e0809bd5b400f1ca46ac2c286dca801b0f04fa920d7","abstract_canon_sha256":"1ecd61498ffc953cc1c0ced08369199001a4b815fafb500927ad39b29d687d7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.740620Z","signature_b64":"9b1sKhlxdMOsNlPKs8BKfRAh4MAONlsKBcxdoLKbyNn3xO3OuOg1wNAprX3sijQnvRgSPAR34TJiuIJUgesMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","last_reissued_at":"2026-05-17T23:40:15.739917Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.739917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian and Pseudo-Hamiltonian Cycles and Fillings In Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, Ilan Newman, Rogers Mathew, Yuri Rabinovich","submitted_at":"2019-07-18T07:15:10Z","abstract_excerpt":"We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \\choose d}$.\n  The discussion is restricted to the fields $F_2$ and $Q$. For $d=2$, we characterize the $n$'s for which Hamiltonian $2$-cycles exist. For $d=3$ it is shown that Hamiltonian $3$-cycles exist for infinitely many $n$'s. In general, it is shown that there always exist simple $d$-cycles of size ${{n-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07907","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":"1907.07907","created_at":"2026-05-17T23:40:15.740104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07907v1","created_at":"2026-05-17T23:40:15.740104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07907","created_at":"2026-05-17T23:40:15.740104+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTRBC5WJKDWL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTRBC5WJKDWLOHSF","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTRBC5WJ","created_at":"2026-05-18T12:33:21.387695+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/KTRBC5WJKDWLOHSFDOADY5MKBQ","json":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ.json","graph_json":"https://pith.science/api/pith-number/KTRBC5WJKDWLOHSFDOADY5MKBQ/graph.json","events_json":"https://pith.science/api/pith-number/KTRBC5WJKDWLOHSFDOADY5MKBQ/events.json","paper":"https://pith.science/paper/KTRBC5WJ"},"agent_actions":{"view_html":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ","download_json":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ.json","view_paper":"https://pith.science/paper/KTRBC5WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07907&json=true","fetch_graph":"https://pith.science/api/pith-number/KTRBC5WJKDWLOHSFDOADY5MKBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KTRBC5WJKDWLOHSFDOADY5MKBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/action/storage_attestation","attest_author":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/action/author_attestation","sign_citation":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/action/citation_signature","submit_replication":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/action/replication_record"}},"created_at":"2026-05-17T23:40:15.740104+00:00","updated_at":"2026-05-17T23:40:15.740104+00:00"}