{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O7FUED4LDAFSDK5G7EHQU7WCDC","short_pith_number":"pith:O7FUED4L","schema_version":"1.0","canonical_sha256":"77cb420f8b180b21aba6f90f0a7ec218bd28d4998ea0ad1ea1a668b26f6ad2d6","source":{"kind":"arxiv","id":"1311.7113","version":3},"attestation_state":"computed","paper":{"title":"Systematic Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Jehoshua Bruck, Sarit Buzaglo, Tuvi Etzion","submitted_at":"2013-11-27T20:28:20Z","abstract_excerpt":"The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's $\\tau$-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is based on error-correcting codes for multi-permutations and a partition of the set of permutations into error-correcting codes. For a given large enough number of information symbols $k$, and for any integer $t$, we present a construction for ${(k+r,k)}$ systematic $t$-error-correcting codes, for permutations from $S_{k+r}$, with less redundanc"},"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":"1311.7113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-27T20:28:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0a146f02d132d353022bbac662d776228ac381824de115ec734e026c7f29ce3d","abstract_canon_sha256":"b86a9d4b658dd2916b9c9eea5ee0223173243d7c6e2233c0037d5be531867818"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:53.427909Z","signature_b64":"3tJfO64vneWW8CB9/9Hk4hT2+CRVc/UsWPJ8qa8dcD94R/chR1n8h4O0vjjBra243pufBODRQk3+YMJZMIHuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77cb420f8b180b21aba6f90f0a7ec218bd28d4998ea0ad1ea1a668b26f6ad2d6","last_reissued_at":"2026-05-18T02:53:53.427085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:53.427085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Systematic Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Jehoshua Bruck, Sarit Buzaglo, Tuvi Etzion","submitted_at":"2013-11-27T20:28:20Z","abstract_excerpt":"The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's $\\tau$-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is based on error-correcting codes for multi-permutations and a partition of the set of permutations into error-correcting codes. For a given large enough number of information symbols $k$, and for any integer $t$, we present a construction for ${(k+r,k)}$ systematic $t$-error-correcting codes, for permutations from $S_{k+r}$, with less redundanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7113","kind":"arxiv","version":3},"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":"1311.7113","created_at":"2026-05-18T02:53:53.427237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7113v3","created_at":"2026-05-18T02:53:53.427237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7113","created_at":"2026-05-18T02:53:53.427237+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7FUED4LDAFS","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7FUED4LDAFSDK5G","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7FUED4L","created_at":"2026-05-18T12:27:54.935989+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/O7FUED4LDAFSDK5G7EHQU7WCDC","json":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC.json","graph_json":"https://pith.science/api/pith-number/O7FUED4LDAFSDK5G7EHQU7WCDC/graph.json","events_json":"https://pith.science/api/pith-number/O7FUED4LDAFSDK5G7EHQU7WCDC/events.json","paper":"https://pith.science/paper/O7FUED4L"},"agent_actions":{"view_html":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC","download_json":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC.json","view_paper":"https://pith.science/paper/O7FUED4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7113&json=true","fetch_graph":"https://pith.science/api/pith-number/O7FUED4LDAFSDK5G7EHQU7WCDC/graph.json","fetch_events":"https://pith.science/api/pith-number/O7FUED4LDAFSDK5G7EHQU7WCDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC/action/storage_attestation","attest_author":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC/action/author_attestation","sign_citation":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC/action/citation_signature","submit_replication":"https://pith.science/pith/O7FUED4LDAFSDK5G7EHQU7WCDC/action/replication_record"}},"created_at":"2026-05-18T02:53:53.427237+00:00","updated_at":"2026-05-18T02:53:53.427237+00:00"}