{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ABKRCKWCEWHJ6V2LMRSEEUT7Q7","short_pith_number":"pith:ABKRCKWC","canonical_record":{"source":{"id":"1401.0042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-30T22:34:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b3403d60f98c91addc834fb8aa8d174dc09b50bb9ee188ca9e9c33aea649b246","abstract_canon_sha256":"c772ad07c71e3bb4a6606d1503c84c3198a19f1f7249f6e15165822386154beb"},"schema_version":"1.0"},"canonical_sha256":"0055112ac2258e9f574b646442527f87d6247f11a125bcba9dd40c4e7b060d16","source":{"kind":"arxiv","id":"1401.0042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0042","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0042v2","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0042","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"ABKRCKWCEWHJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABKRCKWCEWHJ6V2L","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABKRCKWC","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ABKRCKWCEWHJ6V2LMRSEEUT7Q7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-30T22:34:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b3403d60f98c91addc834fb8aa8d174dc09b50bb9ee188ca9e9c33aea649b246","abstract_canon_sha256":"c772ad07c71e3bb4a6606d1503c84c3198a19f1f7249f6e15165822386154beb"},"schema_version":"1.0"},"canonical_sha256":"0055112ac2258e9f574b646442527f87d6247f11a125bcba9dd40c4e7b060d16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:12.197451Z","signature_b64":"+T1wMmet7qtSXu0Js+Qk4bngfZHB+agLtpgkElg6jwY96Fy1azZtN5fAR4ybHUAvrOfN7Gvv9sEAtrg4WZ9PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0055112ac2258e9f574b646442527f87d6247f11a125bcba9dd40c4e7b060d16","last_reissued_at":"2026-05-18T03:03:12.196696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:12.196696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0042","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-18T03:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSgIvwcasgCasVD5Tg5VkHS/SOvTuHzO2h6XUpGhgyMoUGMFcZUkynHuVyG4PBA87Z/7mv5NqGom+gkdIABYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:13.386355Z"},"content_sha256":"e63139ad279a7a19119536031c888e30d0ab7889723268655e65859d6b038177","schema_version":"1.0","event_id":"sha256:e63139ad279a7a19119536031c888e30d0ab7889723268655e65859d6b038177"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ABKRCKWCEWHJ6V2LMRSEEUT7Q7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Algorithms for Geometric Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov, Alexandr Andoni, Grigory Yaroslavtsev, Krzysztof Onak","submitted_at":"2013-12-30T22:34:56Z","abstract_excerpt":"We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional space, our algorithm computes a $(1+\\epsilon)$-approximate MST. Our algorithms work in a constant number of rounds of communication, while using total space and communication proportional to the size of the data (linear space and near linear time algorithms). In contrast, for general graphs, achieving the same result for MST (or even connectivity) remains a challenging open problem, despite draw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0042","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-18T03:03:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+BWjLIcgBUZjp9WVOLkVUWUX0cIKPzTGTLP/OLcj3/KOss/Q6h4MVrdozYdSe3aLht+fZVVHu2pLHgy4Y3KDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:13.387005Z"},"content_sha256":"7bb610fbe9512ed86ed1695736b7fc48c6a772f86aa25e271ca37b61de516c27","schema_version":"1.0","event_id":"sha256:7bb610fbe9512ed86ed1695736b7fc48c6a772f86aa25e271ca37b61de516c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/bundle.json","state_url":"https://pith.science/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/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-28T20:44:13Z","links":{"resolver":"https://pith.science/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7","bundle":"https://pith.science/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/bundle.json","state":"https://pith.science/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABKRCKWCEWHJ6V2LMRSEEUT7Q7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ABKRCKWCEWHJ6V2LMRSEEUT7Q7","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":"c772ad07c71e3bb4a6606d1503c84c3198a19f1f7249f6e15165822386154beb","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-30T22:34:56Z","title_canon_sha256":"b3403d60f98c91addc834fb8aa8d174dc09b50bb9ee188ca9e9c33aea649b246"},"schema_version":"1.0","source":{"id":"1401.0042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0042","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0042v2","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0042","created_at":"2026-05-18T03:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"ABKRCKWCEWHJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABKRCKWCEWHJ6V2L","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABKRCKWC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:7bb610fbe9512ed86ed1695736b7fc48c6a772f86aa25e271ca37b61de516c27","target":"graph","created_at":"2026-05-18T03:03:12Z","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 give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensional space, our algorithm computes a $(1+\\epsilon)$-approximate MST. Our algorithms work in a constant number of rounds of communication, while using total space and communication proportional to the size of the data (linear space and near linear time algorithms). In contrast, for general graphs, achieving the same result for MST (or even connectivity) remains a challenging open problem, despite draw","authors_text":"Aleksandar Nikolov, Alexandr Andoni, Grigory Yaroslavtsev, Krzysztof Onak","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-30T22:34:56Z","title":"Parallel Algorithms for Geometric Graph Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0042","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:e63139ad279a7a19119536031c888e30d0ab7889723268655e65859d6b038177","target":"record","created_at":"2026-05-18T03:03:12Z","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":"c772ad07c71e3bb4a6606d1503c84c3198a19f1f7249f6e15165822386154beb","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-30T22:34:56Z","title_canon_sha256":"b3403d60f98c91addc834fb8aa8d174dc09b50bb9ee188ca9e9c33aea649b246"},"schema_version":"1.0","source":{"id":"1401.0042","kind":"arxiv","version":2}},"canonical_sha256":"0055112ac2258e9f574b646442527f87d6247f11a125bcba9dd40c4e7b060d16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0055112ac2258e9f574b646442527f87d6247f11a125bcba9dd40c4e7b060d16","first_computed_at":"2026-05-18T03:03:12.196696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:12.196696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+T1wMmet7qtSXu0Js+Qk4bngfZHB+agLtpgkElg6jwY96Fy1azZtN5fAR4ybHUAvrOfN7Gvv9sEAtrg4WZ9PBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:12.197451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e63139ad279a7a19119536031c888e30d0ab7889723268655e65859d6b038177","sha256:7bb610fbe9512ed86ed1695736b7fc48c6a772f86aa25e271ca37b61de516c27"],"state_sha256":"3809cb26407306327eadcdd6d22a77c13ce800f918cda6a80a8967d4e3389f21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGk+54cnrXEC7bjtrNSoaFRlW9EBGdMq6hqgO+Ui69P7QzL3ghjqRCg9wnNbY75vSBbzucCR2eo6aX8g8Q8JAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:44:13.390492Z","bundle_sha256":"a7db2701635b2c48cdf19031b767123ce3be48b5b3f7ba87e0372f7061a6d29c"}}