{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C4IYVEAPEUMLK4HWUMCCC255CB","short_pith_number":"pith:C4IYVEAP","canonical_record":{"source":{"id":"1310.6817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-25T04:41:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"546c4a9aa046c5e3c9130c62c767d328a748002f7189d6eda91326fe3476a6ec","abstract_canon_sha256":"edf5e089fe3a3255f34d1344d4fbef837526843a9ea242e9381ae2a7dd9cc533"},"schema_version":"1.0"},"canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","source":{"kind":"arxiv","id":"1310.6817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6817","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6817v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6817","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"C4IYVEAPEUML","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C4IYVEAPEUMLK4HW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C4IYVEAP","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C4IYVEAPEUMLK4HWUMCCC255CB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-25T04:41:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"546c4a9aa046c5e3c9130c62c767d328a748002f7189d6eda91326fe3476a6ec","abstract_canon_sha256":"edf5e089fe3a3255f34d1344d4fbef837526843a9ea242e9381ae2a7dd9cc533"},"schema_version":"1.0"},"canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:57.465137Z","signature_b64":"qONLF8UNSfy6zi1fp+yOvaCHJRjvxBQjuqHN+y+avNBsKnE8av3QZ/vnjKGiovVqQRgbpcFw6lamDl3xTyqEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","last_reissued_at":"2026-05-18T03:08:57.464374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:57.464374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6817","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:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6wQRaIACMLHu0rHeXuZ+ZlRZlwKbB1TXOOdax49MIxXNEtfUPftXB9gkdJVEDrGJ6xtLLHDbxyaFLTHGQGqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:55:00.093168Z"},"content_sha256":"2379811a5f0f42650db6541fc3927475d94f81aa486f873429c3a17189bb3993","schema_version":"1.0","event_id":"sha256:2379811a5f0f42650db6541fc3927475d94f81aa486f873429c3a17189bb3993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C4IYVEAPEUMLK4HWUMCCC255CB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Systematic Error-Correcting Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao Jiang, Hongchao Zhou, Jehoshua Bruck, Moshe Schwartz","submitted_at":"2013-10-25T04:41:28Z","abstract_excerpt":"The rank-modulation scheme has been recently proposed for efficiently storing data in nonvolatile memories. Error-correcting codes are essential for rank modulation, however, existing results have been limited. In this work we explore a new approach, \\emph{systematic error-correcting codes for rank modulation}. Systematic codes have the benefits of enabling efficient information retrieval and potentially supporting more efficient encoding and decoding procedures. We study systematic codes for rank modulation under Kendall's $\\tau$-metric as well as under the $\\ell_\\infty$-metric.\n  In Kendall'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6817","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:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyehx4X8R5r+LbrUhSMb/aoj04kRRPvF2H8KdtoUWx/n5o2SDIvNrf003wb7yJcMCZ9cY2xh/UM5uXI6H3SiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:55:00.093529Z"},"content_sha256":"b62cbf36e7bdbbe29e9837a4e1695b79bcc109dca0c734a0ac67c340c2ab71ca","schema_version":"1.0","event_id":"sha256:b62cbf36e7bdbbe29e9837a4e1695b79bcc109dca0c734a0ac67c340c2ab71ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/bundle.json","state_url":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4IYVEAPEUMLK4HWUMCCC255CB/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-22T12:55:00Z","links":{"resolver":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB","bundle":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/bundle.json","state":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4IYVEAPEUMLK4HWUMCCC255CB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C4IYVEAPEUMLK4HWUMCCC255CB","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":"edf5e089fe3a3255f34d1344d4fbef837526843a9ea242e9381ae2a7dd9cc533","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-25T04:41:28Z","title_canon_sha256":"546c4a9aa046c5e3c9130c62c767d328a748002f7189d6eda91326fe3476a6ec"},"schema_version":"1.0","source":{"id":"1310.6817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6817","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6817v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6817","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"C4IYVEAPEUML","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C4IYVEAPEUMLK4HW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C4IYVEAP","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:b62cbf36e7bdbbe29e9837a4e1695b79bcc109dca0c734a0ac67c340c2ab71ca","target":"graph","created_at":"2026-05-18T03:08:57Z","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":"The rank-modulation scheme has been recently proposed for efficiently storing data in nonvolatile memories. Error-correcting codes are essential for rank modulation, however, existing results have been limited. In this work we explore a new approach, \\emph{systematic error-correcting codes for rank modulation}. Systematic codes have the benefits of enabling efficient information retrieval and potentially supporting more efficient encoding and decoding procedures. We study systematic codes for rank modulation under Kendall's $\\tau$-metric as well as under the $\\ell_\\infty$-metric.\n  In Kendall'","authors_text":"Anxiao Jiang, Hongchao Zhou, Jehoshua Bruck, Moshe Schwartz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-25T04:41:28Z","title":"Systematic Error-Correcting Codes for Rank Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6817","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:2379811a5f0f42650db6541fc3927475d94f81aa486f873429c3a17189bb3993","target":"record","created_at":"2026-05-18T03:08:57Z","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":"edf5e089fe3a3255f34d1344d4fbef837526843a9ea242e9381ae2a7dd9cc533","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-25T04:41:28Z","title_canon_sha256":"546c4a9aa046c5e3c9130c62c767d328a748002f7189d6eda91326fe3476a6ec"},"schema_version":"1.0","source":{"id":"1310.6817","kind":"arxiv","version":1}},"canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","first_computed_at":"2026-05-18T03:08:57.464374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:57.464374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qONLF8UNSfy6zi1fp+yOvaCHJRjvxBQjuqHN+y+avNBsKnE8av3QZ/vnjKGiovVqQRgbpcFw6lamDl3xTyqEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:57.465137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2379811a5f0f42650db6541fc3927475d94f81aa486f873429c3a17189bb3993","sha256:b62cbf36e7bdbbe29e9837a4e1695b79bcc109dca0c734a0ac67c340c2ab71ca"],"state_sha256":"dda209c04c5fdad22dc3823dd53933543bf4b0f38065a916f91d21babf5a86e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWImRNld5Bb9M7pSdXuaaLAfnHvkSX9OUcdlK0LH59ViVko2meY2rIJeQPgfA6RY9vU2hCxfFvKarRpsdq/CAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:55:00.095326Z","bundle_sha256":"4cfef0c87433507d30382be81ba24a95deeb1f500292f6c5888153817ced4f65"}}