{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WKNQIUO5JFRCJDD2SFEFKQSF5N","short_pith_number":"pith:WKNQIUO5","canonical_record":{"source":{"id":"1401.1085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-06T14:04:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"61cd210f05e6aa00de2159136533ab8c0ce455b58e7cd035b1270d8b14e09186","abstract_canon_sha256":"c10f7d2034fe3a3406a2c0a85b311edfec382f7085cec33d582fd84fd919a9ba"},"schema_version":"1.0"},"canonical_sha256":"b29b0451dd4962248c7a9148554245eb616c44ed0d806616b701b2bedd5ab6f1","source":{"kind":"arxiv","id":"1401.1085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1085","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1085v2","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1085","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"WKNQIUO5JFRC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WKNQIUO5JFRCJDD2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WKNQIUO5","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WKNQIUO5JFRCJDD2SFEFKQSF5N","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-06T14:04:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"61cd210f05e6aa00de2159136533ab8c0ce455b58e7cd035b1270d8b14e09186","abstract_canon_sha256":"c10f7d2034fe3a3406a2c0a85b311edfec382f7085cec33d582fd84fd919a9ba"},"schema_version":"1.0"},"canonical_sha256":"b29b0451dd4962248c7a9148554245eb616c44ed0d806616b701b2bedd5ab6f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:46.459395Z","signature_b64":"RFXmZobVbiRETYgYV0wjEMWkbo1Ez+HjhPhtlANYx7DTWAL44LwpaKXoiBxM83tEIrAymnpie9cpDIo5XMH7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29b0451dd4962248c7a9148554245eb616c44ed0d806616b701b2bedd5ab6f1","last_reissued_at":"2026-05-18T02:48:46.458862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:46.458862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1085","source_version":2,"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:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhSB/7jgddM1+tk9IoMsdZEXvXEFyqWJWhUJeAsVqZmvnd1VoPzswvzir0Du0S9l43LrTQ7oMhcerXjFUoRuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:59:58.184159Z"},"content_sha256":"bc20f5ae58e6018e11353379fc983708544bd6f93714118abde1e5bb7457d136","schema_version":"1.0","event_id":"sha256:bc20f5ae58e6018e11353379fc983708544bd6f93714118abde1e5bb7457d136"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WKNQIUO5JFRCJDD2SFEFKQSF5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distribution-Sensitive Construction of the Greedy Spanner","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":"2014-01-06T14:04:05Z","abstract_excerpt":"The greedy spanner is the highest quality geometric spanner (in e.g. edge count and weight, both in theory and practice) known to be computable in polynomial time. Unfortunately, all known algorithms for computing it take Omega(n^2) time, limiting its applicability on large data sets.\n  We observe that for many point sets, the greedy spanner has many `short' edges that can be determined locally and usually quickly, and few or no `long' edges that can usually be determined quickly using local information and the well-separated pair decomposition. We give experimental results showing large to ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1085","kind":"arxiv","version":2},"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:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9/UT62kO0jySP0lLB4n+PcFc5WJm2psTSP2soz8gpVYmwgPNeAzgHPnvbEn2RjoA5YppNK7bCZWXILm57+PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:59:58.184523Z"},"content_sha256":"65eced2130e4d8b1614da2b296cf8ff085ef9c6d71a7c3f7e9a30a100cc22357","schema_version":"1.0","event_id":"sha256:65eced2130e4d8b1614da2b296cf8ff085ef9c6d71a7c3f7e9a30a100cc22357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/bundle.json","state_url":"https://pith.science/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/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-10T21:59:58Z","links":{"resolver":"https://pith.science/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N","bundle":"https://pith.science/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/bundle.json","state":"https://pith.science/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKNQIUO5JFRCJDD2SFEFKQSF5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WKNQIUO5JFRCJDD2SFEFKQSF5N","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":"c10f7d2034fe3a3406a2c0a85b311edfec382f7085cec33d582fd84fd919a9ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-06T14:04:05Z","title_canon_sha256":"61cd210f05e6aa00de2159136533ab8c0ce455b58e7cd035b1270d8b14e09186"},"schema_version":"1.0","source":{"id":"1401.1085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1085","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1085v2","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1085","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"WKNQIUO5JFRC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WKNQIUO5JFRCJDD2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WKNQIUO5","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:65eced2130e4d8b1614da2b296cf8ff085ef9c6d71a7c3f7e9a30a100cc22357","target":"graph","created_at":"2026-05-18T02:48:46Z","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 the highest quality geometric spanner (in e.g. edge count and weight, both in theory and practice) known to be computable in polynomial time. Unfortunately, all known algorithms for computing it take Omega(n^2) time, limiting its applicability on large data sets.\n  We observe that for many point sets, the greedy spanner has many `short' edges that can be determined locally and usually quickly, and few or no `long' edges that can usually be determined quickly using local information and the well-separated pair decomposition. We give experimental results showing large to ma","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":"2014-01-06T14:04:05Z","title":"Distribution-Sensitive Construction of the Greedy Spanner"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1085","kind":"arxiv","version":2},"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:bc20f5ae58e6018e11353379fc983708544bd6f93714118abde1e5bb7457d136","target":"record","created_at":"2026-05-18T02:48:46Z","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":"c10f7d2034fe3a3406a2c0a85b311edfec382f7085cec33d582fd84fd919a9ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-06T14:04:05Z","title_canon_sha256":"61cd210f05e6aa00de2159136533ab8c0ce455b58e7cd035b1270d8b14e09186"},"schema_version":"1.0","source":{"id":"1401.1085","kind":"arxiv","version":2}},"canonical_sha256":"b29b0451dd4962248c7a9148554245eb616c44ed0d806616b701b2bedd5ab6f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b29b0451dd4962248c7a9148554245eb616c44ed0d806616b701b2bedd5ab6f1","first_computed_at":"2026-05-18T02:48:46.458862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:46.458862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RFXmZobVbiRETYgYV0wjEMWkbo1Ez+HjhPhtlANYx7DTWAL44LwpaKXoiBxM83tEIrAymnpie9cpDIo5XMH7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:46.459395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc20f5ae58e6018e11353379fc983708544bd6f93714118abde1e5bb7457d136","sha256:65eced2130e4d8b1614da2b296cf8ff085ef9c6d71a7c3f7e9a30a100cc22357"],"state_sha256":"d1c60f49ec7ec69622ffca2349b3023f829e7523da851ce7c7da98f3559cec9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcDw4/gcW1pgHdBRfzNmq0qMg24Eieep9rgmh3/744kFm71onv/mJRwqWamIQKRdvo7FrP3Co7E3T+yOdEftAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:59:58.186509Z","bundle_sha256":"3fce00fa9547e40636ef82dc16b777197b2d92b907967364c9804d45dafb9646"}}