{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C42KPEBW6PCO5JZ24WPVU536CS","short_pith_number":"pith:C42KPEBW","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"},"canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","source":{"kind":"arxiv","id":"1607.08850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08850","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08850v2","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08850","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"C42KPEBW6PCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C42KPEBW6PCO5JZ2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C42KPEBW","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C42KPEBW6PCO5JZ24WPVU536CS","target":"record","payload":{"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"},"canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","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"},"source_kind":"arxiv","source_id":"1607.08850","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-18T00:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuQtO5jsgz8fRh8g1Qydu2ME2PzZ11jpyeJJsHmZdla5qtkFHlfovnVC8jHBKYGNxe5VLgaI3tud12wWgghaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:55:59.947265Z"},"content_sha256":"8cca0773bd6a85cf809c66f9377066486a1d4f7daa3eda85afa4653765d7950b","schema_version":"1.0","event_id":"sha256:8cca0773bd6a85cf809c66f9377066486a1d4f7daa3eda85afa4653765d7950b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C42KPEBW6PCO5JZ24WPVU536CS","target":"graph","payload":{"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"},"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:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAmlOcsne44cmRoWqAFGxMACPS51oEPaDfq0VWg8PwvUjXzxHlpuYkHxroBt7huagNtokamVd2oxXG5LO0n3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:55:59.947689Z"},"content_sha256":"97498213d460261baf7111250809d6d9aec67c2fca616dfd26e354550f143c05","schema_version":"1.0","event_id":"sha256:97498213d460261baf7111250809d6d9aec67c2fca616dfd26e354550f143c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/bundle.json","state_url":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C42KPEBW6PCO5JZ24WPVU536CS/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-26T16:55:59Z","links":{"resolver":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS","bundle":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/bundle.json","state":"https://pith.science/pith/C42KPEBW6PCO5JZ24WPVU536CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C42KPEBW6PCO5JZ24WPVU536CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C42KPEBW6PCO5JZ24WPVU536CS","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":"a9df35b45bbb6410040898ba5eebe394ab5cfc7325895d61a9f1dbd6d2c77765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-29T15:25:28Z","title_canon_sha256":"17215b0226263cf0d30cf144c55a4b32c1013319cefc5875121239a8bf8724b1"},"schema_version":"1.0","source":{"id":"1607.08850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08850","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08850v2","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08850","created_at":"2026-05-18T00:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"C42KPEBW6PCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C42KPEBW6PCO5JZ2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C42KPEBW","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:97498213d460261baf7111250809d6d9aec67c2fca616dfd26e354550f143c05","target":"graph","created_at":"2026-05-18T00:16:56Z","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":"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.","authors_text":"Adam Kabela, Jakub Teska, Jan Ekstein, Shinya Fujita","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-29T15:25:28Z","title":"Bounding the distance among longest paths in a connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08850","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:8cca0773bd6a85cf809c66f9377066486a1d4f7daa3eda85afa4653765d7950b","target":"record","created_at":"2026-05-18T00:16:56Z","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":"a9df35b45bbb6410040898ba5eebe394ab5cfc7325895d61a9f1dbd6d2c77765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-29T15:25:28Z","title_canon_sha256":"17215b0226263cf0d30cf144c55a4b32c1013319cefc5875121239a8bf8724b1"},"schema_version":"1.0","source":{"id":"1607.08850","kind":"arxiv","version":2}},"canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1734a79036f3c4eea73ae59f5a777e14997ae9726326e9f81253aca85af911a5","first_computed_at":"2026-05-18T00:16:56.830133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:56.830133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F46cL0nYZGyEDbAXjW98v81qa0sUKaALQrg0s0lheSgz/9hQh2HFQs3iOa0LdyOSSOZsMXrsmSkBUOoeEHEYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:56.830780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cca0773bd6a85cf809c66f9377066486a1d4f7daa3eda85afa4653765d7950b","sha256:97498213d460261baf7111250809d6d9aec67c2fca616dfd26e354550f143c05"],"state_sha256":"95ed13adf966a9011816547918dbb5e9a930fa7d1e96e75b93bb8da050957ca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDZ6sHBGHww+By7YDY2e4V4fkPVMUHVFNz4dZAN5jshRmZ+4bf/et6M+aAsDLcg0JMZNQFeWwoqeHePvkySvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:55:59.951294Z","bundle_sha256":"3567b7d02101a02f78d62a8cdca918df022c2fbcedb3ef5d348e914c771201da"}}