{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5ZF4GPESZZE6URM5RQDVTJWG2T","short_pith_number":"pith:5ZF4GPES","canonical_record":{"source":{"id":"1510.03655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T13:03:50Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"9bb73bb0380692e77a74544400212259d6e5db3a029d333015543ed83d0957fe","abstract_canon_sha256":"4088dff72321cf9db4132d601dfd756b163724ca174269a0aa789f4819d69a43"},"schema_version":"1.0"},"canonical_sha256":"ee4bc33c92ce49ea459d8c0759a6c6d4c6c4af8b0bdfda60761668543ca05081","source":{"kind":"arxiv","id":"1510.03655","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03655","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03655v2","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03655","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"5ZF4GPESZZE6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZF4GPESZZE6URM5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZF4GPES","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5ZF4GPESZZE6URM5RQDVTJWG2T","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T13:03:50Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"9bb73bb0380692e77a74544400212259d6e5db3a029d333015543ed83d0957fe","abstract_canon_sha256":"4088dff72321cf9db4132d601dfd756b163724ca174269a0aa789f4819d69a43"},"schema_version":"1.0"},"canonical_sha256":"ee4bc33c92ce49ea459d8c0759a6c6d4c6c4af8b0bdfda60761668543ca05081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.646254Z","signature_b64":"kXg1QRoUoIpVHEHciKBFOkMZ5O5zHWtPgy0YcQsXvBp7QLW7Y7HJsiZsRsxaEzFdkDKb528cw3+7Wg9D5BTBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee4bc33c92ce49ea459d8c0759a6c6d4c6c4af8b0bdfda60761668543ca05081","last_reissued_at":"2026-05-18T01:30:07.645663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.645663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03655","source_version":2,"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-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl1A8qt5Lc1/z7SB/LIWu0cLNUYnHQaQ+sCbYS2B8Y162BmofrFATuHbhXIAqcGhOgjWWiWrscZO0A0H5KiyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:40:37.471366Z"},"content_sha256":"7f1186a1897952cfb727a5324941b136e5b202aa3bd6f1ac2904417c93c5dd55","schema_version":"1.0","event_id":"sha256:7f1186a1897952cfb727a5324941b136e5b202aa3bd6f1ac2904417c93c5dd55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5ZF4GPESZZE6URM5RQDVTJWG2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"All or Nothing at All","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson, Navid Nasr Esfahani, Paolo D'Arco","submitted_at":"2015-10-13T13:03:50Z","abstract_excerpt":"We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \\cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s-t outputs are known. Previous work concerned the case t=1; here we consider the problem for general t, focussing on the case t=2. We investigate constructions of binary matrices for which the desired properties hold with the maximum probability. Upper bounds on these probabilities are obtained via a quadratic programming approach, while lower bounds can be obtained from combinatori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03655","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"},"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-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6ukrsZOUOGWzEQgBSQE715JdwLCnSL7JgMXoFsNhDeGqoclaGt7xXqm8cj5H3f3qagzJCxg/c+oZOv0NrB9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:40:37.472111Z"},"content_sha256":"689a7224ea5cc149d87f68b53d01d5b084a273d7dbeef601bca9afdd5b521958","schema_version":"1.0","event_id":"sha256:689a7224ea5cc149d87f68b53d01d5b084a273d7dbeef601bca9afdd5b521958"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/bundle.json","state_url":"https://pith.science/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/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-08T19:40:37Z","links":{"resolver":"https://pith.science/pith/5ZF4GPESZZE6URM5RQDVTJWG2T","bundle":"https://pith.science/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/bundle.json","state":"https://pith.science/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZF4GPESZZE6URM5RQDVTJWG2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5ZF4GPESZZE6URM5RQDVTJWG2T","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":"4088dff72321cf9db4132d601dfd756b163724ca174269a0aa789f4819d69a43","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T13:03:50Z","title_canon_sha256":"9bb73bb0380692e77a74544400212259d6e5db3a029d333015543ed83d0957fe"},"schema_version":"1.0","source":{"id":"1510.03655","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03655","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03655v2","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03655","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"5ZF4GPESZZE6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZF4GPESZZE6URM5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZF4GPES","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:689a7224ea5cc149d87f68b53d01d5b084a273d7dbeef601bca9afdd5b521958","target":"graph","created_at":"2026-05-18T01:30:07Z","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 continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \\cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s-t outputs are known. Previous work concerned the case t=1; here we consider the problem for general t, focussing on the case t=2. We investigate constructions of binary matrices for which the desired properties hold with the maximum probability. Upper bounds on these probabilities are obtained via a quadratic programming approach, while lower bounds can be obtained from combinatori","authors_text":"Douglas R. Stinson, Navid Nasr Esfahani, Paolo D'Arco","cross_cats":["cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T13:03:50Z","title":"All or Nothing at All"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03655","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:7f1186a1897952cfb727a5324941b136e5b202aa3bd6f1ac2904417c93c5dd55","target":"record","created_at":"2026-05-18T01:30:07Z","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":"4088dff72321cf9db4132d601dfd756b163724ca174269a0aa789f4819d69a43","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T13:03:50Z","title_canon_sha256":"9bb73bb0380692e77a74544400212259d6e5db3a029d333015543ed83d0957fe"},"schema_version":"1.0","source":{"id":"1510.03655","kind":"arxiv","version":2}},"canonical_sha256":"ee4bc33c92ce49ea459d8c0759a6c6d4c6c4af8b0bdfda60761668543ca05081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee4bc33c92ce49ea459d8c0759a6c6d4c6c4af8b0bdfda60761668543ca05081","first_computed_at":"2026-05-18T01:30:07.645663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:07.645663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXg1QRoUoIpVHEHciKBFOkMZ5O5zHWtPgy0YcQsXvBp7QLW7Y7HJsiZsRsxaEzFdkDKb528cw3+7Wg9D5BTBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:07.646254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03655","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f1186a1897952cfb727a5324941b136e5b202aa3bd6f1ac2904417c93c5dd55","sha256:689a7224ea5cc149d87f68b53d01d5b084a273d7dbeef601bca9afdd5b521958"],"state_sha256":"79e552382a8b6aa15f14354b2a65da217f1736b9ba2f5529945f088333b97e94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4G5aLvOY/sZaH6IBGN6kpYZq7uujxUsD69SgsW1PMT3CxT3vNytyAfBDrKzRGUjpJDI8HRzRoDiAd7eNuefCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:40:37.476506Z","bundle_sha256":"87d01f050dabc445030b2aee4eaf5c03e3826fb455ec390e538a07665ea4ff40"}}