{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SF6HTHSLPBSGDHVNLOMH7KEV5U","short_pith_number":"pith:SF6HTHSL","canonical_record":{"source":{"id":"1306.4919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-20T15:51:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98ed523131d4e05acb190930fc3796f209439fe11829045f73c89a0c1f1b6f7f","abstract_canon_sha256":"362da00326b34243df0731bf6e254b7b027e3f0165658fb6982400b35616e02e"},"schema_version":"1.0"},"canonical_sha256":"917c799e4b7864619ead5b987fa895ed36434135ed7f17b672f12a5792672cc6","source":{"kind":"arxiv","id":"1306.4919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4919","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4919v1","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4919","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"SF6HTHSLPBSG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SF6HTHSLPBSGDHVN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SF6HTHSL","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SF6HTHSLPBSGDHVNLOMH7KEV5U","target":"record","payload":{"canonical_record":{"source":{"id":"1306.4919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-20T15:51:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98ed523131d4e05acb190930fc3796f209439fe11829045f73c89a0c1f1b6f7f","abstract_canon_sha256":"362da00326b34243df0731bf6e254b7b027e3f0165658fb6982400b35616e02e"},"schema_version":"1.0"},"canonical_sha256":"917c799e4b7864619ead5b987fa895ed36434135ed7f17b672f12a5792672cc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:21.155618Z","signature_b64":"hE0W0qW0sNaot9lqnqFCtyEmbteGyHlOsvjHvp0IVdziwq1yiBYcaxT3f3K2eUtBLdCz/Dxd81pR3qvIEnE2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917c799e4b7864619ead5b987fa895ed36434135ed7f17b672f12a5792672cc6","last_reissued_at":"2026-05-18T03:20:21.154897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:21.154897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.4919","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-18T03:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jf6/Q9Jxnsoqp1JUiZNTis68whCKKo7YwBNY4DpJPcu9XcGPc346BvlGjZ8ZCSTC99bn3lgu25M5NuA5S/coAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:04:47.259391Z"},"content_sha256":"27bdf19d55a8aac9425f3d79a0aae593c2837e281cad51e23433f2726ef7cb60","schema_version":"1.0","event_id":"sha256:27bdf19d55a8aac9425f3d79a0aae593c2837e281cad51e23433f2726ef7cb60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SF6HTHSLPBSGDHVNLOMH7KEV5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Greedy Spanner in Linear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alex P. ten Brink, Kevin Buchin, Quirijn W. Bouts, Sander P. A. Alewijnse","submitted_at":"2013-06-20T15:51:45Z","abstract_excerpt":"The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all known algorithms that compute the greedy spanner of n points use Omega(n^2) space, which is impractical on large instances. To the best of our knowledge, the largest instance for which the greedy spanner was computed so far has about 13,000 vertices.\n  We present a O(n)-space algorithm that computes the same spanner for points in R^d running in O(n^2 log^2 n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4919","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-18T03:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xk4VENhGI5pckcp3VvCyRGbU17Lz1EnAiThuZPOHiKEBtiQ6Me99x3Ix/3YmfDqrdswK9sxvuIZyQO9xkZeZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:04:47.259747Z"},"content_sha256":"0a92687b22f7121816f96d7944ed513f59ecfbcc36703b20664b42418fddf95c","schema_version":"1.0","event_id":"sha256:0a92687b22f7121816f96d7944ed513f59ecfbcc36703b20664b42418fddf95c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/bundle.json","state_url":"https://pith.science/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/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-05-21T15:04:47Z","links":{"resolver":"https://pith.science/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U","bundle":"https://pith.science/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/bundle.json","state":"https://pith.science/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SF6HTHSLPBSGDHVNLOMH7KEV5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SF6HTHSLPBSGDHVNLOMH7KEV5U","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":"362da00326b34243df0731bf6e254b7b027e3f0165658fb6982400b35616e02e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-20T15:51:45Z","title_canon_sha256":"98ed523131d4e05acb190930fc3796f209439fe11829045f73c89a0c1f1b6f7f"},"schema_version":"1.0","source":{"id":"1306.4919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4919","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4919v1","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4919","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"SF6HTHSLPBSG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SF6HTHSLPBSGDHVN","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SF6HTHSL","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:0a92687b22f7121816f96d7944ed513f59ecfbcc36703b20664b42418fddf95c","target":"graph","created_at":"2026-05-18T03:20: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":"The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all known algorithms that compute the greedy spanner of n points use Omega(n^2) space, which is impractical on large instances. To the best of our knowledge, the largest instance for which the greedy spanner was computed so far has about 13,000 vertices.\n  We present a O(n)-space algorithm that computes the same spanner for points in R^d running in O(n^2 log^2 n)","authors_text":"Alex P. ten Brink, Kevin Buchin, Quirijn W. Bouts, Sander P. A. Alewijnse","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-20T15:51:45Z","title":"Computing the Greedy Spanner in Linear Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4919","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:27bdf19d55a8aac9425f3d79a0aae593c2837e281cad51e23433f2726ef7cb60","target":"record","created_at":"2026-05-18T03:20: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":"362da00326b34243df0731bf6e254b7b027e3f0165658fb6982400b35616e02e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-20T15:51:45Z","title_canon_sha256":"98ed523131d4e05acb190930fc3796f209439fe11829045f73c89a0c1f1b6f7f"},"schema_version":"1.0","source":{"id":"1306.4919","kind":"arxiv","version":1}},"canonical_sha256":"917c799e4b7864619ead5b987fa895ed36434135ed7f17b672f12a5792672cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917c799e4b7864619ead5b987fa895ed36434135ed7f17b672f12a5792672cc6","first_computed_at":"2026-05-18T03:20:21.154897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:21.154897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hE0W0qW0sNaot9lqnqFCtyEmbteGyHlOsvjHvp0IVdziwq1yiBYcaxT3f3K2eUtBLdCz/Dxd81pR3qvIEnE2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:21.155618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27bdf19d55a8aac9425f3d79a0aae593c2837e281cad51e23433f2726ef7cb60","sha256:0a92687b22f7121816f96d7944ed513f59ecfbcc36703b20664b42418fddf95c"],"state_sha256":"a06abda93811ff69dde8da95acd21e4908f7706c651003e3850a89b832dca63c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YH00zVXRCJSBoDBFZ9ik4/+tMrJHFgs7aKr6efZQLHtkdtSYMUaeVTDnZLF5vOK5gMNiYyOSe2zl70pMU1/vBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:04:47.262730Z","bundle_sha256":"172c65d67b9126dc9cf29f3c3719e9dc62d3aafe56a471f688db4fbf6743ab29"}}