{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GIANZO7RAXKOL4CWJW2FNBXALS","short_pith_number":"pith:GIANZO7R","canonical_record":{"source":{"id":"2603.20831","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-21T14:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"b913ece473aac1e6f7b984ae604fd78f613717553adfb2c30b8c797852c4987e","abstract_canon_sha256":"a23959d43346100bc832eaa49f350e385deb649ad9a68fcf361d959f5030479d"},"schema_version":"1.0"},"canonical_sha256":"3200dcbbf105d4e5f0564db45686e05c88ecd7a2f77517a05759eb95855c62ec","source":{"kind":"arxiv","id":"2603.20831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.20831","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.20831v2","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.20831","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"GIANZO7RAXKO","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"GIANZO7RAXKOL4CW","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"GIANZO7R","created_at":"2026-06-03T01:05:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GIANZO7RAXKOL4CWJW2FNBXALS","target":"record","payload":{"canonical_record":{"source":{"id":"2603.20831","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-21T14:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"b913ece473aac1e6f7b984ae604fd78f613717553adfb2c30b8c797852c4987e","abstract_canon_sha256":"a23959d43346100bc832eaa49f350e385deb649ad9a68fcf361d959f5030479d"},"schema_version":"1.0"},"canonical_sha256":"3200dcbbf105d4e5f0564db45686e05c88ecd7a2f77517a05759eb95855c62ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:49.819436Z","signature_b64":"mLy/8c6lKYE/ijJTPEcxCB5zmre+HHcdLKysSHyJMdgrdKsCkPYuBSsT0TOBf8KrGFHy9m1QFN/yx4j6pGimDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3200dcbbf105d4e5f0564db45686e05c88ecd7a2f77517a05759eb95855c62ec","last_reissued_at":"2026-06-03T01:05:49.818990Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:49.818990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.20831","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-06-03T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YliexEPzGqUzh96EYZoUkuOq7O0AERXs55IbnC8E1fXUnceFP01Jfgm+o0rUv+umludYMGYbPKOUSVXnU17Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:31:53.129695Z"},"content_sha256":"ef14068d685f56ca8cf3c8e5dd6791b29566a56607e30839fe47603d9793daab","schema_version":"1.0","event_id":"sha256:ef14068d685f56ca8cf3c8e5dd6791b29566a56607e30839fe47603d9793daab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GIANZO7RAXKOL4CWJW2FNBXALS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Local Verification using Proofs with(out) Errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz Kowalski, Pawe{\\l} Garncarek, Subhajit Pramanick, Tomasz Jurdzinski","submitted_at":"2026-03-21T14:25:35Z","abstract_excerpt":"We study local verification of graph properties in distributed networks under the framework of \\emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to nodes, and a distributed verifier must make all nodes accept if the graph satisfies the property, while at least one node rejects otherwise. Each node bases its decision on a local neighborhood, called its \\emph{view distance}.\n  Our focus is twofold. First, we study cycle existence, i.e., whether a graph contains a cycle (as opposed to cycle-freeness). We show that cycle existence admits verification with only $3$ pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.20831","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/2603.20831/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-06-03T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"divODYDQbszlMWPHdylr1Z469dH494xpfbwMOuex7nsDGMboIn7VwbloDc6+OFJXLzBnz16e1d333Dc2PYP0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:31:53.130074Z"},"content_sha256":"9dae5ecf606b4eaabed11edaae645af5c862000bf4ecd7b47305ea40fc474829","schema_version":"1.0","event_id":"sha256:9dae5ecf606b4eaabed11edaae645af5c862000bf4ecd7b47305ea40fc474829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIANZO7RAXKOL4CWJW2FNBXALS/bundle.json","state_url":"https://pith.science/pith/GIANZO7RAXKOL4CWJW2FNBXALS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIANZO7RAXKOL4CWJW2FNBXALS/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-06-25T20:31:53Z","links":{"resolver":"https://pith.science/pith/GIANZO7RAXKOL4CWJW2FNBXALS","bundle":"https://pith.science/pith/GIANZO7RAXKOL4CWJW2FNBXALS/bundle.json","state":"https://pith.science/pith/GIANZO7RAXKOL4CWJW2FNBXALS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIANZO7RAXKOL4CWJW2FNBXALS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GIANZO7RAXKOL4CWJW2FNBXALS","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":"a23959d43346100bc832eaa49f350e385deb649ad9a68fcf361d959f5030479d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-21T14:25:35Z","title_canon_sha256":"b913ece473aac1e6f7b984ae604fd78f613717553adfb2c30b8c797852c4987e"},"schema_version":"1.0","source":{"id":"2603.20831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.20831","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.20831v2","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.20831","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"GIANZO7RAXKO","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"GIANZO7RAXKOL4CW","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"GIANZO7R","created_at":"2026-06-03T01:05:49Z"}],"graph_snapshots":[{"event_id":"sha256:9dae5ecf606b4eaabed11edaae645af5c862000bf4ecd7b47305ea40fc474829","target":"graph","created_at":"2026-06-03T01:05:49Z","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/2603.20831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study local verification of graph properties in distributed networks under the framework of \\emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to nodes, and a distributed verifier must make all nodes accept if the graph satisfies the property, while at least one node rejects otherwise. Each node bases its decision on a local neighborhood, called its \\emph{view distance}.\n  Our focus is twofold. First, we study cycle existence, i.e., whether a graph contains a cycle (as opposed to cycle-freeness). We show that cycle existence admits verification with only $3$ pr","authors_text":"Dariusz Kowalski, Pawe{\\l} Garncarek, Subhajit Pramanick, Tomasz Jurdzinski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-21T14:25:35Z","title":"Distributed Local Verification using Proofs with(out) Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.20831","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:ef14068d685f56ca8cf3c8e5dd6791b29566a56607e30839fe47603d9793daab","target":"record","created_at":"2026-06-03T01:05:49Z","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":"a23959d43346100bc832eaa49f350e385deb649ad9a68fcf361d959f5030479d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-21T14:25:35Z","title_canon_sha256":"b913ece473aac1e6f7b984ae604fd78f613717553adfb2c30b8c797852c4987e"},"schema_version":"1.0","source":{"id":"2603.20831","kind":"arxiv","version":2}},"canonical_sha256":"3200dcbbf105d4e5f0564db45686e05c88ecd7a2f77517a05759eb95855c62ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3200dcbbf105d4e5f0564db45686e05c88ecd7a2f77517a05759eb95855c62ec","first_computed_at":"2026-06-03T01:05:49.818990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:49.818990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLy/8c6lKYE/ijJTPEcxCB5zmre+HHcdLKysSHyJMdgrdKsCkPYuBSsT0TOBf8KrGFHy9m1QFN/yx4j6pGimDg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:49.819436Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.20831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef14068d685f56ca8cf3c8e5dd6791b29566a56607e30839fe47603d9793daab","sha256:9dae5ecf606b4eaabed11edaae645af5c862000bf4ecd7b47305ea40fc474829"],"state_sha256":"992547314173db48213cfacbaa6d21fb0976cf184b8f26453275475adde92738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swqpxJ+Kt5o403OqnpLX1+oK0VxsmcNZ5CTggyelq8R2K5w2ZteYrZ9XSAKDuYfaaSvLT4y31NmNU/P4Zmk5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:31:53.132076Z","bundle_sha256":"59ca72829b20ba883b5b55d493ad1c8cd092e3e0dd77ed2ac1228ec326ec2ab5"}}