{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A6PPTHALQ36QX33BFTKZS53AFS","short_pith_number":"pith:A6PPTHAL","schema_version":"1.0","canonical_sha256":"079ef99c0b86fd0bef612cd59977602cb7c04895ed3bc00b971a0b566db6b3e5","source":{"kind":"arxiv","id":"1706.06998","version":2},"attestation_state":"computed","paper":{"title":"Secret Sharing and Shared Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes Rauh","submitted_at":"2017-06-21T16:43:25Z","abstract_excerpt":"Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, they provide perfect model systems for information decompositions. However, following this intuition too far leads to an information decomposition with negative partial information terms, which are difficul"},"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":"1706.06998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-21T16:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25b7d3707533613330f616f42b7ae178754dfdedab0cbcdb83c5878decfad139","abstract_canon_sha256":"5c050de279bedb173a149c0611fdc801dfa51d891bcedd05c6401f15dc4f8a05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:54.771858Z","signature_b64":"Dx3RAMU0lBgNLevDbcYWh6PzBArYtjHA7JQfrLn/CsSM5ICBMdY8I/eQYWI+UuWfxl6idhl4XdaD2SqbMCryAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079ef99c0b86fd0bef612cd59977602cb7c04895ed3bc00b971a0b566db6b3e5","last_reissued_at":"2026-05-18T00:30:54.771207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:54.771207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret Sharing and Shared Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes Rauh","submitted_at":"2017-06-21T16:43:25Z","abstract_excerpt":"Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, they provide perfect model systems for information decompositions. However, following this intuition too far leads to an information decomposition with negative partial information terms, which are difficul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06998","kind":"arxiv","version":2},"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":"1706.06998","created_at":"2026-05-18T00:30:54.771311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06998v2","created_at":"2026-05-18T00:30:54.771311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06998","created_at":"2026-05-18T00:30:54.771311+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6PPTHALQ36Q","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6PPTHALQ36QX33B","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6PPTHAL","created_at":"2026-05-18T12:31:05.417338+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/A6PPTHALQ36QX33BFTKZS53AFS","json":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS.json","graph_json":"https://pith.science/api/pith-number/A6PPTHALQ36QX33BFTKZS53AFS/graph.json","events_json":"https://pith.science/api/pith-number/A6PPTHALQ36QX33BFTKZS53AFS/events.json","paper":"https://pith.science/paper/A6PPTHAL"},"agent_actions":{"view_html":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS","download_json":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS.json","view_paper":"https://pith.science/paper/A6PPTHAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06998&json=true","fetch_graph":"https://pith.science/api/pith-number/A6PPTHALQ36QX33BFTKZS53AFS/graph.json","fetch_events":"https://pith.science/api/pith-number/A6PPTHALQ36QX33BFTKZS53AFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS/action/storage_attestation","attest_author":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS/action/author_attestation","sign_citation":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS/action/citation_signature","submit_replication":"https://pith.science/pith/A6PPTHALQ36QX33BFTKZS53AFS/action/replication_record"}},"created_at":"2026-05-18T00:30:54.771311+00:00","updated_at":"2026-05-18T00:30:54.771311+00:00"}