{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZAMI46ERB4Y3FLYQWNVRV7RACL","short_pith_number":"pith:ZAMI46ER","schema_version":"1.0","canonical_sha256":"c8188e78910f31b2af10b36b1afe2012c8c0003793fd06c9580f5003ab2a617b","source":{"kind":"arxiv","id":"1702.06612","version":1},"attestation_state":"computed","paper":{"title":"Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson, Ian Goldberg, Navid Nasr Esfahani","submitted_at":"2017-02-21T22:57:04Z","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 "},"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":"1702.06612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T22:57:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a27ad644df6e0596cc8bfcfe8cf220e177d69a22fede1621a7d06ec326949597","abstract_canon_sha256":"9701e368560600f8f1218786172f4c2cdec8a5cb39411a99f6eccf68f5a38ba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.147252Z","signature_b64":"lkFjpoNhoorprIEJs0YJG/HtDFv4d4Q5fkVxJcBSx0Kh+4XqwFa5nbmjHe9/mmUr/cjb1JdYjSMDJyU5HGO7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8188e78910f31b2af10b36b1afe2012c8c0003793fd06c9580f5003ab2a617b","last_reissued_at":"2026-05-18T00:50:13.146820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.146820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Douglas R. Stinson, Ian Goldberg, Navid Nasr Esfahani","submitted_at":"2017-02-21T22:57:04Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06612","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":"1702.06612","created_at":"2026-05-18T00:50:13.146887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06612v1","created_at":"2026-05-18T00:50:13.146887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06612","created_at":"2026-05-18T00:50:13.146887+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAMI46ERB4Y3","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAMI46ERB4Y3FLYQ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAMI46ER","created_at":"2026-05-18T12:31:59.375834+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/ZAMI46ERB4Y3FLYQWNVRV7RACL","json":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL.json","graph_json":"https://pith.science/api/pith-number/ZAMI46ERB4Y3FLYQWNVRV7RACL/graph.json","events_json":"https://pith.science/api/pith-number/ZAMI46ERB4Y3FLYQWNVRV7RACL/events.json","paper":"https://pith.science/paper/ZAMI46ER"},"agent_actions":{"view_html":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL","download_json":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL.json","view_paper":"https://pith.science/paper/ZAMI46ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06612&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAMI46ERB4Y3FLYQWNVRV7RACL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAMI46ERB4Y3FLYQWNVRV7RACL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL/action/storage_attestation","attest_author":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL/action/author_attestation","sign_citation":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL/action/citation_signature","submit_replication":"https://pith.science/pith/ZAMI46ERB4Y3FLYQWNVRV7RACL/action/replication_record"}},"created_at":"2026-05-18T00:50:13.146887+00:00","updated_at":"2026-05-18T00:50:13.146887+00:00"}