{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:66A52ZCCNE3SQXG3JPD3SC6Q2U","short_pith_number":"pith:66A52ZCC","canonical_record":{"source":{"id":"1401.7931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"3e1686db1b31fc35915bc1335ab27cbc308749465a457ac6201951e903c58e1b","abstract_canon_sha256":"f8c7ef4f60a03ae8b3e770f2e078d4720763bf718e0f2cc6128884d527c1cd85"},"schema_version":"1.0"},"canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","source":{"kind":"arxiv","id":"1401.7931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7931","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7931v2","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7931","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"66A52ZCCNE3S","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66A52ZCCNE3SQXG3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66A52ZCC","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:66A52ZCCNE3SQXG3JPD3SC6Q2U","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"3e1686db1b31fc35915bc1335ab27cbc308749465a457ac6201951e903c58e1b","abstract_canon_sha256":"f8c7ef4f60a03ae8b3e770f2e078d4720763bf718e0f2cc6128884d527c1cd85"},"schema_version":"1.0"},"canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:30.945841Z","signature_b64":"4t+wGRBgLbppUnsSZ4DLL8Vc8XTjafF2jMUDWs/IDbzD3AwuUHgc+4iZE0CR9MkROc+oLYeBi5Zgfm86IGh2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","last_reissued_at":"2026-05-18T02:46:30.945277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:30.945277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7931","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-18T02:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otDZTMRjdDVQyvsiHQSE4Y1amif8SNxv9APsrustcrxVCXXn0Yn9Pq8t2Tg8F8wNLtNGw4xC1ijkyYn/3CvaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:34.933304Z"},"content_sha256":"e80e02a814b86666f1363083f2cdb74ac1aeb5e3933592bdfecff0cbe6f40718","schema_version":"1.0","event_id":"sha256:e80e02a814b86666f1363083f2cdb74ac1aeb5e3933592bdfecff0cbe6f40718"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:66A52ZCCNE3SQXG3JPD3SC6Q2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the Diameter of Path-Pairable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabor Meszaros","submitted_at":"2014-01-30T17:33:25Z","abstract_excerpt":"A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an infinite family of path-pairable graphs with diameter $d(G)=O(\\sqrt{n})$ where $n$ denotes the number of vertices of the graph. We prove that our example is extremal up to a constant factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7931","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-18T02:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rGzwCZcfuwL/OFW7bMw/2/vL2sSlxNLIsNTLIrPsEnOxeqgeWW5KdqGp6sG87JAy5iOXslhWzqdHtPgMK/6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:34.933657Z"},"content_sha256":"1b32c4e426aeeea8c4e74063d8eb35e18caa4f78c6817fbacc2be53d29db2817","schema_version":"1.0","event_id":"sha256:1b32c4e426aeeea8c4e74063d8eb35e18caa4f78c6817fbacc2be53d29db2817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/bundle.json","state_url":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/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-22T11:16:34Z","links":{"resolver":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U","bundle":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/bundle.json","state":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:66A52ZCCNE3SQXG3JPD3SC6Q2U","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":"f8c7ef4f60a03ae8b3e770f2e078d4720763bf718e0f2cc6128884d527c1cd85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:33:25Z","title_canon_sha256":"3e1686db1b31fc35915bc1335ab27cbc308749465a457ac6201951e903c58e1b"},"schema_version":"1.0","source":{"id":"1401.7931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7931","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7931v2","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7931","created_at":"2026-05-18T02:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"66A52ZCCNE3S","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"66A52ZCCNE3SQXG3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"66A52ZCC","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:1b32c4e426aeeea8c4e74063d8eb35e18caa4f78c6817fbacc2be53d29db2817","target":"graph","created_at":"2026-05-18T02:46:30Z","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":"A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an infinite family of path-pairable graphs with diameter $d(G)=O(\\sqrt{n})$ where $n$ denotes the number of vertices of the graph. We prove that our example is extremal up to a constant factor.","authors_text":"Gabor Meszaros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:33:25Z","title":"Note on the Diameter of Path-Pairable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7931","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:e80e02a814b86666f1363083f2cdb74ac1aeb5e3933592bdfecff0cbe6f40718","target":"record","created_at":"2026-05-18T02:46:30Z","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":"f8c7ef4f60a03ae8b3e770f2e078d4720763bf718e0f2cc6128884d527c1cd85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-30T17:33:25Z","title_canon_sha256":"3e1686db1b31fc35915bc1335ab27cbc308749465a457ac6201951e903c58e1b"},"schema_version":"1.0","source":{"id":"1401.7931","kind":"arxiv","version":2}},"canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","first_computed_at":"2026-05-18T02:46:30.945277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:30.945277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4t+wGRBgLbppUnsSZ4DLL8Vc8XTjafF2jMUDWs/IDbzD3AwuUHgc+4iZE0CR9MkROc+oLYeBi5Zgfm86IGh2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:30.945841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e80e02a814b86666f1363083f2cdb74ac1aeb5e3933592bdfecff0cbe6f40718","sha256:1b32c4e426aeeea8c4e74063d8eb35e18caa4f78c6817fbacc2be53d29db2817"],"state_sha256":"986753cd8aed021d0d0cf949c5c51003d3901945a5e9e984b5d411f4ace784d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bN9Cn+QFC4cvwXPFMQdLaLH4jNcFgF0l64xCdgNBhVzwjqh3b+NzZpzkrn3MxiDc/fYoUBWDeYHTAd11mSpEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:16:34.935498Z","bundle_sha256":"87e0fbedad2d64061f5508bfcde019a29ea992c20ca0b6d84414ef34d02b7081"}}