{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LX4QH3H3X73QGKYBYWWOD6D5JJ","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":"280a62bd3b9f5c919b586499f4048ea95db483ccbf2ae8ad55b873dea15db562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-01T23:26:31Z","title_canon_sha256":"a411834fb368f53236a4f810beecb53dbbac1f9b7a620006c32242f4a8e1bb85"},"schema_version":"1.0","source":{"id":"2505.00915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00915","created_at":"2026-07-05T10:57:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00915v1","created_at":"2026-07-05T10:57:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00915","created_at":"2026-07-05T10:57:41Z"},{"alias_kind":"pith_short_12","alias_value":"LX4QH3H3X73Q","created_at":"2026-07-05T10:57:41Z"},{"alias_kind":"pith_short_16","alias_value":"LX4QH3H3X73QGKYB","created_at":"2026-07-05T10:57:41Z"},{"alias_kind":"pith_short_8","alias_value":"LX4QH3H3","created_at":"2026-07-05T10:57:41Z"}],"graph_snapshots":[{"event_id":"sha256:f8649073ebb73f71c7fecfcb1abb78d342fb2f6a4d5e8e9b14f4168ce6b80da5","target":"graph","created_at":"2026-07-05T10:57:41Z","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/2505.00915/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study *non-adaptive* Local Computation Algorithms (LCA). A reduction of Parnas and Ron (TCS'07) turns any distributed algorithm into a non-adaptive LCA. Plugging known distributed algorithms, this leads to non-adaptive LCAs for constant approximations of maximum matching (MM) and minimum vertex cover (MVC) with complexity $\\Delta^{O(\\log \\Delta / \\log \\log \\Delta)}$, where $\\Delta$ is the maximum degree of the graph. Allowing adaptivity, this bound can be significantly improved to $\\text{poly}(\\Delta)$, but is such a gap necessary or are there better non-adaptive LCAs?\n  Adaptivity as a res","authors_text":"Alma Ghafari, Amir Azarmehr, Madhu Sudan, Soheil Behnezhad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-01T23:26:31Z","title":"Lower Bounds for Non-adaptive Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00915","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:e41698fed75a7391e9cd04936c2d7d612c64b1fd057342a6223b9da6e9e0fa03","target":"record","created_at":"2026-07-05T10:57:41Z","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":"280a62bd3b9f5c919b586499f4048ea95db483ccbf2ae8ad55b873dea15db562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-01T23:26:31Z","title_canon_sha256":"a411834fb368f53236a4f810beecb53dbbac1f9b7a620006c32242f4a8e1bb85"},"schema_version":"1.0","source":{"id":"2505.00915","kind":"arxiv","version":1}},"canonical_sha256":"5df903ecfbbff7032b01c5ace1f87d4a72dde3de313e8ac990161016b6294843","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5df903ecfbbff7032b01c5ace1f87d4a72dde3de313e8ac990161016b6294843","first_computed_at":"2026-07-05T10:57:41.755258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:57:41.755258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5W5KL7qVuBXKBxO1hZ4J9vQDOF+UB6j58QLZkTs+cHCNcOj9JysOvyZpKY1suvnFuSEIiCg9XjE4L83vXHseAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:57:41.755826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.00915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e41698fed75a7391e9cd04936c2d7d612c64b1fd057342a6223b9da6e9e0fa03","sha256:f8649073ebb73f71c7fecfcb1abb78d342fb2f6a4d5e8e9b14f4168ce6b80da5"],"state_sha256":"4cfca6373044f58219cbfc3670b4684d6dc0b2418dd45b011ba9de789e900fa2"}