{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C4IYVEAPEUMLK4HWUMCCC255CB","short_pith_number":"pith:C4IYVEAP","schema_version":"1.0","canonical_sha256":"17118a900f2518b570f6a304216bbd10575aa4507cead41c7184a04c73abed51","source":{"kind":"arxiv","id":"1310.6817","version":1},"attestation_state":"computed","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'"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.6817","created_at":"2026-05-18T03:08:57.464483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6817v1","created_at":"2026-05-18T03:08:57.464483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6817","created_at":"2026-05-18T03:08:57.464483+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4IYVEAPEUML","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4IYVEAPEUMLK4HW","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4IYVEAP","created_at":"2026-05-18T12:27:40.988391+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/C4IYVEAPEUMLK4HWUMCCC255CB","json":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB.json","graph_json":"https://pith.science/api/pith-number/C4IYVEAPEUMLK4HWUMCCC255CB/graph.json","events_json":"https://pith.science/api/pith-number/C4IYVEAPEUMLK4HWUMCCC255CB/events.json","paper":"https://pith.science/paper/C4IYVEAP"},"agent_actions":{"view_html":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB","download_json":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB.json","view_paper":"https://pith.science/paper/C4IYVEAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6817&json=true","fetch_graph":"https://pith.science/api/pith-number/C4IYVEAPEUMLK4HWUMCCC255CB/graph.json","fetch_events":"https://pith.science/api/pith-number/C4IYVEAPEUMLK4HWUMCCC255CB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/action/storage_attestation","attest_author":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/action/author_attestation","sign_citation":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/action/citation_signature","submit_replication":"https://pith.science/pith/C4IYVEAPEUMLK4HWUMCCC255CB/action/replication_record"}},"created_at":"2026-05-18T03:08:57.464483+00:00","updated_at":"2026-05-18T03:08:57.464483+00:00"}