{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5Q5DD7W464BUA5PEUSJZNVB2VS","short_pith_number":"pith:5Q5DD7W4","schema_version":"1.0","canonical_sha256":"ec3a31fedcf7034075e4a49396d43aaca95e03ecb12c6625fca813264c0c7f19","source":{"kind":"arxiv","id":"1301.1999","version":1},"attestation_state":"computed","paper":{"title":"On Pairwise Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Marek Cygan, Telikepalli Kavitha","submitted_at":"2013-01-09T22:30:04Z","abstract_excerpt":"Given an undirected $n$-node unweighted graph $G = (V, E)$, a spanner with stretch function $f(\\cdot)$ is a subgraph $H\\subseteq G$ such that, if two nodes are at distance $d$ in $G$, then they are at distance at most $f(d)$ in $H$. Spanners are very well studied in the literature. The typical goal is to construct the sparsest possible spanner for a given stretch function.\n  In this paper we study pairwise spanners, where we require to approximate the $u$-$v$ distance only for pairs $(u,v)$ in a given set $\\cP \\subseteq V\\times V$. Such $\\cP$-spanners were studied before [Coppersmith,Elkin'05]"},"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":"1301.1999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-09T22:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"0c4a86c752fb59cd4c40282ef38d3c97fe13db00e0ca578e4f47a465ed4b1161","abstract_canon_sha256":"2320b463855aa0ed12ce200e993cb908a2b00bb8c1684c5780f2ff6b0d328f00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:48.558146Z","signature_b64":"u66fLmGussCHcd1+LJmdsLNugdtHucuBzSAYEEKhopTwTi2TsxkK2dH7cb6fa+aambHKsCloVKRL9ozwQr14AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec3a31fedcf7034075e4a49396d43aaca95e03ecb12c6625fca813264c0c7f19","last_reissued_at":"2026-05-18T03:36:48.557716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:48.557716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Pairwise Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Marek Cygan, Telikepalli Kavitha","submitted_at":"2013-01-09T22:30:04Z","abstract_excerpt":"Given an undirected $n$-node unweighted graph $G = (V, E)$, a spanner with stretch function $f(\\cdot)$ is a subgraph $H\\subseteq G$ such that, if two nodes are at distance $d$ in $G$, then they are at distance at most $f(d)$ in $H$. Spanners are very well studied in the literature. The typical goal is to construct the sparsest possible spanner for a given stretch function.\n  In this paper we study pairwise spanners, where we require to approximate the $u$-$v$ distance only for pairs $(u,v)$ in a given set $\\cP \\subseteq V\\times V$. Such $\\cP$-spanners were studied before [Coppersmith,Elkin'05]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1999","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":"1301.1999","created_at":"2026-05-18T03:36:48.557775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1999v1","created_at":"2026-05-18T03:36:48.557775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1999","created_at":"2026-05-18T03:36:48.557775+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q5DD7W464BU","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q5DD7W464BUA5PE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q5DD7W4","created_at":"2026-05-18T12:27:34.582898+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/5Q5DD7W464BUA5PEUSJZNVB2VS","json":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS.json","graph_json":"https://pith.science/api/pith-number/5Q5DD7W464BUA5PEUSJZNVB2VS/graph.json","events_json":"https://pith.science/api/pith-number/5Q5DD7W464BUA5PEUSJZNVB2VS/events.json","paper":"https://pith.science/paper/5Q5DD7W4"},"agent_actions":{"view_html":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS","download_json":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS.json","view_paper":"https://pith.science/paper/5Q5DD7W4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1999&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q5DD7W464BUA5PEUSJZNVB2VS/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q5DD7W464BUA5PEUSJZNVB2VS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS/action/storage_attestation","attest_author":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS/action/author_attestation","sign_citation":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS/action/citation_signature","submit_replication":"https://pith.science/pith/5Q5DD7W464BUA5PEUSJZNVB2VS/action/replication_record"}},"created_at":"2026-05-18T03:36:48.557775+00:00","updated_at":"2026-05-18T03:36:48.557775+00:00"}