{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ACNWWOELQN6ZH7WY7BKNEBTR7P","short_pith_number":"pith:ACNWWOEL","canonical_record":{"source":{"id":"1312.2163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-08T01:51:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7a6edad56f08d7f8eadb2f8294095eccc9eef79619602e6bd8737e62806be33","abstract_canon_sha256":"395c83a923aac9e5f20605e2481b7e31768d8e7028db850fde8eadbe2aaededa"},"schema_version":"1.0"},"canonical_sha256":"009b6b388b837d93fed8f854d20671fbcdf0913de935fce3095b06282ff23958","source":{"kind":"arxiv","id":"1312.2163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2163","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2163v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2163","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"ACNWWOELQN6Z","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACNWWOELQN6ZH7WY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACNWWOEL","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ACNWWOELQN6ZH7WY7BKNEBTR7P","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-08T01:51:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7a6edad56f08d7f8eadb2f8294095eccc9eef79619602e6bd8737e62806be33","abstract_canon_sha256":"395c83a923aac9e5f20605e2481b7e31768d8e7028db850fde8eadbe2aaededa"},"schema_version":"1.0"},"canonical_sha256":"009b6b388b837d93fed8f854d20671fbcdf0913de935fce3095b06282ff23958","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:17.090433Z","signature_b64":"I3Vpg3HZDkp0JGAxxmiESdlEqmgMzsAYotoKjpmHdncWawsfJI95lv0naRcbzzJHIQgNmW9JfpZHPIq3Q+d0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009b6b388b837d93fed8f854d20671fbcdf0913de935fce3095b06282ff23958","last_reissued_at":"2026-05-18T03:05:17.090006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:17.090006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2163","source_version":1,"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-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/TQN+ptuUMNyPhgkmNbK2OfgCoru8y6bA2q9XstAA1CrQCQ3hj6xCpgkIGoKeChOmmwkSJdZti1kJr0m1AxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:31:29.832782Z"},"content_sha256":"e18f93d3143202c7792686f37c8124846b1de9bade711146da2764eebcf11f9b","schema_version":"1.0","event_id":"sha256:e18f93d3143202c7792686f37c8124846b1de9bade711146da2764eebcf11f9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ACNWWOELQN6ZH7WY7BKNEBTR7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multipermutation Codes in the Ulam Metric for Nonvolatile Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","submitted_at":"2013-12-08T01:51:09Z","abstract_excerpt":"We address the problem of multipermutation code design in the Ulam metric for novel storage applications. Multipermutation codes are suitable for flash memory where cell charges may share the same rank. Changes in the charges of cells manifest themselves as errors whose effects on the retrieved signal may be measured via the Ulam distance. As part of our analysis, we study multipermutation codes in the Hamming metric, known as constant composition codes. We then present bounds on the size of multipermutation codes and their capacity, for both the Ulam and the Hamming metrics. Finally, we prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2163","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"},"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-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EtgdEKGB3jgd9Pa2YuSbrjuyIlW98ynqdJQfZ6ADDOl4WOzYqUlT3zAdbs46W3Qs4HFrOkYlGIiqLsOYS6TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:31:29.833472Z"},"content_sha256":"1555875b04d0859fb6b83b1a23e3e0159ff79d2f60bd69b73bf6d76bce6460eb","schema_version":"1.0","event_id":"sha256:1555875b04d0859fb6b83b1a23e3e0159ff79d2f60bd69b73bf6d76bce6460eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/bundle.json","state_url":"https://pith.science/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/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-05-31T21:31:29Z","links":{"resolver":"https://pith.science/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P","bundle":"https://pith.science/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/bundle.json","state":"https://pith.science/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACNWWOELQN6ZH7WY7BKNEBTR7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ACNWWOELQN6ZH7WY7BKNEBTR7P","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":"395c83a923aac9e5f20605e2481b7e31768d8e7028db850fde8eadbe2aaededa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-08T01:51:09Z","title_canon_sha256":"a7a6edad56f08d7f8eadb2f8294095eccc9eef79619602e6bd8737e62806be33"},"schema_version":"1.0","source":{"id":"1312.2163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2163","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2163v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2163","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"ACNWWOELQN6Z","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACNWWOELQN6ZH7WY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACNWWOEL","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:1555875b04d0859fb6b83b1a23e3e0159ff79d2f60bd69b73bf6d76bce6460eb","target":"graph","created_at":"2026-05-18T03:05:17Z","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 address the problem of multipermutation code design in the Ulam metric for novel storage applications. Multipermutation codes are suitable for flash memory where cell charges may share the same rank. Changes in the charges of cells manifest themselves as errors whose effects on the retrieved signal may be measured via the Ulam distance. As part of our analysis, we study multipermutation codes in the Hamming metric, known as constant composition codes. We then present bounds on the size of multipermutation codes and their capacity, for both the Ulam and the Hamming metrics. Finally, we prese","authors_text":"Farzad Farnoud (Hassanzadeh), Olgica Milenkovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-08T01:51:09Z","title":"Multipermutation Codes in the Ulam Metric for Nonvolatile Memories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2163","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:e18f93d3143202c7792686f37c8124846b1de9bade711146da2764eebcf11f9b","target":"record","created_at":"2026-05-18T03:05:17Z","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":"395c83a923aac9e5f20605e2481b7e31768d8e7028db850fde8eadbe2aaededa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-08T01:51:09Z","title_canon_sha256":"a7a6edad56f08d7f8eadb2f8294095eccc9eef79619602e6bd8737e62806be33"},"schema_version":"1.0","source":{"id":"1312.2163","kind":"arxiv","version":1}},"canonical_sha256":"009b6b388b837d93fed8f854d20671fbcdf0913de935fce3095b06282ff23958","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009b6b388b837d93fed8f854d20671fbcdf0913de935fce3095b06282ff23958","first_computed_at":"2026-05-18T03:05:17.090006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:17.090006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3Vpg3HZDkp0JGAxxmiESdlEqmgMzsAYotoKjpmHdncWawsfJI95lv0naRcbzzJHIQgNmW9JfpZHPIq3Q+d0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:17.090433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e18f93d3143202c7792686f37c8124846b1de9bade711146da2764eebcf11f9b","sha256:1555875b04d0859fb6b83b1a23e3e0159ff79d2f60bd69b73bf6d76bce6460eb"],"state_sha256":"31fb24afd1c76a2b9b5d7c3ce60144baa35bed2480b60ab2019993646094b784"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApXJ23hgWZ7RWwMvhl7pDCrPToSAtcWoncp3ZeEM1pFFIg+Q7CC6KN8zGhZ1UZFbDE7N3eSnCIxNS1l7YzkpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:31:29.836897Z","bundle_sha256":"49dacca7f3468ceb53ae1d11aa0f66895fe1845b953be38e244e36b5e6981481"}}