{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RNMTOJMJWEDESQ3T676TBISAHQ","short_pith_number":"pith:RNMTOJMJ","schema_version":"1.0","canonical_sha256":"8b59372589b106494373f7fd30a2403c3025e5cbcc53210dab2e51ea28e52f4c","source":{"kind":"arxiv","id":"1611.01710","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01710","created_at":"2026-05-18T00:59:56.783833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01710v1","created_at":"2026-05-18T00:59:56.783833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01710","created_at":"2026-05-18T00:59:56.783833+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNMTOJMJWEDE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNMTOJMJWEDESQ3T","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNMTOJMJ","created_at":"2026-05-18T12:30:41.710351+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/RNMTOJMJWEDESQ3T676TBISAHQ","json":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ.json","graph_json":"https://pith.science/api/pith-number/RNMTOJMJWEDESQ3T676TBISAHQ/graph.json","events_json":"https://pith.science/api/pith-number/RNMTOJMJWEDESQ3T676TBISAHQ/events.json","paper":"https://pith.science/paper/RNMTOJMJ"},"agent_actions":{"view_html":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ","download_json":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ.json","view_paper":"https://pith.science/paper/RNMTOJMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01710&json=true","fetch_graph":"https://pith.science/api/pith-number/RNMTOJMJWEDESQ3T676TBISAHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RNMTOJMJWEDESQ3T676TBISAHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/action/storage_attestation","attest_author":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/action/author_attestation","sign_citation":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/action/citation_signature","submit_replication":"https://pith.science/pith/RNMTOJMJWEDESQ3T676TBISAHQ/action/replication_record"}},"created_at":"2026-05-18T00:59:56.783833+00:00","updated_at":"2026-05-18T00:59:56.783833+00:00"}