{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TWUZKSSDPJRYGDIA2GZNI7JXIM","short_pith_number":"pith:TWUZKSSD","schema_version":"1.0","canonical_sha256":"9da9954a437a63830d00d1b2d47d37430a4187190317f43a8302c6376b9cc49b","source":{"kind":"arxiv","id":"1302.4609","version":1},"attestation_state":"computed","paper":{"title":"Optimal information rate of secret sharing schemes on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"G. Tardos, L. Csirmaz","submitted_at":"2013-02-19T13:53:52Z","abstract_excerpt":"The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is 1/(2-1/c), where c is the size of the largest core of the tree. A subset of the vertices of a tree is a core if it induces a connected subgraph and for each vertex in the subset one finds a neighbor outside the subset. Our result follows from a lower and an upper bound on the information rate that applies for any graph and happen to coincide for trees because of a correspondence between the size of the largest core and "},"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":"1302.4609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-02-19T13:53:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"939d3628c36fb8cf71b9d50feee95d609b48ca69e62725140fec1a4c7072c61e","abstract_canon_sha256":"95b0ed36f73b5d0b168c839c5ed03ec021c143fc1aedd7be4ef29f6632eb9150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:12.748157Z","signature_b64":"WNMhw84UKNgfMpm4kJCJWFxxSeWjdDCIJKfYlml7DrZSH3NIRTUNdC1ThycDxNnEaddEM9NPtXjWmo/+o+26Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da9954a437a63830d00d1b2d47d37430a4187190317f43a8302c6376b9cc49b","last_reissued_at":"2026-05-18T03:33:12.747354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:12.747354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal information rate of secret sharing schemes on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"G. Tardos, L. Csirmaz","submitted_at":"2013-02-19T13:53:52Z","abstract_excerpt":"The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is 1/(2-1/c), where c is the size of the largest core of the tree. A subset of the vertices of a tree is a core if it induces a connected subgraph and for each vertex in the subset one finds a neighbor outside the subset. Our result follows from a lower and an upper bound on the information rate that applies for any graph and happen to coincide for trees because of a correspondence between the size of the largest core and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4609","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.4609","created_at":"2026-05-18T03:33:12.747487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4609v1","created_at":"2026-05-18T03:33:12.747487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4609","created_at":"2026-05-18T03:33:12.747487+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWUZKSSDPJRY","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWUZKSSDPJRYGDIA","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWUZKSSD","created_at":"2026-05-18T12:28:02.375192+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/TWUZKSSDPJRYGDIA2GZNI7JXIM","json":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM.json","graph_json":"https://pith.science/api/pith-number/TWUZKSSDPJRYGDIA2GZNI7JXIM/graph.json","events_json":"https://pith.science/api/pith-number/TWUZKSSDPJRYGDIA2GZNI7JXIM/events.json","paper":"https://pith.science/paper/TWUZKSSD"},"agent_actions":{"view_html":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM","download_json":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM.json","view_paper":"https://pith.science/paper/TWUZKSSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4609&json=true","fetch_graph":"https://pith.science/api/pith-number/TWUZKSSDPJRYGDIA2GZNI7JXIM/graph.json","fetch_events":"https://pith.science/api/pith-number/TWUZKSSDPJRYGDIA2GZNI7JXIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM/action/storage_attestation","attest_author":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM/action/author_attestation","sign_citation":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM/action/citation_signature","submit_replication":"https://pith.science/pith/TWUZKSSDPJRYGDIA2GZNI7JXIM/action/replication_record"}},"created_at":"2026-05-18T03:33:12.747487+00:00","updated_at":"2026-05-18T03:33:12.747487+00:00"}