{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LCTR3BMZG6QNHI2FKYLHW2CXWV","short_pith_number":"pith:LCTR3BMZ","canonical_record":{"source":{"id":"1403.0178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-02T09:33:30Z","cross_cats_sorted":[],"title_canon_sha256":"43737635de5f56da1e2c05f86e344870567e7d6de3bdf80f0e6c669ac6cd3516","abstract_canon_sha256":"ba3ae6a5b1e55b68ee6cd4a964af2e3777dc4bf00e539e673bfa2b4abde2fea0"},"schema_version":"1.0"},"canonical_sha256":"58a71d859937a0d3a34556167b6857b574da7149242e7dac43fd934c4f472de1","source":{"kind":"arxiv","id":"1403.0178","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0178","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0178v3","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0178","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"LCTR3BMZG6QN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LCTR3BMZG6QNHI2F","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LCTR3BMZ","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LCTR3BMZG6QNHI2FKYLHW2CXWV","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-02T09:33:30Z","cross_cats_sorted":[],"title_canon_sha256":"43737635de5f56da1e2c05f86e344870567e7d6de3bdf80f0e6c669ac6cd3516","abstract_canon_sha256":"ba3ae6a5b1e55b68ee6cd4a964af2e3777dc4bf00e539e673bfa2b4abde2fea0"},"schema_version":"1.0"},"canonical_sha256":"58a71d859937a0d3a34556167b6857b574da7149242e7dac43fd934c4f472de1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:01.288567Z","signature_b64":"G+JcaTNHQmpqeFRsDblDxR0iQHl3RzlJcDtFo1Pb5l9ufyyoZ9+oMNTZrPZ06lUMFO69IhV/K8MILDeYJAYzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a71d859937a0d3a34556167b6857b574da7149242e7dac43fd934c4f472de1","last_reissued_at":"2026-05-18T02:33:01.288224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:01.288224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0178","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-18T02:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQTWa8sB7HFHQIbK3f6DDmzaDSyEOb2TCqXesE8qqYk6tTS4aBPbnFUYHz1S0vSN2KK7sjKTca0IQCkipRplDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:10:06.973778Z"},"content_sha256":"73d99637be75d6b4b58470f8ee1a90349aff2fc75dc666ae56fd28aa650c3742","schema_version":"1.0","event_id":"sha256:73d99637be75d6b4b58470f8ee1a90349aff2fc75dc666ae56fd28aa650c3742"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LCTR3BMZG6QNHI2FKYLHW2CXWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Additive Spanners: A Simple Construction","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":"2014-03-02T09:33:30Z","abstract_excerpt":"We consider additive spanners of unweighted undirected graphs. Let $G$ be a graph and $H$ a subgraph of $G$. The most na\\\"ive way to construct an additive $k$-spanner of $G$ is the following: As long as $H$ is not an additive $k$-spanner repeat: Find a pair $(u,v) \\in H$ that violates the spanner-condition and a shortest path from $u$ to $v$ in $G$. Add the edges of this path to $H$.\n  We show that, with a very simple initial graph $H$, this na\\\"ive method gives additive $6$- and $2$-spanners of sizes matching the best known upper bounds. For additive $2$-spanners we start with $H=\\emptyset$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0178","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-18T02:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjI3VH6ZHIysI4py9lWCt79vccXxUjLz+TQk3P0RjUWSyjX3/hnz4IEjqEkHAd1yNWfS0GsufRMOE8WWPkXiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:10:06.974198Z"},"content_sha256":"09478d337559b4152a72ff7f7f6a9fdf18a222db6093fd0c4c7c9bb47d1a22f1","schema_version":"1.0","event_id":"sha256:09478d337559b4152a72ff7f7f6a9fdf18a222db6093fd0c4c7c9bb47d1a22f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/bundle.json","state_url":"https://pith.science/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/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:10:06Z","links":{"resolver":"https://pith.science/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV","bundle":"https://pith.science/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/bundle.json","state":"https://pith.science/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCTR3BMZG6QNHI2FKYLHW2CXWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LCTR3BMZG6QNHI2FKYLHW2CXWV","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":"ba3ae6a5b1e55b68ee6cd4a964af2e3777dc4bf00e539e673bfa2b4abde2fea0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-02T09:33:30Z","title_canon_sha256":"43737635de5f56da1e2c05f86e344870567e7d6de3bdf80f0e6c669ac6cd3516"},"schema_version":"1.0","source":{"id":"1403.0178","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0178","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0178v3","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0178","created_at":"2026-05-18T02:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"LCTR3BMZG6QN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LCTR3BMZG6QNHI2F","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LCTR3BMZ","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:09478d337559b4152a72ff7f7f6a9fdf18a222db6093fd0c4c7c9bb47d1a22f1","target":"graph","created_at":"2026-05-18T02:33:01Z","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":"We consider additive spanners of unweighted undirected graphs. Let $G$ be a graph and $H$ a subgraph of $G$. The most na\\\"ive way to construct an additive $k$-spanner of $G$ is the following: As long as $H$ is not an additive $k$-spanner repeat: Find a pair $(u,v) \\in H$ that violates the spanner-condition and a shortest path from $u$ to $v$ in $G$. Add the edges of this path to $H$.\n  We show that, with a very simple initial graph $H$, this na\\\"ive method gives additive $6$- and $2$-spanners of sizes matching the best known upper bounds. For additive $2$-spanners we start with $H=\\emptyset$ a","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":"2014-03-02T09:33:30Z","title":"Additive Spanners: A Simple Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0178","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:73d99637be75d6b4b58470f8ee1a90349aff2fc75dc666ae56fd28aa650c3742","target":"record","created_at":"2026-05-18T02:33:01Z","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":"ba3ae6a5b1e55b68ee6cd4a964af2e3777dc4bf00e539e673bfa2b4abde2fea0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-02T09:33:30Z","title_canon_sha256":"43737635de5f56da1e2c05f86e344870567e7d6de3bdf80f0e6c669ac6cd3516"},"schema_version":"1.0","source":{"id":"1403.0178","kind":"arxiv","version":3}},"canonical_sha256":"58a71d859937a0d3a34556167b6857b574da7149242e7dac43fd934c4f472de1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a71d859937a0d3a34556167b6857b574da7149242e7dac43fd934c4f472de1","first_computed_at":"2026-05-18T02:33:01.288224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:01.288224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G+JcaTNHQmpqeFRsDblDxR0iQHl3RzlJcDtFo1Pb5l9ufyyoZ9+oMNTZrPZ06lUMFO69IhV/K8MILDeYJAYzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:01.288567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0178","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73d99637be75d6b4b58470f8ee1a90349aff2fc75dc666ae56fd28aa650c3742","sha256:09478d337559b4152a72ff7f7f6a9fdf18a222db6093fd0c4c7c9bb47d1a22f1"],"state_sha256":"6b7575b772dd42fe93ecaf184f6a946ef1b4b7747566c4cf74a6be39c9fc1455"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hBlZkpF6j9cfTtr9XB1d9slx0s3EWmXggXTRwKH9B59J6BPDp2OUrxR/XoTvk8vE7vObvBqtdPk4aXNChK3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:10:06.976117Z","bundle_sha256":"6dd0040bd465a2f7c9d34f7653082b0091df6cffce41ea49a058857c9da9e765"}}