{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C4ZUATZQOLGU4DFNWRIWGWUB2N","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":"6dac9be5c60c3b9698fcc7dae8bf04d83c692afc1165f6670569d5c5cd17beb9","cross_cats_sorted":["math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-28T12:12:43Z","title_canon_sha256":"a0204b9282651bf14ef67e38a170d5ad25e95dc06d231be8ddc8579af6dc34c4"},"schema_version":"1.0","source":{"id":"1109.6181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6181","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6181v2","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6181","created_at":"2026-05-18T04:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"C4ZUATZQOLGU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C4ZUATZQOLGU4DFN","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C4ZUATZQ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:af0005bc88f1b0e380886bc43f5bcbbb276072aa1c77ce70079df793aa30cd27","target":"graph","created_at":"2026-05-18T04:11: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"},"paper":{"abstract_excerpt":"An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an accessing set, and on the maximal size kappa(G) of a non-accessing set of a graph G. We show strong connections with perfect codes and give explicitly kappa(G) and kappa'(G) for several families of graphs. Finally, we show that the corresponding decision problems are NP-Complete.","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix, Sylvain Gravier","cross_cats":["math.CO","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-28T12:12:43Z","title":"Optimal accessing and non-accessing structures for graph protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6181","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:f67160df5d5c8dc664bfad35305d1227c33ecb857e7b8fb8171fea22464f700a","target":"record","created_at":"2026-05-18T04:11: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":"6dac9be5c60c3b9698fcc7dae8bf04d83c692afc1165f6670569d5c5cd17beb9","cross_cats_sorted":["math.CO","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-28T12:12:43Z","title_canon_sha256":"a0204b9282651bf14ef67e38a170d5ad25e95dc06d231be8ddc8579af6dc34c4"},"schema_version":"1.0","source":{"id":"1109.6181","kind":"arxiv","version":2}},"canonical_sha256":"1733404f3072cd4e0cadb451635a81d35523445fca7252a9be6449a02ae7e4b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1733404f3072cd4e0cadb451635a81d35523445fca7252a9be6449a02ae7e4b6","first_computed_at":"2026-05-18T04:11:41.507829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:41.507829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iVPY7eA58gfSXMrskKGUWFNkhYp04CgHTVljPYkXRRXlPXz6jKB3wqdTEvc2wMTLitqHiYRBbBjPSo2ROauoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:41.508349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f67160df5d5c8dc664bfad35305d1227c33ecb857e7b8fb8171fea22464f700a","sha256:af0005bc88f1b0e380886bc43f5bcbbb276072aa1c77ce70079df793aa30cd27"],"state_sha256":"34ceb715e7f128cefc09023695fe41c03a4a28780de016201e4bb2318e07ee08"}