{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3H6PTRD3KKHCJRLQWQHW57YPHP","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":"380fc1f1957a26cab10d5c7de513f341af387b684836994f7a01a0e7780d5423","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T09:36:18Z","title_canon_sha256":"09cab366dfe5f6c0a4ab2ad8811839aa21004b33d86ba9716b64179d5da74021"},"schema_version":"1.0","source":{"id":"1705.10520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10520","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10520v1","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10520","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"3H6PTRD3KKHC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3H6PTRD3KKHCJRLQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3H6PTRD3","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:fa139b1031e4ff8ca94202e471db579f425f3392745a0a9a02b52498e2624db0","target":"graph","created_at":"2026-05-18T00:43:24Z","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":"We investigate graph based secret sharing schemes and its information ratio, also called complexity, measuring the maximal amount of information the vertices has to store. It was conjectured that in large girth graphs, where the interaction between far away nodes is restricted to a single path, this ratio is bounded. This conjecture was supported by several result, most notably by a result of Csirmaz and Ligeti saying that the complexity of graphs with girth at least six and no neighboring high degree vertices is strictly below 2. In this paper we refute the above conjecture. First, a family o","authors_text":"Laszlo Csirmaz, Peter Ligeti","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T09:36:18Z","title":"Secret sharing on large girth graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10520","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:b0fd47b784bf69f654733b39f680c63bec5e51c3470f51e42ad16825c4756e6e","target":"record","created_at":"2026-05-18T00:43:24Z","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":"380fc1f1957a26cab10d5c7de513f341af387b684836994f7a01a0e7780d5423","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T09:36:18Z","title_canon_sha256":"09cab366dfe5f6c0a4ab2ad8811839aa21004b33d86ba9716b64179d5da74021"},"schema_version":"1.0","source":{"id":"1705.10520","kind":"arxiv","version":1}},"canonical_sha256":"d9fcf9c47b528e24c570b40f6eff0f3bdfe9f8a5fb152ffd3f0e30253f4e56b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9fcf9c47b528e24c570b40f6eff0f3bdfe9f8a5fb152ffd3f0e30253f4e56b6","first_computed_at":"2026-05-18T00:43:24.378605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:24.378605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CXm06n6gYirR0ytW611oN+MYrYpnmVEBUrCMfCR13UKetuulun3pLlOd3vi7AVq+GTcQlkKGO8jtkstkoE0PAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:24.379190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0fd47b784bf69f654733b39f680c63bec5e51c3470f51e42ad16825c4756e6e","sha256:fa139b1031e4ff8ca94202e471db579f425f3392745a0a9a02b52498e2624db0"],"state_sha256":"4531c09b42db0edab6bf4179d3af864c907f266bbce14518ba2e504c9065a8d7"}