{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SQSNAVDTPE375CNNIP4X76ZQ5Z","short_pith_number":"pith:SQSNAVDT","canonical_record":{"source":{"id":"1511.02038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-06T11:39:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"80a7208bb2736be218c735be14f294b9ff779fd36bcfc8013f3b7c1820bd0577","abstract_canon_sha256":"03e86ecc6347b2ab6419c2404113256f37a3544df96a71e2bf6f05d086b4a6fa"},"schema_version":"1.0"},"canonical_sha256":"9424d054737937fe89ad43f97ffb30ee5d17ee74f8e5d1224cc3238c29796e10","source":{"kind":"arxiv","id":"1511.02038","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02038","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02038v2","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02038","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"SQSNAVDTPE37","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQSNAVDTPE375CNN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQSNAVDT","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SQSNAVDTPE375CNNIP4X76ZQ5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-06T11:39:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"80a7208bb2736be218c735be14f294b9ff779fd36bcfc8013f3b7c1820bd0577","abstract_canon_sha256":"03e86ecc6347b2ab6419c2404113256f37a3544df96a71e2bf6f05d086b4a6fa"},"schema_version":"1.0"},"canonical_sha256":"9424d054737937fe89ad43f97ffb30ee5d17ee74f8e5d1224cc3238c29796e10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.832580Z","signature_b64":"yBzUgFhZ10+n1N4C5Y9phf+t4/K0cYEAqbskcsU0Afa6PCzVxLGscRzrS1V3RO9nCOuOq8t6VhCE/45TGcSfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9424d054737937fe89ad43f97ffb30ee5d17ee74f8e5d1224cc3238c29796e10","last_reissued_at":"2026-05-18T01:10:45.832204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.832204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02038","source_version":2,"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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wjfYYy0cUmjIVGL7kF+tvOZbGKQXWG4Fy6j2w4zMNcAak0hNr5iNCnJA0r1nKjyZ019gye4yuFrW6LK1MbLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:57.774695Z"},"content_sha256":"3b5cf51fd6f7e12452fbcbcb97165c7dd6e73f7e31b8b2264d45cb5848131bdc","schema_version":"1.0","event_id":"sha256:3b5cf51fd6f7e12452fbcbcb97165c7dd6e73f7e31b8b2264d45cb5848131bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SQSNAVDTPE375CNNIP4X76ZQ5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-Trees: Structural Insights and the study of Hamiltonian Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"N. Sadagopan, P. Renjith","submitted_at":"2015-11-06T11:39:15Z","abstract_excerpt":"For a connected graph, a path containing all vertices is known as \\emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a Hamiltonian path in general graphs is NP-Complete. We present a necessary and sufficient condition for the existence of Hamiltonian paths in 2-trees. Using our characterization, we also present a linear-time algorithm for the existence of Hamiltonian paths in 2-trees. Our characterization is based on a deep understanding of the structure of 2-trees and the combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02038","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"},"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-18T01:10:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0M0fEFuX5kIi0Nar5Q9gBYf44DpUNR3RYnAp+21UeCmdJc3r0AZMEIBHJ1AAKEHBNvsYJN5WVnGg0AlY90vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:57.775410Z"},"content_sha256":"ed180468b22025a9934f252949af1a7e1cf4339f527a5bb8206de98aee1a17b5","schema_version":"1.0","event_id":"sha256:ed180468b22025a9934f252949af1a7e1cf4339f527a5bb8206de98aee1a17b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/bundle.json","state_url":"https://pith.science/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/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-05-30T02:17:57Z","links":{"resolver":"https://pith.science/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z","bundle":"https://pith.science/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/bundle.json","state":"https://pith.science/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQSNAVDTPE375CNNIP4X76ZQ5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SQSNAVDTPE375CNNIP4X76ZQ5Z","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":"03e86ecc6347b2ab6419c2404113256f37a3544df96a71e2bf6f05d086b4a6fa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-06T11:39:15Z","title_canon_sha256":"80a7208bb2736be218c735be14f294b9ff779fd36bcfc8013f3b7c1820bd0577"},"schema_version":"1.0","source":{"id":"1511.02038","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02038","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02038v2","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02038","created_at":"2026-05-18T01:10:45Z"},{"alias_kind":"pith_short_12","alias_value":"SQSNAVDTPE37","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SQSNAVDTPE375CNN","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SQSNAVDT","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:ed180468b22025a9934f252949af1a7e1cf4339f527a5bb8206de98aee1a17b5","target":"graph","created_at":"2026-05-18T01:10:45Z","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":"For a connected graph, a path containing all vertices is known as \\emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a Hamiltonian path in general graphs is NP-Complete. We present a necessary and sufficient condition for the existence of Hamiltonian paths in 2-trees. Using our characterization, we also present a linear-time algorithm for the existence of Hamiltonian paths in 2-trees. Our characterization is based on a deep understanding of the structure of 2-trees and the combin","authors_text":"N. Sadagopan, P. Renjith","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-06T11:39:15Z","title":"2-Trees: Structural Insights and the study of Hamiltonian Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02038","kind":"arxiv","version":2},"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:3b5cf51fd6f7e12452fbcbcb97165c7dd6e73f7e31b8b2264d45cb5848131bdc","target":"record","created_at":"2026-05-18T01:10:45Z","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":"03e86ecc6347b2ab6419c2404113256f37a3544df96a71e2bf6f05d086b4a6fa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-06T11:39:15Z","title_canon_sha256":"80a7208bb2736be218c735be14f294b9ff779fd36bcfc8013f3b7c1820bd0577"},"schema_version":"1.0","source":{"id":"1511.02038","kind":"arxiv","version":2}},"canonical_sha256":"9424d054737937fe89ad43f97ffb30ee5d17ee74f8e5d1224cc3238c29796e10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9424d054737937fe89ad43f97ffb30ee5d17ee74f8e5d1224cc3238c29796e10","first_computed_at":"2026-05-18T01:10:45.832204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:45.832204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBzUgFhZ10+n1N4C5Y9phf+t4/K0cYEAqbskcsU0Afa6PCzVxLGscRzrS1V3RO9nCOuOq8t6VhCE/45TGcSfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:45.832580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02038","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b5cf51fd6f7e12452fbcbcb97165c7dd6e73f7e31b8b2264d45cb5848131bdc","sha256:ed180468b22025a9934f252949af1a7e1cf4339f527a5bb8206de98aee1a17b5"],"state_sha256":"3ad665314d8e6bdcb607175b32a7a994fee106d44a66197e3a3ace2c7adf1ec1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgjDLCkDXiF/hD2DXJmGxGum7NKdgMkC1Fdtq7usZX0ttOOPajD5frs+0etqXG2ns0SX+xyE6qc1/z5Xp/c1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:17:57.778972Z","bundle_sha256":"8c421387ae9aa7f2d8734c723b85ff7b1ef0b4f2250d70b5265c05edfb7c2c60"}}