{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3H6PTRD3KKHCJRLQWQHW57YPHP","short_pith_number":"pith:3H6PTRD3","canonical_record":{"source":{"id":"1705.10520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T09:36:18Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"09cab366dfe5f6c0a4ab2ad8811839aa21004b33d86ba9716b64179d5da74021","abstract_canon_sha256":"380fc1f1957a26cab10d5c7de513f341af387b684836994f7a01a0e7780d5423"},"schema_version":"1.0"},"canonical_sha256":"d9fcf9c47b528e24c570b40f6eff0f3bdfe9f8a5fb152ffd3f0e30253f4e56b6","source":{"kind":"arxiv","id":"1705.10520","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3H6PTRD3KKHCJRLQWQHW57YPHP","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T09:36:18Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"09cab366dfe5f6c0a4ab2ad8811839aa21004b33d86ba9716b64179d5da74021","abstract_canon_sha256":"380fc1f1957a26cab10d5c7de513f341af387b684836994f7a01a0e7780d5423"},"schema_version":"1.0"},"canonical_sha256":"d9fcf9c47b528e24c570b40f6eff0f3bdfe9f8a5fb152ffd3f0e30253f4e56b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:24.379190Z","signature_b64":"CXm06n6gYirR0ytW611oN+MYrYpnmVEBUrCMfCR13UKetuulun3pLlOd3vi7AVq+GTcQlkKGO8jtkstkoE0PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9fcf9c47b528e24c570b40f6eff0f3bdfe9f8a5fb152ffd3f0e30253f4e56b6","last_reissued_at":"2026-05-18T00:43:24.378605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:24.378605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10520","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-05-18T00:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FmA4UTkta1Io9Cvp7qR/kgw1v0wYKA78X4ofPFGQr4urHBZSuHXyYFRRYGe1JlPbLjh0VjKFcVjr67+MLDrHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:14:54.033174Z"},"content_sha256":"b0fd47b784bf69f654733b39f680c63bec5e51c3470f51e42ad16825c4756e6e","schema_version":"1.0","event_id":"sha256:b0fd47b784bf69f654733b39f680c63bec5e51c3470f51e42ad16825c4756e6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3H6PTRD3KKHCJRLQWQHW57YPHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secret sharing on large girth graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Laszlo Csirmaz, Peter Ligeti","submitted_at":"2017-05-30T09:36:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10520","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":""},"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-05-18T00:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlHquc5z3CA1sWeZxXAR2JGH1ObAZu4t3bDh5YCWzdaykwitujN2Fv0koVCWXW/kLh6ZjvvrNGVLz4x2ri3ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:14:54.033723Z"},"content_sha256":"fa139b1031e4ff8ca94202e471db579f425f3392745a0a9a02b52498e2624db0","schema_version":"1.0","event_id":"sha256:fa139b1031e4ff8ca94202e471db579f425f3392745a0a9a02b52498e2624db0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/bundle.json","state_url":"https://pith.science/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/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-07T06:14:54Z","links":{"resolver":"https://pith.science/pith/3H6PTRD3KKHCJRLQWQHW57YPHP","bundle":"https://pith.science/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/bundle.json","state":"https://pith.science/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3H6PTRD3KKHCJRLQWQHW57YPHP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiWLMVm1rL6h3yN/tHD+dsDnJi0I1kacMTwxOhE2mM66cUNdWImHWfCx8iFJAjhOLYQji1aAqYHG0YPqAiiqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:14:54.036668Z","bundle_sha256":"74fc97097946456867ecf4807fb0f32dd95e245bbcd65ba98b7a86f363296ddc"}}