{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q7M4FEIQOLWVF6XKNHL4KRF753","short_pith_number":"pith:Q7M4FEIQ","canonical_record":{"source":{"id":"2607.09626","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T17:25:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b969b2bc7182e1a1884ecd235a57852179ff70c6890a01681b19ec74e25d4447","abstract_canon_sha256":"672df698892116016ec47d7ddcd5f59ace272e998340f222e3baaa5740d9243b"},"schema_version":"1.0"},"canonical_sha256":"87d9c2911072ed52faea69d7c544bfeec39cd9d13e7a389ff50a09b8159b46c3","source":{"kind":"arxiv","id":"2607.09626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09626","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09626v1","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09626","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_12","alias_value":"Q7M4FEIQOLWV","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_16","alias_value":"Q7M4FEIQOLWVF6XK","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_8","alias_value":"Q7M4FEIQ","created_at":"2026-07-13T01:20:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q7M4FEIQOLWVF6XKNHL4KRF753","target":"record","payload":{"canonical_record":{"source":{"id":"2607.09626","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T17:25:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b969b2bc7182e1a1884ecd235a57852179ff70c6890a01681b19ec74e25d4447","abstract_canon_sha256":"672df698892116016ec47d7ddcd5f59ace272e998340f222e3baaa5740d9243b"},"schema_version":"1.0"},"canonical_sha256":"87d9c2911072ed52faea69d7c544bfeec39cd9d13e7a389ff50a09b8159b46c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:20:25.043925Z","signature_b64":"TCv2wYOEb5+zmAFrGlsnaMIRd9fW2Hy7V/JvfYOvawSsVLU0Y3B0ZTIbXPau4lgPBAn2cQ+T4m8Vdfou4MkoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d9c2911072ed52faea69d7c544bfeec39cd9d13e7a389ff50a09b8159b46c3","last_reissued_at":"2026-07-13T01:20:25.042656Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:20:25.042656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.09626","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-07-13T01:20:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdvTgEocczjFaL5MbGa5k1iSnQIFPkkIdn2Rq2g1JBhAxeb/R91zaUhKYzraMrRZX7TSg29bS1dkILALbdNQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:55:53.558510Z"},"content_sha256":"af282eba3731210d5e384d21ab60b7a5098057723c8838ece226538df0a54db1","schema_version":"1.0","event_id":"sha256:af282eba3731210d5e384d21ab60b7a5098057723c8838ece226538df0a54db1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q7M4FEIQOLWVF6XKNHL4KRF753","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Sijin Peng","submitted_at":"2026-07-10T17:25:22Z","abstract_excerpt":"Local Computation Algorithms (LCAs), introduced by Rubinfeld, Tamir, Vardi, and Xie (2011), are a special type of sublinear algorithms that, given probing access to a possibly massive input, are required to provide query access to a consistent solution, without maintaining a state between different queries. In this paper, we try to understand LCA through the lens of complexity classifications, described by the following question: Given a target complexity function $f(n)$, is there a problem whose local computation complexity is $f(n)$, up to polylogarithmic factors?\n  We restrict our focus to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09626","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.09626/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-13T01:20:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAYg0/taI8Tj8xAxeXGqhHmdSHqu8JApcC6JbfXdPIzeUCvdOeokE40z34kFzNA9vrOxtT1IsqpvAfwIAPwAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:55:53.559024Z"},"content_sha256":"f971b57d015b425c0a75b2e5b6f0e2bdb5f0f21b556ca65a9609c9a43fd9eedf","schema_version":"1.0","event_id":"sha256:f971b57d015b425c0a75b2e5b6f0e2bdb5f0f21b556ca65a9609c9a43fd9eedf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/bundle.json","state_url":"https://pith.science/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/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-08-12T09:55:53Z","links":{"resolver":"https://pith.science/pith/Q7M4FEIQOLWVF6XKNHL4KRF753","bundle":"https://pith.science/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/bundle.json","state":"https://pith.science/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7M4FEIQOLWVF6XKNHL4KRF753/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q7M4FEIQOLWVF6XKNHL4KRF753","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":"672df698892116016ec47d7ddcd5f59ace272e998340f222e3baaa5740d9243b","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T17:25:22Z","title_canon_sha256":"b969b2bc7182e1a1884ecd235a57852179ff70c6890a01681b19ec74e25d4447"},"schema_version":"1.0","source":{"id":"2607.09626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09626","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09626v1","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09626","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_12","alias_value":"Q7M4FEIQOLWV","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_16","alias_value":"Q7M4FEIQOLWVF6XK","created_at":"2026-07-13T01:20:25Z"},{"alias_kind":"pith_short_8","alias_value":"Q7M4FEIQ","created_at":"2026-07-13T01:20:25Z"}],"graph_snapshots":[{"event_id":"sha256:f971b57d015b425c0a75b2e5b6f0e2bdb5f0f21b556ca65a9609c9a43fd9eedf","target":"graph","created_at":"2026-07-13T01:20:25Z","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/2607.09626/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Local Computation Algorithms (LCAs), introduced by Rubinfeld, Tamir, Vardi, and Xie (2011), are a special type of sublinear algorithms that, given probing access to a possibly massive input, are required to provide query access to a consistent solution, without maintaining a state between different queries. In this paper, we try to understand LCA through the lens of complexity classifications, described by the following question: Given a target complexity function $f(n)$, is there a problem whose local computation complexity is $f(n)$, up to polylogarithmic factors?\n  We restrict our focus to ","authors_text":"Sijin Peng","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09626","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:af282eba3731210d5e384d21ab60b7a5098057723c8838ece226538df0a54db1","target":"record","created_at":"2026-07-13T01:20:25Z","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":"672df698892116016ec47d7ddcd5f59ace272e998340f222e3baaa5740d9243b","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-10T17:25:22Z","title_canon_sha256":"b969b2bc7182e1a1884ecd235a57852179ff70c6890a01681b19ec74e25d4447"},"schema_version":"1.0","source":{"id":"2607.09626","kind":"arxiv","version":1}},"canonical_sha256":"87d9c2911072ed52faea69d7c544bfeec39cd9d13e7a389ff50a09b8159b46c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87d9c2911072ed52faea69d7c544bfeec39cd9d13e7a389ff50a09b8159b46c3","first_computed_at":"2026-07-13T01:20:25.042656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:20:25.042656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TCv2wYOEb5+zmAFrGlsnaMIRd9fW2Hy7V/JvfYOvawSsVLU0Y3B0ZTIbXPau4lgPBAn2cQ+T4m8Vdfou4MkoCw==","signature_status":"signed_v1","signed_at":"2026-07-13T01:20:25.043925Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af282eba3731210d5e384d21ab60b7a5098057723c8838ece226538df0a54db1","sha256:f971b57d015b425c0a75b2e5b6f0e2bdb5f0f21b556ca65a9609c9a43fd9eedf"],"state_sha256":"c3a17fa7cb582b5ecf9d5d54af13ad39daf7de1534a564d191322ef607ee35aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vP1Scpepw6swuYKa8xvOfd1osO1RUOlt/CpYLoFxAiingwvcJjLNZ9Z7Nc6G212DmR6y8+qlOOSsnnzpVupxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T09:55:53.564436Z","bundle_sha256":"2576cbbc9a4c8c227c5fc0f106e3774ef1a75cec69070b958497a5a89c899a13"}}