{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZAMI46ERB4Y3FLYQWNVRV7RACL","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":"9701e368560600f8f1218786172f4c2cdec8a5cb39411a99f6eccf68f5a38ba6","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T22:57:04Z","title_canon_sha256":"a27ad644df6e0596cc8bfcfe8cf220e177d69a22fede1621a7d06ec326949597"},"schema_version":"1.0","source":{"id":"1702.06612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06612","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06612v1","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06612","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZAMI46ERB4Y3","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZAMI46ERB4Y3FLYQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZAMI46ER","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:093eed4700e3a857e0f7a55f9c1884f58956c1110b2b616347396f8b0b0bf44a","target":"graph","created_at":"2026-05-18T00:50:13Z","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":"A $(t, s, v)$-all-or-nothing transform is a bijective mapping defined on $s$-tuples over an alphabet of size $v$, which satisfies the condition that the values of any $t$ input co-ordinates are completely undetermined, given only the values of any $s-t$ output co-ordinates. The main question we address in this paper is: for which choices of parameters does a $(t, s, v)$-all-or-nothing transform (AONT) exist? More specifically, if we fix $t$ and $v$, we want to determine the maximum integer $s$ such that a $(t, s, v)$-AONT exists. We mainly concentrate on the case $t=2$ for arbitrary values of ","authors_text":"Douglas R. Stinson, Ian Goldberg, Navid Nasr Esfahani","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T22:57:04Z","title":"Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06612","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:31e4554f27f4db19b41862c1c2378b9d4d6ad1edf161e437592a9f65db5c6740","target":"record","created_at":"2026-05-18T00:50:13Z","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":"9701e368560600f8f1218786172f4c2cdec8a5cb39411a99f6eccf68f5a38ba6","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T22:57:04Z","title_canon_sha256":"a27ad644df6e0596cc8bfcfe8cf220e177d69a22fede1621a7d06ec326949597"},"schema_version":"1.0","source":{"id":"1702.06612","kind":"arxiv","version":1}},"canonical_sha256":"c8188e78910f31b2af10b36b1afe2012c8c0003793fd06c9580f5003ab2a617b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8188e78910f31b2af10b36b1afe2012c8c0003793fd06c9580f5003ab2a617b","first_computed_at":"2026-05-18T00:50:13.146820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:13.146820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lkFjpoNhoorprIEJs0YJG/HtDFv4d4Q5fkVxJcBSx0Kh+4XqwFa5nbmjHe9/mmUr/cjb1JdYjSMDJyU5HGO7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:13.147252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31e4554f27f4db19b41862c1c2378b9d4d6ad1edf161e437592a9f65db5c6740","sha256:093eed4700e3a857e0f7a55f9c1884f58956c1110b2b616347396f8b0b0bf44a"],"state_sha256":"dc882132ef1ded2d6ece8c492a0540c0ec9460fd96be3d48a7fd9543d1cc9de4"}