{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SFEXFND4KAAA5ZNVK3FRRHLOM6","short_pith_number":"pith:SFEXFND4","schema_version":"1.0","canonical_sha256":"914972b47c50000ee5b556cb189d6e67b358aa4d0a887d875adca630d47f0d16","source":{"kind":"arxiv","id":"1509.00279","version":1},"attestation_state":"computed","paper":{"title":"Information Sets of Multiplicity Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Augot (GRACE), Fran\\c{c}oise Levy-Dit-Vehel (ENSTA ParisTech UMA), Man Cuong Ng\\^o (GRACE)","submitted_at":"2015-09-01T13:27:41Z","abstract_excerpt":"We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kop-party. We properly define information sets for these codes and give detailed proofs of the validity of Kopparty's construction, that use generating functions. We also give a complexity estimate of the associated encoding algorithm."},"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":"1509.00279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:27:41Z","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"title_canon_sha256":"3ea50e3ec77732b2468ca51f4e45fa4c071f3462a5d3b142cb591742f006bf34","abstract_canon_sha256":"d00bb4abf4e2ac8e3ee2189a5f9f5c017fcafcc3434c3f3b28caa62b67d546b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.558693Z","signature_b64":"ZNLmEHzPBWY400oZA8ZuOVf5GdVYZTJ6wdmQ0JeLMWCld2r0M7quVTCcb0iioKUR8CMgs9nxgU8WZU5cjT8CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914972b47c50000ee5b556cb189d6e67b358aa4d0a887d875adca630d47f0d16","last_reissued_at":"2026-05-18T01:34:14.557925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.557925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Sets of Multiplicity Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Augot (GRACE), Fran\\c{c}oise Levy-Dit-Vehel (ENSTA ParisTech UMA), Man Cuong Ng\\^o (GRACE)","submitted_at":"2015-09-01T13:27:41Z","abstract_excerpt":"We here provide a method for systematic encoding of the Multiplicity codes introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built on an idea of Kop-party. We properly define information sets for these codes and give detailed proofs of the validity of Kopparty's construction, that use generating functions. We also give a complexity estimate of the associated encoding algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00279","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":"1509.00279","created_at":"2026-05-18T01:34:14.558054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00279v1","created_at":"2026-05-18T01:34:14.558054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00279","created_at":"2026-05-18T01:34:14.558054+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFEXFND4KAAA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFEXFND4KAAA5ZNV","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFEXFND4","created_at":"2026-05-18T12:29:39.896362+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/SFEXFND4KAAA5ZNVK3FRRHLOM6","json":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6.json","graph_json":"https://pith.science/api/pith-number/SFEXFND4KAAA5ZNVK3FRRHLOM6/graph.json","events_json":"https://pith.science/api/pith-number/SFEXFND4KAAA5ZNVK3FRRHLOM6/events.json","paper":"https://pith.science/paper/SFEXFND4"},"agent_actions":{"view_html":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6","download_json":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6.json","view_paper":"https://pith.science/paper/SFEXFND4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00279&json=true","fetch_graph":"https://pith.science/api/pith-number/SFEXFND4KAAA5ZNVK3FRRHLOM6/graph.json","fetch_events":"https://pith.science/api/pith-number/SFEXFND4KAAA5ZNVK3FRRHLOM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6/action/storage_attestation","attest_author":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6/action/author_attestation","sign_citation":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6/action/citation_signature","submit_replication":"https://pith.science/pith/SFEXFND4KAAA5ZNVK3FRRHLOM6/action/replication_record"}},"created_at":"2026-05-18T01:34:14.558054+00:00","updated_at":"2026-05-18T01:34:14.558054+00:00"}