{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C42KPEBW6PCO5JZ24WPVU536CS","short_pith_number":"pith:C42KPEBW","schema_version":"1.0","canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","source":{"kind":"arxiv","id":"1607.08850","version":2},"attestation_state":"computed","paper":{"title":"Bounding the distance among longest paths in a connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Jakub Teska, Jan Ekstein, Shinya Fujita","submitted_at":"2016-07-29T15:25:28Z","abstract_excerpt":"It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no common vertex, but every k-1 longest paths have a common vertex. It is not known whether every 3 longest paths in a connected graph have a common vertex and similarly for 4, 5, and 6 longest path. In [5] the authors give an upper bound on distance among 3 longest paths in a connected graph. In this paper we give a similar upper bound on distance between 4 longest paths and also for k longest paths, in general."},"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":"1607.08850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-29T15:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"17215b0226263cf0d30cf144c55a4b32c1013319cefc5875121239a8bf8724b1","abstract_canon_sha256":"a9df35b45bbb6410040898ba5eebe394ab5cfc7325895d61a9f1dbd6d2c77765"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:56.830780Z","signature_b64":"F46cL0nYZGyEDbAXjW98v81qa0sUKaALQrg0s0lheSgz/9hQh2HFQs3iOa0LdyOSSOZsMXrsmSkBUOoeEHEYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","last_reissued_at":"2026-05-18T00:16:56.830133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:56.830133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the distance among longest paths in a connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Jakub Teska, Jan Ekstein, Shinya Fujita","submitted_at":"2016-07-29T15:25:28Z","abstract_excerpt":"It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no common vertex, but every k-1 longest paths have a common vertex. It is not known whether every 3 longest paths in a connected graph have a common vertex and similarly for 4, 5, and 6 longest path. In [5] the authors give an upper bound on distance among 3 longest paths in a connected graph. In this paper we give a similar upper bound on distance between 4 longest paths and also for k longest paths, in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08850","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.08850","created_at":"2026-05-18T00:16:56.830234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08850v2","created_at":"2026-05-18T00:16:56.830234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08850","created_at":"2026-05-18T00:16:56.830234+00:00"},{"alias_kind":"pith_short_12","alias_value":"C42KPEBW6PCO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C42KPEBW6PCO5JZ2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C42KPEBW","created_at":"2026-05-18T12:30:09.641336+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/C42KPEBW6PCO5JZ24WPVU536CS","json":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS.json","graph_json":"https://pith.science/api/pith-number/C42KPEBW6PCO5JZ24WPVU536CS/graph.json","events_json":"https://pith.science/api/pith-number/C42KPEBW6PCO5JZ24WPVU536CS/events.json","paper":"https://pith.science/paper/C42KPEBW"},"agent_actions":{"view_html":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS","download_json":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS.json","view_paper":"https://pith.science/paper/C42KPEBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08850&json=true","fetch_graph":"https://pith.science/api/pith-number/C42KPEBW6PCO5JZ24WPVU536CS/graph.json","fetch_events":"https://pith.science/api/pith-number/C42KPEBW6PCO5JZ24WPVU536CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/action/storage_attestation","attest_author":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/action/author_attestation","sign_citation":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/action/citation_signature","submit_replication":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/action/replication_record"}},"created_at":"2026-05-18T00:16:56.830234+00:00","updated_at":"2026-05-18T00:16:56.830234+00:00"}