{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:66A52ZCCNE3SQXG3JPD3SC6Q2U","short_pith_number":"pith:66A52ZCC","schema_version":"1.0","canonical_sha256":"f781dd64426937285cdb4bc7b90bd0d53e9848d0af89c52ca11cc4d83784f1ea","source":{"kind":"arxiv","id":"1401.7931","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7931","created_at":"2026-05-18T02:46:30.945364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7931v2","created_at":"2026-05-18T02:46:30.945364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7931","created_at":"2026-05-18T02:46:30.945364+00:00"},{"alias_kind":"pith_short_12","alias_value":"66A52ZCCNE3S","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"66A52ZCCNE3SQXG3","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"66A52ZCC","created_at":"2026-05-18T12:28:16.859392+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/66A52ZCCNE3SQXG3JPD3SC6Q2U","json":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U.json","graph_json":"https://pith.science/api/pith-number/66A52ZCCNE3SQXG3JPD3SC6Q2U/graph.json","events_json":"https://pith.science/api/pith-number/66A52ZCCNE3SQXG3JPD3SC6Q2U/events.json","paper":"https://pith.science/paper/66A52ZCC"},"agent_actions":{"view_html":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U","download_json":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U.json","view_paper":"https://pith.science/paper/66A52ZCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7931&json=true","fetch_graph":"https://pith.science/api/pith-number/66A52ZCCNE3SQXG3JPD3SC6Q2U/graph.json","fetch_events":"https://pith.science/api/pith-number/66A52ZCCNE3SQXG3JPD3SC6Q2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/action/storage_attestation","attest_author":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/action/author_attestation","sign_citation":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/action/citation_signature","submit_replication":"https://pith.science/pith/66A52ZCCNE3SQXG3JPD3SC6Q2U/action/replication_record"}},"created_at":"2026-05-18T02:46:30.945364+00:00","updated_at":"2026-05-18T02:46:30.945364+00:00"}