{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IVPG72TDK3V7NVKDRXHCEV55Z6","short_pith_number":"pith:IVPG72TD","canonical_record":{"source":{"id":"1304.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-05T22:36:46Z","cross_cats_sorted":["cs.CC","cs.DC","math.CO"],"title_canon_sha256":"cc42fd9c306199c3bec8598e0505ba4d448a11d65a77547a566873bb655ab945","abstract_canon_sha256":"ef116088389243b63c5870eb8dcf6426c2415cdea0a5ff57d6e9b1a2735f9d22"},"schema_version":"1.0"},"canonical_sha256":"455e6fea6356ebf6d5438dce2257bdcf90454366004a8b3f83e71b132939212e","source":{"kind":"arxiv","id":"1304.1831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1831","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1831v1","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1831","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"IVPG72TDK3V7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IVPG72TDK3V7NVKD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IVPG72TD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IVPG72TDK3V7NVKDRXHCEV55Z6","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-05T22:36:46Z","cross_cats_sorted":["cs.CC","cs.DC","math.CO"],"title_canon_sha256":"cc42fd9c306199c3bec8598e0505ba4d448a11d65a77547a566873bb655ab945","abstract_canon_sha256":"ef116088389243b63c5870eb8dcf6426c2415cdea0a5ff57d6e9b1a2735f9d22"},"schema_version":"1.0"},"canonical_sha256":"455e6fea6356ebf6d5438dce2257bdcf90454366004a8b3f83e71b132939212e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:45.046336Z","signature_b64":"ewiSj9NX2tVdPF0r21VtuoFlI282/SKzv+b0n/qJ7eyJTdncnvlhre1ZFmOR8z/2Bso99PqZtQdz308BXOYEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455e6fea6356ebf6d5438dce2257bdcf90454366004a8b3f83e71b132939212e","last_reissued_at":"2026-05-18T03:28:45.045550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:45.045550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1831","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:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ggHJ9qLdU8mXB+Trtd1XlMne+BRGnZH4+CxzA3MZ4tfHU6SZjNOG3jj45EoqEva4JgxErsnM8mS5tl67kSCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:56:09.407561Z"},"content_sha256":"89f084b01087d05fc25b13d00370d39da0f6b524e9bce605b1199b65942628f0","schema_version":"1.0","event_id":"sha256:89f084b01087d05fc25b13d00370d39da0f6b524e9bce605b1199b65942628f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IVPG72TDK3V7NVKDRXHCEV55Z6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limits of local algorithms over sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","math.CO"],"primary_cat":"math.PR","authors_text":"David Gamarnik, Madhu Sudan","submitted_at":"2013-04-05T22:36:46Z","abstract_excerpt":"Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the global structure, while also potentially using some randomness. Recent research has shown that such algorithms show significant promise in computing structures like large independent sets in graphs locally. Indeed the promise led to a conjecture by Hatami, \\Lovasz and Szegedy \\cite{HatamiLovaszSzegedy} that local algorithms may be able to compute maximum inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1831","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:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0T5sC8NSZ1SfjToM14Uri9Y6EuUJeJe3saVY1BDw63MQmir1LwfohDdOE7yDODWe723Ti2P6cu4hZH/Mm5LDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:56:09.408244Z"},"content_sha256":"b3bce6725a21fe81791e327a1571714ca837d3ef3602d6fd77e875337be30251","schema_version":"1.0","event_id":"sha256:b3bce6725a21fe81791e327a1571714ca837d3ef3602d6fd77e875337be30251"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/bundle.json","state_url":"https://pith.science/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/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-27T13:56:09Z","links":{"resolver":"https://pith.science/pith/IVPG72TDK3V7NVKDRXHCEV55Z6","bundle":"https://pith.science/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/bundle.json","state":"https://pith.science/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVPG72TDK3V7NVKDRXHCEV55Z6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IVPG72TDK3V7NVKDRXHCEV55Z6","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":"ef116088389243b63c5870eb8dcf6426c2415cdea0a5ff57d6e9b1a2735f9d22","cross_cats_sorted":["cs.CC","cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-05T22:36:46Z","title_canon_sha256":"cc42fd9c306199c3bec8598e0505ba4d448a11d65a77547a566873bb655ab945"},"schema_version":"1.0","source":{"id":"1304.1831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1831","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1831v1","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1831","created_at":"2026-05-18T03:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"IVPG72TDK3V7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IVPG72TDK3V7NVKD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IVPG72TD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:b3bce6725a21fe81791e327a1571714ca837d3ef3602d6fd77e875337be30251","target":"graph","created_at":"2026-05-18T03:28:45Z","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":"Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the global structure, while also potentially using some randomness. Recent research has shown that such algorithms show significant promise in computing structures like large independent sets in graphs locally. Indeed the promise led to a conjecture by Hatami, \\Lovasz and Szegedy \\cite{HatamiLovaszSzegedy} that local algorithms may be able to compute maximum inde","authors_text":"David Gamarnik, Madhu Sudan","cross_cats":["cs.CC","cs.DC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-05T22:36:46Z","title":"Limits of local algorithms over sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1831","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:89f084b01087d05fc25b13d00370d39da0f6b524e9bce605b1199b65942628f0","target":"record","created_at":"2026-05-18T03:28:45Z","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":"ef116088389243b63c5870eb8dcf6426c2415cdea0a5ff57d6e9b1a2735f9d22","cross_cats_sorted":["cs.CC","cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-05T22:36:46Z","title_canon_sha256":"cc42fd9c306199c3bec8598e0505ba4d448a11d65a77547a566873bb655ab945"},"schema_version":"1.0","source":{"id":"1304.1831","kind":"arxiv","version":1}},"canonical_sha256":"455e6fea6356ebf6d5438dce2257bdcf90454366004a8b3f83e71b132939212e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455e6fea6356ebf6d5438dce2257bdcf90454366004a8b3f83e71b132939212e","first_computed_at":"2026-05-18T03:28:45.045550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:45.045550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ewiSj9NX2tVdPF0r21VtuoFlI282/SKzv+b0n/qJ7eyJTdncnvlhre1ZFmOR8z/2Bso99PqZtQdz308BXOYEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:45.046336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89f084b01087d05fc25b13d00370d39da0f6b524e9bce605b1199b65942628f0","sha256:b3bce6725a21fe81791e327a1571714ca837d3ef3602d6fd77e875337be30251"],"state_sha256":"7519b002d504d077243bc11b0b3ccd990c70247330a466d2023ff9ddf7e06e2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4Pk3kT1S6u9jUun0cNJy4z/w+yv+0H6SH3ptNw5UlzZz3Z2K0kh8Y1zi9lvccRA+DF/d9LJR1Sr9BuN6+iVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:56:09.412145Z","bundle_sha256":"4281ff4e80922261f26350ba6947e0483bb78f94516b83a676e69029a567e2d6"}}