{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CQ4Y5LWNHEIY56GJLUTVYJT7VL","short_pith_number":"pith:CQ4Y5LWN","schema_version":"1.0","canonical_sha256":"14398eaecd39118ef8c95d275c267faaebb0a89423e6c159837a3d2107893454","source":{"kind":"arxiv","id":"2606.04934","version":1},"attestation_state":"computed","paper":{"title":"The local complexity of certifying parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jorge Valenzuela, Laurent Feuilloley, Nicolas Bousquet, S\\'ebastien Zeitoun","submitted_at":"2026-06-03T14:24:47Z","abstract_excerpt":"In this paper, we consider the problem of locally certifying that the size of a network is even, or more generally, congruent to some fixed number. The parity property is one of the simplest global properties, and it plays an intriguing role in local certification. On the one hand, it is one of the simplest properties in cycles because it is equivalent to 2-colorability, and hence can be certified with a single bit. On the other hand, in general graphs, no non-trivial lower bound on the size of the certificates is known, and the known upper bound basically consists in certifying the \\emph{exac"},"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":"2606.04934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T14:24:47Z","cross_cats_sorted":[],"title_canon_sha256":"1d887586d8c1cbc6d1c3f2c0b5feca4bfa095b8a4dd08266f9de1998baa28175","abstract_canon_sha256":"51680c22fad95d0a60e60761d316be99ba4044e0a9094b007c2cc888877a7396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:56.479910Z","signature_b64":"N9oa8bGHHux4j1oFZpTbMYFlxJUsTPkjreQTlRACOimTqnDmaxje37yGiZ5M8MqXo/4tMMPGg6ZPfsyevk87AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14398eaecd39118ef8c95d275c267faaebb0a89423e6c159837a3d2107893454","last_reissued_at":"2026-06-04T01:09:56.478907Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:56.478907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The local complexity of certifying parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jorge Valenzuela, Laurent Feuilloley, Nicolas Bousquet, S\\'ebastien Zeitoun","submitted_at":"2026-06-03T14:24:47Z","abstract_excerpt":"In this paper, we consider the problem of locally certifying that the size of a network is even, or more generally, congruent to some fixed number. The parity property is one of the simplest global properties, and it plays an intriguing role in local certification. On the one hand, it is one of the simplest properties in cycles because it is equivalent to 2-colorability, and hence can be certified with a single bit. On the other hand, in general graphs, no non-trivial lower bound on the size of the certificates is known, and the known upper bound basically consists in certifying the \\emph{exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04934","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/2606.04934/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":"2606.04934","created_at":"2026-06-04T01:09:56.478993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04934v1","created_at":"2026-06-04T01:09:56.478993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04934","created_at":"2026-06-04T01:09:56.478993+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ4Y5LWNHEIY","created_at":"2026-06-04T01:09:56.478993+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ4Y5LWNHEIY56GJ","created_at":"2026-06-04T01:09:56.478993+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ4Y5LWN","created_at":"2026-06-04T01:09:56.478993+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/CQ4Y5LWNHEIY56GJLUTVYJT7VL","json":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL.json","graph_json":"https://pith.science/api/pith-number/CQ4Y5LWNHEIY56GJLUTVYJT7VL/graph.json","events_json":"https://pith.science/api/pith-number/CQ4Y5LWNHEIY56GJLUTVYJT7VL/events.json","paper":"https://pith.science/paper/CQ4Y5LWN"},"agent_actions":{"view_html":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL","download_json":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL.json","view_paper":"https://pith.science/paper/CQ4Y5LWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04934&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ4Y5LWNHEIY56GJLUTVYJT7VL/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ4Y5LWNHEIY56GJLUTVYJT7VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL/action/storage_attestation","attest_author":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL/action/author_attestation","sign_citation":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL/action/citation_signature","submit_replication":"https://pith.science/pith/CQ4Y5LWNHEIY56GJLUTVYJT7VL/action/replication_record"}},"created_at":"2026-06-04T01:09:56.478993+00:00","updated_at":"2026-06-04T01:09:56.478993+00:00"}