{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RNMTOJMJWEDESQ3T676TBISAHQ","short_pith_number":"pith:RNMTOJMJ","canonical_record":{"source":{"id":"1611.01710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T23:38:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ca49dd2e3f5ef89eeb110b0df9cd20ed26804af8bfd5a96b82b334839d1a884f","abstract_canon_sha256":"fddd15877ba438baf5aa341089163ffe310d1af76be1d2888f64d82fb12375e0"},"schema_version":"1.0"},"canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","source":{"kind":"arxiv","id":"1611.01710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01710","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01710v1","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01710","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"RNMTOJMJWEDE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNMTOJMJWEDESQ3T","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNMTOJMJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RNMTOJMJWEDESQ3T676TBISAHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T23:38:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ca49dd2e3f5ef89eeb110b0df9cd20ed26804af8bfd5a96b82b334839d1a884f","abstract_canon_sha256":"fddd15877ba438baf5aa341089163ffe310d1af76be1d2888f64d82fb12375e0"},"schema_version":"1.0"},"canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:56.784310Z","signature_b64":"d5w2KjXVauucpRf4/gca4pFZ7aN4kqqyRMML/V3pBKgls7hRUEOSCdf/zkX38GWhF3AyE0c5KwNqlevE2KeHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","last_reissued_at":"2026-05-18T00:59:56.783750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:56.783750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01710","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-18T00:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0aUTRohFjgaXdp5H/NnUcMIexcaxbwd8W3PVlmC+x5WWgAel1SyctyXynAj9DqNFBNZli6eQaodHK/10qNgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:18:48.835855Z"},"content_sha256":"87b1d6904e01e40d3401d51c1b0f1ec4dde67f07de4c1b1128a71bc404f3d204","schema_version":"1.0","event_id":"sha256:87b1d6904e01e40d3401d51c1b0f1ec4dde67f07de4c1b1128a71bc404f3d204"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RNMTOJMJWEDESQ3T676TBISAHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Graph non-Hamiltonicity via a Closure Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"A. Lee, C. E. Bell, E. R. Swart, N. R. Swart, S. J. Gismondi","submitted_at":"2016-11-05T23:38:23Z","abstract_excerpt":"We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresponds with each of the $n!$ $n$-permutation matrices $P$, such that $p_{u,i}=1$ if and only if the $i^{th}$ arc in a cycle enters vertex $u$, starting and ending at vertex $n+1$. A graph instance ($G$) is initially coded as exclusion set $E$, whose members are pairs of components of $P$, $\\{p_{u,i} ,p_{v,i+1}\\}, i=1,n-1$, for each arc $(u,v)$ not in $G$. For each $\\{p_{u,i} ,p_{v,i+1}\\}\\in E$, the set of $P$ satisfyin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01710","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-18T00:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVa9xKoLAVmCxVcUwRWImr0qw+6v8QLi3IBtF9SA9Q/6Ticvk1mHqCjzrnErS20BbH2FpW0BUdWoFu9LqY57DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:18:48.836483Z"},"content_sha256":"68d7b99bd57bea334522cc762c8e5317650306b3a30a67779ac5cefa602817af","schema_version":"1.0","event_id":"sha256:68d7b99bd57bea334522cc762c8e5317650306b3a30a67779ac5cefa602817af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/bundle.json","state_url":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNMTOJMJWEDESQ3T676TBISAHQ/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-07-31T18:18:48Z","links":{"resolver":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ","bundle":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/bundle.json","state":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNMTOJMJWEDESQ3T676TBISAHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RNMTOJMJWEDESQ3T676TBISAHQ","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":"fddd15877ba438baf5aa341089163ffe310d1af76be1d2888f64d82fb12375e0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T23:38:23Z","title_canon_sha256":"ca49dd2e3f5ef89eeb110b0df9cd20ed26804af8bfd5a96b82b334839d1a884f"},"schema_version":"1.0","source":{"id":"1611.01710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01710","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01710v1","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01710","created_at":"2026-05-18T00:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"RNMTOJMJWEDE","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNMTOJMJWEDESQ3T","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNMTOJMJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:68d7b99bd57bea334522cc762c8e5317650306b3a30a67779ac5cefa602817af","target":"graph","created_at":"2026-05-18T00:59:56Z","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 present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresponds with each of the $n!$ $n$-permutation matrices $P$, such that $p_{u,i}=1$ if and only if the $i^{th}$ arc in a cycle enters vertex $u$, starting and ending at vertex $n+1$. A graph instance ($G$) is initially coded as exclusion set $E$, whose members are pairs of components of $P$, $\\{p_{u,i} ,p_{v,i+1}\\}, i=1,n-1$, for each arc $(u,v)$ not in $G$. For each $\\{p_{u,i} ,p_{v,i+1}\\}\\in E$, the set of $P$ satisfyin","authors_text":"A. Lee, C. E. Bell, E. R. Swart, N. R. Swart, S. J. Gismondi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T23:38:23Z","title":"Deciding Graph non-Hamiltonicity via a Closure Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01710","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:87b1d6904e01e40d3401d51c1b0f1ec4dde67f07de4c1b1128a71bc404f3d204","target":"record","created_at":"2026-05-18T00:59:56Z","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":"fddd15877ba438baf5aa341089163ffe310d1af76be1d2888f64d82fb12375e0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-05T23:38:23Z","title_canon_sha256":"ca49dd2e3f5ef89eeb110b0df9cd20ed26804af8bfd5a96b82b334839d1a884f"},"schema_version":"1.0","source":{"id":"1611.01710","kind":"arxiv","version":1}},"canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","first_computed_at":"2026-05-18T00:59:56.783750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:56.783750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d5w2KjXVauucpRf4/gca4pFZ7aN4kqqyRMML/V3pBKgls7hRUEOSCdf/zkX38GWhF3AyE0c5KwNqlevE2KeHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:56.784310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b1d6904e01e40d3401d51c1b0f1ec4dde67f07de4c1b1128a71bc404f3d204","sha256:68d7b99bd57bea334522cc762c8e5317650306b3a30a67779ac5cefa602817af"],"state_sha256":"18cf05822db54f627857a7ba2f018d2a3941d75155ed6a27eb0b9b94e5cbb03d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+avHXT9V+nTfSnsz0Lriu50UJbOR0yR2OVnnUyLt2NM7uTLVLoeCnM45sMxAbr9MmbxkpzzHdKR6zZL5Tn0eDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T18:18:48.843977Z","bundle_sha256":"1b646790ab0eb415ba2221061f55d7a1558a01d099560cf2fae6f4524805d45b"}}