{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:45462T4NKYTFCBIGH7IKDFEVUU","short_pith_number":"pith:45462T4N","canonical_record":{"source":{"id":"2502.05858","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T11:34:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edd31a68d9c0f6060196b33ae059ec72c31490667944bc9416b8ca0cdbce2bd7","abstract_canon_sha256":"3a690f59360aa2df4a654d0234409cdeb89521093278c9a0b32e0925435ec955"},"schema_version":"1.0"},"canonical_sha256":"e779ed4f8d56265105063fd0a19495a53b47712157efb40b2ba9c7125b1720d5","source":{"kind":"arxiv","id":"2502.05858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05858","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05858v2","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05858","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"45462T4NKYTF","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"45462T4NKYTFCBIG","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"45462T4N","created_at":"2026-07-05T11:00:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:45462T4NKYTFCBIGH7IKDFEVUU","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05858","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T11:34:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edd31a68d9c0f6060196b33ae059ec72c31490667944bc9416b8ca0cdbce2bd7","abstract_canon_sha256":"3a690f59360aa2df4a654d0234409cdeb89521093278c9a0b32e0925435ec955"},"schema_version":"1.0"},"canonical_sha256":"e779ed4f8d56265105063fd0a19495a53b47712157efb40b2ba9c7125b1720d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:25.922747Z","signature_b64":"TgaV58S9ndYK2grJPl3KmoirdN+FMUqpwwq2RkneB1G0eHPIGe54rncO4sQ+axsGRaPxKDqb2Ri9sCpTAPWYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e779ed4f8d56265105063fd0a19495a53b47712157efb40b2ba9c7125b1720d5","last_reissued_at":"2026-07-05T11:00:25.922159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:25.922159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05858","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-07-05T11:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjUA9SF6jdHNd8EIA6FOk6OSgPv5fFjrYZUpdbVC8YFRhs7LxQe93wVz4sgZjjI+SAisnoNShPm8PhmxTp94CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:11:53.872708Z"},"content_sha256":"c146438abba2633bd60961803551e1bf028ac1eb376a906370fdca7cde68c2c5","schema_version":"1.0","event_id":"sha256:c146438abba2633bd60961803551e1bf028ac1eb376a906370fdca7cde68c2c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:45462T4NKYTFCBIGH7IKDFEVUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan Mosheiff, Sergey Komech","submitted_at":"2025-02-09T11:34:54Z","abstract_excerpt":"We introduce alphabet-permutation (AP) codes, a new family of error-correcting codes defined by iteratively applying random coordinate-wise permutations to a fixed initial word. A special case recovers random additive codes and random binary linear codes, where each permutation corresponds to an additive shift over a finite field.\n  We show that when these permutations are drawn from a suitably ``mixing'' distribution, the resulting code is almost surely list-recoverable with list size proportional to the inverse of the gap to capacity. Compared to any linear code, our construction achieves ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05858","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05858/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zH8jQ6aGhyBagcNyGgCfkkc8/Et1MwLsOEzi9e5NNiXfGJXWIvjE5tHfCUf9GS3ci6QyZkXd6eLcDNRko9CBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:11:53.873297Z"},"content_sha256":"7f6120551f1e9dddb9c8cd4b3d23c5312a0e4dc74e8af2117412aa13cbf062e1","schema_version":"1.0","event_id":"sha256:7f6120551f1e9dddb9c8cd4b3d23c5312a0e4dc74e8af2117412aa13cbf062e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45462T4NKYTFCBIGH7IKDFEVUU/bundle.json","state_url":"https://pith.science/pith/45462T4NKYTFCBIGH7IKDFEVUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45462T4NKYTFCBIGH7IKDFEVUU/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-08-14T16:11:53Z","links":{"resolver":"https://pith.science/pith/45462T4NKYTFCBIGH7IKDFEVUU","bundle":"https://pith.science/pith/45462T4NKYTFCBIGH7IKDFEVUU/bundle.json","state":"https://pith.science/pith/45462T4NKYTFCBIGH7IKDFEVUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45462T4NKYTFCBIGH7IKDFEVUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:45462T4NKYTFCBIGH7IKDFEVUU","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":"3a690f59360aa2df4a654d0234409cdeb89521093278c9a0b32e0925435ec955","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T11:34:54Z","title_canon_sha256":"edd31a68d9c0f6060196b33ae059ec72c31490667944bc9416b8ca0cdbce2bd7"},"schema_version":"1.0","source":{"id":"2502.05858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05858","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05858v2","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05858","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"45462T4NKYTF","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"45462T4NKYTFCBIG","created_at":"2026-07-05T11:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"45462T4N","created_at":"2026-07-05T11:00:25Z"}],"graph_snapshots":[{"event_id":"sha256:7f6120551f1e9dddb9c8cd4b3d23c5312a0e4dc74e8af2117412aa13cbf062e1","target":"graph","created_at":"2026-07-05T11:00:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.05858/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce alphabet-permutation (AP) codes, a new family of error-correcting codes defined by iteratively applying random coordinate-wise permutations to a fixed initial word. A special case recovers random additive codes and random binary linear codes, where each permutation corresponds to an additive shift over a finite field.\n  We show that when these permutations are drawn from a suitably ``mixing'' distribution, the resulting code is almost surely list-recoverable with list size proportional to the inverse of the gap to capacity. Compared to any linear code, our construction achieves ex","authors_text":"Jonathan Mosheiff, Sergey Komech","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05858","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:c146438abba2633bd60961803551e1bf028ac1eb376a906370fdca7cde68c2c5","target":"record","created_at":"2026-07-05T11:00:25Z","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":"3a690f59360aa2df4a654d0234409cdeb89521093278c9a0b32e0925435ec955","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T11:34:54Z","title_canon_sha256":"edd31a68d9c0f6060196b33ae059ec72c31490667944bc9416b8ca0cdbce2bd7"},"schema_version":"1.0","source":{"id":"2502.05858","kind":"arxiv","version":2}},"canonical_sha256":"e779ed4f8d56265105063fd0a19495a53b47712157efb40b2ba9c7125b1720d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e779ed4f8d56265105063fd0a19495a53b47712157efb40b2ba9c7125b1720d5","first_computed_at":"2026-07-05T11:00:25.922159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:25.922159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgaV58S9ndYK2grJPl3KmoirdN+FMUqpwwq2RkneB1G0eHPIGe54rncO4sQ+axsGRaPxKDqb2Ri9sCpTAPWYBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:25.922747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c146438abba2633bd60961803551e1bf028ac1eb376a906370fdca7cde68c2c5","sha256:7f6120551f1e9dddb9c8cd4b3d23c5312a0e4dc74e8af2117412aa13cbf062e1"],"state_sha256":"f57a3596156585b924d15fa6680cd4d356f01a09657cc5fae3b7e9d9249761df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ih/7pmCw2xhnA4RH+1IsmobxXxGbrHY+k7z5TljFA20CBRm1r3aJ+/Gzd/QSnkjKf+RWKu8RjZUmTUbJ/TT4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T16:11:53.879033Z","bundle_sha256":"5761fecbe78227316bf21959558af05f2f1f484d02652b2e4cad46a5f9157807"}}