{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LZQGBXS6NL5JA3X2OMIRJVVQ7E","short_pith_number":"pith:LZQGBXS6","schema_version":"1.0","canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","source":{"kind":"arxiv","id":"1607.07497","version":3},"attestation_state":"computed","paper":{"title":"A Hierarchy of Lower Bounds for Sublinear Additive Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Greg Bodwin, Seth Pettie","submitted_at":"2016-07-25T22:05:27Z","abstract_excerpt":"Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\\tilde{O}(n^{1+\\delta})$ bits. There is an inherent tradeoff between the sparsity parameter $\\delta$ and the stretch function $f$ of the compression scheme, but the qualitative nature of this tradeoff has remained a persistent open problem.\n  In this paper we show that the recent additive spanner lower bound of Abboud and Bodwin is just the first step in a hierarchy of lower bounds that fully characterize the asymptotic behavior of the "},"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.07497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-25T22:05:27Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"832953af6a7da72fcccdf8ac4cb7c6f335b96fceb72f90e847d9c95fb8d00c11","abstract_canon_sha256":"e377660148d91cb324e73097a928e743d86c6f15a2700f797224d588ed37f787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:07.861821Z","signature_b64":"XksCTaYm0SIivTp3OLGVBAbYYA7wNezILxhn+73xcBflCAo5Uc6phyLmW3Cx4MP6/MRuyVJYAbvtSLbLZgWiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","last_reissued_at":"2026-05-18T00:53:07.861464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:07.861464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hierarchy of Lower Bounds for Sublinear Additive Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Greg Bodwin, Seth Pettie","submitted_at":"2016-07-25T22:05:27Z","abstract_excerpt":"Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\\tilde{O}(n^{1+\\delta})$ bits. There is an inherent tradeoff between the sparsity parameter $\\delta$ and the stretch function $f$ of the compression scheme, but the qualitative nature of this tradeoff has remained a persistent open problem.\n  In this paper we show that the recent additive spanner lower bound of Abboud and Bodwin is just the first step in a hierarchy of lower bounds that fully characterize the asymptotic behavior of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07497","kind":"arxiv","version":3},"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.07497","created_at":"2026-05-18T00:53:07.861522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07497v3","created_at":"2026-05-18T00:53:07.861522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07497","created_at":"2026-05-18T00:53:07.861522+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZQGBXS6NL5J","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZQGBXS6NL5JA3X2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZQGBXS6","created_at":"2026-05-18T12:30:29.479603+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/LZQGBXS6NL5JA3X2OMIRJVVQ7E","json":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E.json","graph_json":"https://pith.science/api/pith-number/LZQGBXS6NL5JA3X2OMIRJVVQ7E/graph.json","events_json":"https://pith.science/api/pith-number/LZQGBXS6NL5JA3X2OMIRJVVQ7E/events.json","paper":"https://pith.science/paper/LZQGBXS6"},"agent_actions":{"view_html":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E","download_json":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E.json","view_paper":"https://pith.science/paper/LZQGBXS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07497&json=true","fetch_graph":"https://pith.science/api/pith-number/LZQGBXS6NL5JA3X2OMIRJVVQ7E/graph.json","fetch_events":"https://pith.science/api/pith-number/LZQGBXS6NL5JA3X2OMIRJVVQ7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/action/storage_attestation","attest_author":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/action/author_attestation","sign_citation":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/action/citation_signature","submit_replication":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/action/replication_record"}},"created_at":"2026-05-18T00:53:07.861522+00:00","updated_at":"2026-05-18T00:53:07.861522+00:00"}