{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KRXRUVYNB664GV6MSSBON55RFD","short_pith_number":"pith:KRXRUVYN","schema_version":"1.0","canonical_sha256":"546f1a570d0fbdc357cc9482e6f7b128cf98f9bd3b1e9cfcfb19e5b626653498","source":{"kind":"arxiv","id":"2403.00129","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.00129","created_at":"2026-07-05T11:27:18.056108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00129v2","created_at":"2026-07-05T11:27:18.056108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00129","created_at":"2026-07-05T11:27:18.056108+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRXRUVYNB664","created_at":"2026-07-05T11:27:18.056108+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRXRUVYNB664GV6M","created_at":"2026-07-05T11:27:18.056108+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRXRUVYN","created_at":"2026-07-05T11:27:18.056108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD","json":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD.json","graph_json":"https://pith.science/api/pith-number/KRXRUVYNB664GV6MSSBON55RFD/graph.json","events_json":"https://pith.science/api/pith-number/KRXRUVYNB664GV6MSSBON55RFD/events.json","paper":"https://pith.science/paper/KRXRUVYN"},"agent_actions":{"view_html":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD","download_json":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD.json","view_paper":"https://pith.science/paper/KRXRUVYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00129&json=true","fetch_graph":"https://pith.science/api/pith-number/KRXRUVYNB664GV6MSSBON55RFD/graph.json","fetch_events":"https://pith.science/api/pith-number/KRXRUVYNB664GV6MSSBON55RFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/action/storage_attestation","attest_author":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/action/author_attestation","sign_citation":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/action/citation_signature","submit_replication":"https://pith.science/pith/KRXRUVYNB664GV6MSSBON55RFD/action/replication_record"}},"created_at":"2026-07-05T11:27:18.056108+00:00","updated_at":"2026-07-05T11:27:18.056108+00:00"}