{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KRXRUVYNB664GV6MSSBON55RFD","short_pith_number":"pith:KRXRUVYN","canonical_record":{"source":{"id":"2403.00129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T21:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"5e6da21d840870cca95912c75b5fc668df6b3298f14c357e1181ead00caf8a22","abstract_canon_sha256":"c1dfc50cb191bae0c3ea0758ebef7371e86c9f543811d542246735da06ef934f"},"schema_version":"1.0"},"canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","source":{"kind":"arxiv","id":"2403.00129","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.00129","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"2403.00129v2","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00129","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"KRXRUVYNB664","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"KRXRUVYNB664GV6M","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"KRXRUVYN","created_at":"2026-07-05T11:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KRXRUVYNB664GV6MSSBON55RFD","target":"record","payload":{"canonical_record":{"source":{"id":"2403.00129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T21:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"5e6da21d840870cca95912c75b5fc668df6b3298f14c357e1181ead00caf8a22","abstract_canon_sha256":"c1dfc50cb191bae0c3ea0758ebef7371e86c9f543811d542246735da06ef934f"},"schema_version":"1.0"},"canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:18.056513Z","signature_b64":"cejIUuZeZuEHKF09ix0NaD0+LmL7LAMgZBRZ4xfTW66nW7H4En2l650/uHTaT+CteBgtCtzNhZjetz9z1piyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","last_reissued_at":"2026-07-05T11:27:18.056053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:18.056053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.00129","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-07-05T11:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRb3gYF6Hqzj6ed9BO6YGdYknNh7YBPw4IvHFSyIgpw8a+XNmK3kt7aDSpRm6tbhLUXxsgYSCe/52gm7uQzdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:23:38.739965Z"},"content_sha256":"ca991a3a7d67ba1ea700d6488cb49c02f5c44ebed3528bc52f95f03f4a4446dc","schema_version":"1.0","event_id":"sha256:ca991a3a7d67ba1ea700d6488cb49c02f5c44ebed3528bc52f95f03f4a4446dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KRXRUVYNB664GV6MSSBON55RFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Worst Case Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amartya Shankha Biswas, Asaf Shapira, Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Ruidi Cao, Shlomo Tauber","submitted_at":"2024-02-29T21:14:01Z","abstract_excerpt":"We initiate the study of Local Computation Algorithms on average case inputs. In the Local Computation Algorithm (LCA) model, we are given probe access to a huge graph, and asked to answer membership queries about some combinatorial structure on the graph, answering each query with sublinear work.\n  For instance, an LCA for the $k$-spanner problem gives access to a sparse subgraph $H\\subseteq G$ that preserves distances up to a factor of $k$. We build simple LCAs for this problem assuming the input graph is drawn from the well-studied Erdos-Reyni and Preferential Attachment graph models. In bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00129","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.00129/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNk4l2rrOsGv/3c64a87vw2U33bDJSiQqmdk3xB9A3cxEu/LxlHdmxlWFINC9+6Tl4L2OU1tUiEM2leyx0dMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:23:38.740337Z"},"content_sha256":"f4468e3e5896038755a9f855e0292af2f9f15376108a6c1a7777273b7d4f56ef","schema_version":"1.0","event_id":"sha256:f4468e3e5896038755a9f855e0292af2f9f15376108a6c1a7777273b7d4f56ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/bundle.json","state_url":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRXRUVYNB664GV6MSSBON55RFD/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-07-07T10:23:38Z","links":{"resolver":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD","bundle":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/bundle.json","state":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRXRUVYNB664GV6MSSBON55RFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KRXRUVYNB664GV6MSSBON55RFD","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":"c1dfc50cb191bae0c3ea0758ebef7371e86c9f543811d542246735da06ef934f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T21:14:01Z","title_canon_sha256":"5e6da21d840870cca95912c75b5fc668df6b3298f14c357e1181ead00caf8a22"},"schema_version":"1.0","source":{"id":"2403.00129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.00129","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"2403.00129v2","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00129","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"KRXRUVYNB664","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"KRXRUVYNB664GV6M","created_at":"2026-07-05T11:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"KRXRUVYN","created_at":"2026-07-05T11:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:f4468e3e5896038755a9f855e0292af2f9f15376108a6c1a7777273b7d4f56ef","target":"graph","created_at":"2026-07-05T11:27:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.00129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We initiate the study of Local Computation Algorithms on average case inputs. In the Local Computation Algorithm (LCA) model, we are given probe access to a huge graph, and asked to answer membership queries about some combinatorial structure on the graph, answering each query with sublinear work.\n  For instance, an LCA for the $k$-spanner problem gives access to a sparse subgraph $H\\subseteq G$ that preserves distances up to a factor of $k$. We build simple LCAs for this problem assuming the input graph is drawn from the well-studied Erdos-Reyni and Preferential Attachment graph models. In bo","authors_text":"Amartya Shankha Biswas, Asaf Shapira, Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Ruidi Cao, Shlomo Tauber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T21:14:01Z","title":"Beyond Worst Case Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00129","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:ca991a3a7d67ba1ea700d6488cb49c02f5c44ebed3528bc52f95f03f4a4446dc","target":"record","created_at":"2026-07-05T11:27:18Z","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":"c1dfc50cb191bae0c3ea0758ebef7371e86c9f543811d542246735da06ef934f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-29T21:14:01Z","title_canon_sha256":"5e6da21d840870cca95912c75b5fc668df6b3298f14c357e1181ead00caf8a22"},"schema_version":"1.0","source":{"id":"2403.00129","kind":"arxiv","version":2}},"canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","first_computed_at":"2026-07-05T11:27:18.056053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:18.056053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cejIUuZeZuEHKF09ix0NaD0+LmL7LAMgZBRZ4xfTW66nW7H4En2l650/uHTaT+CteBgtCtzNhZjetz9z1piyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:18.056513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.00129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca991a3a7d67ba1ea700d6488cb49c02f5c44ebed3528bc52f95f03f4a4446dc","sha256:f4468e3e5896038755a9f855e0292af2f9f15376108a6c1a7777273b7d4f56ef"],"state_sha256":"2d2867cfd64911edc4f3d53b45b0ebc6a0ff0cefd43326d0d7bdf76b79f2aa9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgV7jbxR7ZPFE1rLCoaHcTYix/gQ5epFco1vl1grsJ+iLXsSU8uhxEP1qTbE0orVC1kb1YXJWAhEzpZmoBWzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:23:38.742210Z","bundle_sha256":"74e3712ec5ecb81eda5924ce8e03e03f75eb5022ddd6a959bfc27742a2567424"}}