{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:37G7YLZ5LPDZPAVVXN6JZVR3RT","short_pith_number":"pith:37G7YLZ5","canonical_record":{"source":{"id":"1508.05901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-24T18:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"99bf427781dad2fb0efb3d9c61e9a5780ab90afd14f5eecf94a426b635195bb3","abstract_canon_sha256":"fb25cf6f0342a6478cb14b614dda40ea7f45cfa2811292c42e74fb0f72acb07b"},"schema_version":"1.0"},"canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","source":{"kind":"arxiv","id":"1508.05901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05901","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05901v1","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05901","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"37G7YLZ5LPDZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"37G7YLZ5LPDZPAVV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"37G7YLZ5","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:37G7YLZ5LPDZPAVVXN6JZVR3RT","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-24T18:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"99bf427781dad2fb0efb3d9c61e9a5780ab90afd14f5eecf94a426b635195bb3","abstract_canon_sha256":"fb25cf6f0342a6478cb14b614dda40ea7f45cfa2811292c42e74fb0f72acb07b"},"schema_version":"1.0"},"canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.338576Z","signature_b64":"K8KOVj7G5qBEy+VK3n+/VqLT6YPvpF6zTs0DbpyqyWQHNJcKRgMjcikWwdllqIFadTkUtcpKBF1xz/6nYybVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","last_reissued_at":"2026-05-18T00:42:33.337981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.337981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05901","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:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o00SCxRiztg+ovKTyWre8QO6E+NAi05cvXdoVEy2GmrlCE4k6q6pndYrkgZYi5EMh9qWxDCR7VScB1lsJoswAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:15:51.137356Z"},"content_sha256":"304cc6e159dc63e071d0a125c9aeb7e24d3175947bad9c4d1034d39ca9673496","schema_version":"1.0","event_id":"sha256:304cc6e159dc63e071d0a125c9aeb7e24d3175947bad9c4d1034d39ca9673496"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:37G7YLZ5LPDZPAVVXN6JZVR3RT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Hamiltonian problem and $t$-path traceable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kashif Bari, Michael E. O'Sullivan","submitted_at":"2015-08-24T18:12:37Z","abstract_excerpt":"The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves with respect to disjoint union of graphs and the join with a complete graph. Our main result is a decomposition theorem that reduces the problem of characterizing maximal $t$-path traceable graphs to characterizing those that have no universal vertex. We generalize a construction of maximal non-traceable graphs by Zelinka to $t$-path traceable graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05901","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:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KwjipJCo/NKdxnMAbnEG0WvGi6g87V7k3Lt37i6/cY7ckNy5VQVmNmhk1nQ51KrHElF2a/yA4CxWBGwscNyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:15:51.137696Z"},"content_sha256":"5e5f7ba04858c8a1f57d383f00900082e116b4bb3bc092fc869de163a572a1ff","schema_version":"1.0","event_id":"sha256:5e5f7ba04858c8a1f57d383f00900082e116b4bb3bc092fc869de163a572a1ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/bundle.json","state_url":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/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-28T08:15:51Z","links":{"resolver":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT","bundle":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/bundle.json","state":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:37G7YLZ5LPDZPAVVXN6JZVR3RT","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":"fb25cf6f0342a6478cb14b614dda40ea7f45cfa2811292c42e74fb0f72acb07b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-24T18:12:37Z","title_canon_sha256":"99bf427781dad2fb0efb3d9c61e9a5780ab90afd14f5eecf94a426b635195bb3"},"schema_version":"1.0","source":{"id":"1508.05901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05901","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05901v1","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05901","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"37G7YLZ5LPDZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"37G7YLZ5LPDZPAVV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"37G7YLZ5","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:5e5f7ba04858c8a1f57d383f00900082e116b4bb3bc092fc869de163a572a1ff","target":"graph","created_at":"2026-05-18T00:42:33Z","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":"The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves with respect to disjoint union of graphs and the join with a complete graph. Our main result is a decomposition theorem that reduces the problem of characterizing maximal $t$-path traceable graphs to characterizing those that have no universal vertex. We generalize a construction of maximal non-traceable graphs by Zelinka to $t$-path traceable graphs.","authors_text":"Kashif Bari, Michael E. O'Sullivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-24T18:12:37Z","title":"The Hamiltonian problem and $t$-path traceable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05901","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:304cc6e159dc63e071d0a125c9aeb7e24d3175947bad9c4d1034d39ca9673496","target":"record","created_at":"2026-05-18T00:42:33Z","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":"fb25cf6f0342a6478cb14b614dda40ea7f45cfa2811292c42e74fb0f72acb07b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-24T18:12:37Z","title_canon_sha256":"99bf427781dad2fb0efb3d9c61e9a5780ab90afd14f5eecf94a426b635195bb3"},"schema_version":"1.0","source":{"id":"1508.05901","kind":"arxiv","version":1}},"canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","first_computed_at":"2026-05-18T00:42:33.337981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:33.337981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8KOVj7G5qBEy+VK3n+/VqLT6YPvpF6zTs0DbpyqyWQHNJcKRgMjcikWwdllqIFadTkUtcpKBF1xz/6nYybVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:33.338576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:304cc6e159dc63e071d0a125c9aeb7e24d3175947bad9c4d1034d39ca9673496","sha256:5e5f7ba04858c8a1f57d383f00900082e116b4bb3bc092fc869de163a572a1ff"],"state_sha256":"b96285f2fc781dde103bcdfb970587637c12b691438f4cf52341c6273ce04584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLD42jqGLSc05fzE68OHxDNrlVLAGDRStliSovveDX6oIqDpMgefIuoxUKfOh6t30YHTENxPjTq6fDQzcr9rBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:15:51.139553Z","bundle_sha256":"fa4486a7d02a67d53259cee3767bd7de3a4d90710865e284ea857c8f65840870"}}