{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:37G7YLZ5LPDZPAVVXN6JZVR3RT","short_pith_number":"pith:37G7YLZ5","schema_version":"1.0","canonical_sha256":"dfcdfc2f3d5bc79782b5bb7c9cd63b8cdd6af9342a8c7ac5f44e5ed8482434fe","source":{"kind":"arxiv","id":"1508.05901","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.05901","created_at":"2026-05-18T00:42:33.338061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05901v1","created_at":"2026-05-18T00:42:33.338061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05901","created_at":"2026-05-18T00:42:33.338061+00:00"},{"alias_kind":"pith_short_12","alias_value":"37G7YLZ5LPDZ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"37G7YLZ5LPDZPAVV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"37G7YLZ5","created_at":"2026-05-18T12:29:02.477457+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/37G7YLZ5LPDZPAVVXN6JZVR3RT","json":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT.json","graph_json":"https://pith.science/api/pith-number/37G7YLZ5LPDZPAVVXN6JZVR3RT/graph.json","events_json":"https://pith.science/api/pith-number/37G7YLZ5LPDZPAVVXN6JZVR3RT/events.json","paper":"https://pith.science/paper/37G7YLZ5"},"agent_actions":{"view_html":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT","download_json":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT.json","view_paper":"https://pith.science/paper/37G7YLZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05901&json=true","fetch_graph":"https://pith.science/api/pith-number/37G7YLZ5LPDZPAVVXN6JZVR3RT/graph.json","fetch_events":"https://pith.science/api/pith-number/37G7YLZ5LPDZPAVVXN6JZVR3RT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/action/storage_attestation","attest_author":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/action/author_attestation","sign_citation":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/action/citation_signature","submit_replication":"https://pith.science/pith/37G7YLZ5LPDZPAVVXN6JZVR3RT/action/replication_record"}},"created_at":"2026-05-18T00:42:33.338061+00:00","updated_at":"2026-05-18T00:42:33.338061+00:00"}