{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DU4DMHJKMDIFG2RDNRYDPXBLBI","short_pith_number":"pith:DU4DMHJK","schema_version":"1.0","canonical_sha256":"1d38361d2a60d0536a236c7037dc2b0a10d9b0ced2b83b8995fdf49ba728fad3","source":{"kind":"arxiv","id":"1101.1803","version":1},"attestation_state":"computed","paper":{"title":"Information sets from defining sets in abelian codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jos\\'e Joaqu\\'in Bernal, Juan Jacobo Sim\\'on","submitted_at":"2011-01-10T13:16:02Z","abstract_excerpt":"We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in \\cite{Imai} in the case of binary TDC codes."},"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":"1101.1803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-10T13:16:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"111714a0efb4f21b2a51e77f2ed269df73d3da4a324d566dd877e386d776e6f1","abstract_canon_sha256":"8de246d5a058ea51dea3eb6dfe1550678c1239cbb859fd98fa3beb15c3eed357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:59.394500Z","signature_b64":"tQZ3nlyTFveJdfAuKrozIkfuxNbXmHH3NBD/UbwJB4XErCGCirRafnReXtNx+df2lrbWw2D+LPf0isCV30YJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d38361d2a60d0536a236c7037dc2b0a10d9b0ced2b83b8995fdf49ba728fad3","last_reissued_at":"2026-05-18T02:22:59.393904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:59.393904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information sets from defining sets in abelian codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jos\\'e Joaqu\\'in Bernal, Juan Jacobo Sim\\'on","submitted_at":"2011-01-10T13:16:02Z","abstract_excerpt":"We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in \\cite{Imai} in the case of binary TDC codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1803","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":"1101.1803","created_at":"2026-05-18T02:22:59.393986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1803v1","created_at":"2026-05-18T02:22:59.393986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1803","created_at":"2026-05-18T02:22:59.393986+00:00"},{"alias_kind":"pith_short_12","alias_value":"DU4DMHJKMDIF","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DU4DMHJKMDIFG2RD","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DU4DMHJK","created_at":"2026-05-18T12:26:26.731475+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/DU4DMHJKMDIFG2RDNRYDPXBLBI","json":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI.json","graph_json":"https://pith.science/api/pith-number/DU4DMHJKMDIFG2RDNRYDPXBLBI/graph.json","events_json":"https://pith.science/api/pith-number/DU4DMHJKMDIFG2RDNRYDPXBLBI/events.json","paper":"https://pith.science/paper/DU4DMHJK"},"agent_actions":{"view_html":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI","download_json":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI.json","view_paper":"https://pith.science/paper/DU4DMHJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1803&json=true","fetch_graph":"https://pith.science/api/pith-number/DU4DMHJKMDIFG2RDNRYDPXBLBI/graph.json","fetch_events":"https://pith.science/api/pith-number/DU4DMHJKMDIFG2RDNRYDPXBLBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI/action/storage_attestation","attest_author":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI/action/author_attestation","sign_citation":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI/action/citation_signature","submit_replication":"https://pith.science/pith/DU4DMHJKMDIFG2RDNRYDPXBLBI/action/replication_record"}},"created_at":"2026-05-18T02:22:59.393986+00:00","updated_at":"2026-05-18T02:22:59.393986+00:00"}