{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LZQGBXS6NL5JA3X2OMIRJVVQ7E","short_pith_number":"pith:LZQGBXS6","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"},"canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","source":{"kind":"arxiv","id":"1607.07497","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07497","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07497v3","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07497","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"LZQGBXS6NL5J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZQGBXS6NL5JA3X2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZQGBXS6","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LZQGBXS6NL5JA3X2OMIRJVVQ7E","target":"record","payload":{"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"},"canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","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"},"source_kind":"arxiv","source_id":"1607.07497","source_version":3,"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:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3lEVEhJMiZsb4MPHIbComGHtGTv7UtzTDqY+ynVE0zHJQWcL8CH0HlzWVopqBTygJQ92CiGzUo7xu+joxz1/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:32:09.391937Z"},"content_sha256":"41241f69bd00c819cc14a4d979a874a10b73d6656aa77db6688113d0c1416b80","schema_version":"1.0","event_id":"sha256:41241f69bd00c819cc14a4d979a874a10b73d6656aa77db6688113d0c1416b80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LZQGBXS6NL5JA3X2OMIRJVVQ7E","target":"graph","payload":{"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"},"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:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBQfOMAZJE0e7VRPlcGix5ZyHQocwqJ/pElG+MSUgaYQIAX+v5A6DjIB91QjwTMeuczBBgd5xkCIpwYGhuDLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:32:09.392289Z"},"content_sha256":"32a08cfff049dc8456a562b4b0d9d6634f8423256bee4b38ba5e8509599bce80","schema_version":"1.0","event_id":"sha256:32a08cfff049dc8456a562b4b0d9d6634f8423256bee4b38ba5e8509599bce80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/bundle.json","state_url":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/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-24T01:32:09Z","links":{"resolver":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E","bundle":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/bundle.json","state":"https://pith.science/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZQGBXS6NL5JA3X2OMIRJVVQ7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LZQGBXS6NL5JA3X2OMIRJVVQ7E","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":"e377660148d91cb324e73097a928e743d86c6f15a2700f797224d588ed37f787","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-25T22:05:27Z","title_canon_sha256":"832953af6a7da72fcccdf8ac4cb7c6f335b96fceb72f90e847d9c95fb8d00c11"},"schema_version":"1.0","source":{"id":"1607.07497","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07497","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07497v3","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07497","created_at":"2026-05-18T00:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"LZQGBXS6NL5J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZQGBXS6NL5JA3X2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZQGBXS6","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:32a08cfff049dc8456a562b4b0d9d6634f8423256bee4b38ba5e8509599bce80","target":"graph","created_at":"2026-05-18T00:53:07Z","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":"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 ","authors_text":"Amir Abboud, Greg Bodwin, Seth Pettie","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-25T22:05:27Z","title":"A Hierarchy of Lower Bounds for Sublinear Additive Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07497","kind":"arxiv","version":3},"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:41241f69bd00c819cc14a4d979a874a10b73d6656aa77db6688113d0c1416b80","target":"record","created_at":"2026-05-18T00:53:07Z","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":"e377660148d91cb324e73097a928e743d86c6f15a2700f797224d588ed37f787","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-25T22:05:27Z","title_canon_sha256":"832953af6a7da72fcccdf8ac4cb7c6f335b96fceb72f90e847d9c95fb8d00c11"},"schema_version":"1.0","source":{"id":"1607.07497","kind":"arxiv","version":3}},"canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6060de5e6afa906efa731114d6b0f91d5e944f0322a4c2b497edb29b57924f","first_computed_at":"2026-05-18T00:53:07.861464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:07.861464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XksCTaYm0SIivTp3OLGVBAbYYA7wNezILxhn+73xcBflCAo5Uc6phyLmW3Cx4MP6/MRuyVJYAbvtSLbLZgWiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:07.861821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07497","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41241f69bd00c819cc14a4d979a874a10b73d6656aa77db6688113d0c1416b80","sha256:32a08cfff049dc8456a562b4b0d9d6634f8423256bee4b38ba5e8509599bce80"],"state_sha256":"c6cafaa3790a6a70464dedfbb721d0f5fee70623d634be8d58d2b77b22b73f3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZbz/uMdNHpPSdFlwEmiaS+8a/sdkkPp2uo5GNZFyxfPaIdkajxs5bc6igp6skaWIezatf1rdrlub00tAxFlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:32:09.394200Z","bundle_sha256":"3b0165c4b47f62ab7d2e906568039fd15090d0c3ffcff157042f7549ab96b6d4"}}