{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KTRBC5WJKDWLOHSFDOADY5MKBQ","short_pith_number":"pith:KTRBC5WJ","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"},"canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","source":{"kind":"arxiv","id":"1907.07907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07907","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07907v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07907","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"KTRBC5WJKDWL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KTRBC5WJKDWLOHSF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KTRBC5WJ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KTRBC5WJKDWLOHSFDOADY5MKBQ","target":"record","payload":{"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"},"canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","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"},"source_kind":"arxiv","source_id":"1907.07907","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEj4Lp5bg65U1LUVWiBBveK7jrRHGlUt87ldx1J9ViUODU+IZ0H7n2iqmkQEJvAL0qjv8FE+G6YiD3t60CGoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:06.627221Z"},"content_sha256":"f08d8645bf4711584219fa5e913b144b04ffd1c8e8aa8a9d5523238aaaf66a12","schema_version":"1.0","event_id":"sha256:f08d8645bf4711584219fa5e913b144b04ffd1c8e8aa8a9d5523238aaaf66a12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KTRBC5WJKDWLOHSFDOADY5MKBQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHxt2zj3PWs5RiyyFoMV6IKY69czYpmmFkBdIbtrnC0kd+sm+l5mof337sIBXqXitjvcQXWeLigt2zXfH4YuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:06.627586Z"},"content_sha256":"8f7787566bcca220c517ef2af0165e23c6448dedeeebecce1d687142a39ac562","schema_version":"1.0","event_id":"sha256:8f7787566bcca220c517ef2af0165e23c6448dedeeebecce1d687142a39ac562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/bundle.json","state_url":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T13:43:06Z","links":{"resolver":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ","bundle":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/bundle.json","state":"https://pith.science/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTRBC5WJKDWLOHSFDOADY5MKBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KTRBC5WJKDWLOHSFDOADY5MKBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ecd61498ffc953cc1c0ced08369199001a4b815fafb500927ad39b29d687d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T07:15:10Z","title_canon_sha256":"e3f11bd32061eb548b782e0809bd5b400f1ca46ac2c286dca801b0f04fa920d7"},"schema_version":"1.0","source":{"id":"1907.07907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07907","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07907v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07907","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"KTRBC5WJKDWL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KTRBC5WJKDWLOHSF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KTRBC5WJ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8f7787566bcca220c517ef2af0165e23c6448dedeeebecce1d687142a39ac562","target":"graph","created_at":"2026-05-17T23:40:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Deepak Rajendraprasad, Ilan Newman, Rogers Mathew, Yuri Rabinovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T07:15:10Z","title":"Hamiltonian and Pseudo-Hamiltonian Cycles and Fillings In Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07907","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f08d8645bf4711584219fa5e913b144b04ffd1c8e8aa8a9d5523238aaaf66a12","target":"record","created_at":"2026-05-17T23:40:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ecd61498ffc953cc1c0ced08369199001a4b815fafb500927ad39b29d687d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-18T07:15:10Z","title_canon_sha256":"e3f11bd32061eb548b782e0809bd5b400f1ca46ac2c286dca801b0f04fa920d7"},"schema_version":"1.0","source":{"id":"1907.07907","kind":"arxiv","version":1}},"canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e21176c950ecb71e451b803c758a0c284ad7e982218ed25a69d171b2668475","first_computed_at":"2026-05-17T23:40:15.739917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.739917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9b1sKhlxdMOsNlPKs8BKfRAh4MAONlsKBcxdoLKbyNn3xO3OuOg1wNAprX3sijQnvRgSPAR34TJiuIJUgesMAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.740620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f08d8645bf4711584219fa5e913b144b04ffd1c8e8aa8a9d5523238aaaf66a12","sha256:8f7787566bcca220c517ef2af0165e23c6448dedeeebecce1d687142a39ac562"],"state_sha256":"6f0a870ef1e8d55efb7b4e529bc04dd627930cf0732cde67ffd7a036f747d23d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4DatW+G8hUYw1ruw5mxmHfKcKRsXOC/37bss77D35OU3j4ffJDvFHSoLXIVqsrmaho+IncnFHhqrnaolGGwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:43:06.629662Z","bundle_sha256":"8d1c5d924ca233038db03abf87543432e4ab47e82a3afd9f150918d4479106b9"}}