{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IE2Z4QH32WA5KNUMG2REVIKXSP","short_pith_number":"pith:IE2Z4QH3","canonical_record":{"source":{"id":"1902.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T21:03:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1a6e17be9ae7bb5b656b99e966dbfb8a3721c60331d9c60dbdceb68cbcd81a34","abstract_canon_sha256":"75cb9e2d03b1ec56689529761d51c50c6c3478c995865ea7dea755a329700052"},"schema_version":"1.0"},"canonical_sha256":"41359e40fbd581d5368c36a24aa15793dd5b1bef54a27b5c8ebc023fd7737cd1","source":{"kind":"arxiv","id":"1902.08266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08266","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08266v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08266","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"IE2Z4QH32WA5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IE2Z4QH32WA5KNUM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IE2Z4QH3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IE2Z4QH32WA5KNUMG2REVIKXSP","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T21:03:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1a6e17be9ae7bb5b656b99e966dbfb8a3721c60331d9c60dbdceb68cbcd81a34","abstract_canon_sha256":"75cb9e2d03b1ec56689529761d51c50c6c3478c995865ea7dea755a329700052"},"schema_version":"1.0"},"canonical_sha256":"41359e40fbd581d5368c36a24aa15793dd5b1bef54a27b5c8ebc023fd7737cd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.807911Z","signature_b64":"19G0GRfTN5e0iPGqqF+ofnXmeogniP4NTjokFmpcxp9OMny7Sayja7OaJwGySo+uBUefuN5kzWrigiElM+nsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41359e40fbd581d5368c36a24aa15793dd5b1bef54a27b5c8ebc023fd7737cd1","last_reissued_at":"2026-05-17T23:52:57.807287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.807287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08266","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-17T23:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hu3EeX8Bh/dScxbCR1L+Rb2VKn+3trLAr16fuwhT/3zOITXutwpndx/9lLHIwOcy7pZ8yj9Ip6sE2QQn81q5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:05.012469Z"},"content_sha256":"adee92406c83e717c2700d5717ca183b506b040a2068f36c8281e4c9e641e985","schema_version":"1.0","event_id":"sha256:adee92406c83e717c2700d5717ca183b506b040a2068f36c8281e4c9e641e985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IE2Z4QH32WA5KNUMG2REVIKXSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Computation Algorithms for Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Anak Yodpinyanee, Merav Parter, Ronitt Rubinfeld","submitted_at":"2019-02-21T21:03:22Z","abstract_excerpt":"A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known existential size-stretch trade-off efficiently.\n  Classical models and algorithmic analysis of graph spanners essentially assume that the algorithm can read the input graph, construct the desired spanner, and write the answer to the output tape. However, when considering massive graphs containing millions or even billions of nodes not only the input graph, but a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08266","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-17T23:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mK355ZvxNWYsZ9SB6xSWnYQp+/1WScyTl93zLDzAip6Hz82OC21X7zwZfkuq3zeFU/mj5jMWZbSwkbaa9v8EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:05.013140Z"},"content_sha256":"b331dff35962704f61b8c21e5a5f03a790dc0619999cb49f3a9b67b9fc68f41b","schema_version":"1.0","event_id":"sha256:b331dff35962704f61b8c21e5a5f03a790dc0619999cb49f3a9b67b9fc68f41b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/bundle.json","state_url":"https://pith.science/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/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-27T22:12:05Z","links":{"resolver":"https://pith.science/pith/IE2Z4QH32WA5KNUMG2REVIKXSP","bundle":"https://pith.science/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/bundle.json","state":"https://pith.science/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IE2Z4QH32WA5KNUMG2REVIKXSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IE2Z4QH32WA5KNUMG2REVIKXSP","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":"75cb9e2d03b1ec56689529761d51c50c6c3478c995865ea7dea755a329700052","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T21:03:22Z","title_canon_sha256":"1a6e17be9ae7bb5b656b99e966dbfb8a3721c60331d9c60dbdceb68cbcd81a34"},"schema_version":"1.0","source":{"id":"1902.08266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08266","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08266v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08266","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"IE2Z4QH32WA5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IE2Z4QH32WA5KNUM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IE2Z4QH3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:b331dff35962704f61b8c21e5a5f03a790dc0619999cb49f3a9b67b9fc68f41b","target":"graph","created_at":"2026-05-17T23:52:57Z","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":"A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known existential size-stretch trade-off efficiently.\n  Classical models and algorithmic analysis of graph spanners essentially assume that the algorithm can read the input graph, construct the desired spanner, and write the answer to the output tape. However, when considering massive graphs containing millions or even billions of nodes not only the input graph, but a","authors_text":"Ali Vakilian, Anak Yodpinyanee, Merav Parter, Ronitt Rubinfeld","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T21:03:22Z","title":"Local Computation Algorithms for Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08266","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:adee92406c83e717c2700d5717ca183b506b040a2068f36c8281e4c9e641e985","target":"record","created_at":"2026-05-17T23:52:57Z","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":"75cb9e2d03b1ec56689529761d51c50c6c3478c995865ea7dea755a329700052","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T21:03:22Z","title_canon_sha256":"1a6e17be9ae7bb5b656b99e966dbfb8a3721c60331d9c60dbdceb68cbcd81a34"},"schema_version":"1.0","source":{"id":"1902.08266","kind":"arxiv","version":1}},"canonical_sha256":"41359e40fbd581d5368c36a24aa15793dd5b1bef54a27b5c8ebc023fd7737cd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41359e40fbd581d5368c36a24aa15793dd5b1bef54a27b5c8ebc023fd7737cd1","first_computed_at":"2026-05-17T23:52:57.807287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:57.807287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"19G0GRfTN5e0iPGqqF+ofnXmeogniP4NTjokFmpcxp9OMny7Sayja7OaJwGySo+uBUefuN5kzWrigiElM+nsBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:57.807911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adee92406c83e717c2700d5717ca183b506b040a2068f36c8281e4c9e641e985","sha256:b331dff35962704f61b8c21e5a5f03a790dc0619999cb49f3a9b67b9fc68f41b"],"state_sha256":"3a821397f04a9eaac2fa38931b81cab73d488c248de4c30bcc424955b3018e68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuZwwY6aHmb1wwt58d0octVECFlfudLAAxs89CkAKDx1L/sO0fTkeo6kxvSKDFpL1Mw/n82MkWoYU/CSt5VWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:12:05.016525Z","bundle_sha256":"d04d3b400d3c411944b3053640cbcc3979cca81f07ec9bca604066728cb2b31b"}}