{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H6FWVHDAJKGWWZMFMLOTII6VFX","short_pith_number":"pith:H6FWVHDA","canonical_record":{"source":{"id":"1704.04473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e4908e948c5a7be9d9b260311155c63f8bbfce001d95a77e82da4646dd05536","abstract_canon_sha256":"676c51dfe515f1ee49a09b2d55dc9bb3da3189231f058bcb011adbeb6b0f68a0"},"schema_version":"1.0"},"canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","source":{"kind":"arxiv","id":"1704.04473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04473","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04473v1","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04473","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"H6FWVHDAJKGW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H6FWVHDAJKGWWZMF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H6FWVHDA","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H6FWVHDAJKGWWZMFMLOTII6VFX","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e4908e948c5a7be9d9b260311155c63f8bbfce001d95a77e82da4646dd05536","abstract_canon_sha256":"676c51dfe515f1ee49a09b2d55dc9bb3da3189231f058bcb011adbeb6b0f68a0"},"schema_version":"1.0"},"canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.610630Z","signature_b64":"LRcew1ihVCiQT9swGkr0SkdZAYH5NxWlk8T4DTccWvuMq7FE4Fk5fZSah/wFrYvsvZfAs1rT/+emuY6L8UlyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","last_reissued_at":"2026-05-18T00:46:21.610204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.610204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04473","source_version":1,"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmtAM7ca8zFhr5/QDF5fPBTKC7q+qKHZomHjjAld6HrTZko4KXdAXPA8DvcGAKG8ReYrMn/DMszRd/n/a3NnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:04:34.458706Z"},"content_sha256":"53f715957773f74d74190dd53a9de2220bcf4c192db7862db756546612ce781b","schema_version":"1.0","event_id":"sha256:53f715957773f74d74190dd53a9de2220bcf4c192db7862db756546612ce781b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H6FWVHDAJKGWWZMFMLOTII6VFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Additive Spanners and Distance Oracles in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen","submitted_at":"2017-04-14T16:36:22Z","abstract_excerpt":"Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \\le d_G(u,v)+k$ for all nodes $u,v$, where $d$ is the shortest path distance. We give a deterministic algorithm that constructs an additive $O\\!\\left(1\\right)$-spanner with $O\\!\\left(n^{4/3}\\right)$ edges in $O\\!\\left(n^2\\right)$ time. This should be compared with the randomized Monte Carlo algorithm by Woodruff [ICALP 2010] giving an additive $6$-spanner with $O\\!\\left(n^{4/3}\\log^3 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04473","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"},"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKFit+b+2jjn5iZNugR/WcUxjJyBTqbaGvEB2c/991nTksf2AlRi9Df0l+q4fPApzpljq1hUIrFOYD6zk4hPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:04:34.459088Z"},"content_sha256":"39665d873d783f3d89e9afe3a503728e1abde87a90ecb647cd2414510c9f1e8b","schema_version":"1.0","event_id":"sha256:39665d873d783f3d89e9afe3a503728e1abde87a90ecb647cd2414510c9f1e8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/bundle.json","state_url":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/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-27T02:04:34Z","links":{"resolver":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX","bundle":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/bundle.json","state":"https://pith.science/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6FWVHDAJKGWWZMFMLOTII6VFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H6FWVHDAJKGWWZMFMLOTII6VFX","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":"676c51dfe515f1ee49a09b2d55dc9bb3da3189231f058bcb011adbeb6b0f68a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","title_canon_sha256":"8e4908e948c5a7be9d9b260311155c63f8bbfce001d95a77e82da4646dd05536"},"schema_version":"1.0","source":{"id":"1704.04473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04473","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04473v1","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04473","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"H6FWVHDAJKGW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H6FWVHDAJKGWWZMF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H6FWVHDA","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:39665d873d783f3d89e9afe3a503728e1abde87a90ecb647cd2414510c9f1e8b","target":"graph","created_at":"2026-05-18T00:46:21Z","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":"Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \\le d_G(u,v)+k$ for all nodes $u,v$, where $d$ is the shortest path distance. We give a deterministic algorithm that constructs an additive $O\\!\\left(1\\right)$-spanner with $O\\!\\left(n^{4/3}\\right)$ edges in $O\\!\\left(n^2\\right)$ time. This should be compared with the randomized Monte Carlo algorithm by Woodruff [ICALP 2010] giving an additive $6$-spanner with $O\\!\\left(n^{4/3}\\log^3 ","authors_text":"Mathias B{\\ae}k Tejs Knudsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","title":"Additive Spanners and Distance Oracles in Quadratic Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04473","kind":"arxiv","version":1},"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:53f715957773f74d74190dd53a9de2220bcf4c192db7862db756546612ce781b","target":"record","created_at":"2026-05-18T00:46:21Z","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":"676c51dfe515f1ee49a09b2d55dc9bb3da3189231f058bcb011adbeb6b0f68a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T16:36:22Z","title_canon_sha256":"8e4908e948c5a7be9d9b260311155c63f8bbfce001d95a77e82da4646dd05536"},"schema_version":"1.0","source":{"id":"1704.04473","kind":"arxiv","version":1}},"canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f8b6a9c604a8d6b658562dd3423d52dee5ddc9c2febfefe0173ba6c9cd47c51","first_computed_at":"2026-05-18T00:46:21.610204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:21.610204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LRcew1ihVCiQT9swGkr0SkdZAYH5NxWlk8T4DTccWvuMq7FE4Fk5fZSah/wFrYvsvZfAs1rT/+emuY6L8UlyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:21.610630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f715957773f74d74190dd53a9de2220bcf4c192db7862db756546612ce781b","sha256:39665d873d783f3d89e9afe3a503728e1abde87a90ecb647cd2414510c9f1e8b"],"state_sha256":"1cda34ed2d470ecde2c065ff03b7384e1b3c28ee8cbe1a998159a9059efb0aff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hx7VpAUN5myX5O6ivBoA3LL6Zx7j/V8i/kjK0VhqeylXGboI9wiM+Q3BdGLkNXwy22RF9sv09Hj4hHYlyS9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:04:34.460894Z","bundle_sha256":"ba85370a2a6fc8027c0f5562b90bd697a2ec6a331a407c885d8dfd6648cf5814"}}