{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UR5LLAHDWNXQXMU5UZNZK4XAV3","short_pith_number":"pith:UR5LLAHD","schema_version":"1.0","canonical_sha256":"a47ab580e3b36f0bb29da65b9572e0aecd40063f2fae7c81a38800464de33c51","source":{"kind":"arxiv","id":"2506.03805","version":1},"attestation_state":"computed","paper":{"title":"Additive codes from linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Simeon Ball, Tabriz Popatia","submitted_at":"2025-06-04T10:26:24Z","abstract_excerpt":"We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good."},"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":"2506.03805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-04T10:26:24Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"defd6c9bb86862b53bce3fb97e7fb31893947ac4f0612e9ae269fc606c41c2d4","abstract_canon_sha256":"7acd7465b7042f35d798ea39dc3a869b68231f7e33594b06853ee0ddcf095e1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:52.097069Z","signature_b64":"JlqHv1okxihFdOacUBM/E89DDt1EaUoFiSLh+q7Ppg5fTZGekyEF9xVs/zsulLGFYpsOZm/E0Y9k/JWicyWQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a47ab580e3b36f0bb29da65b9572e0aecd40063f2fae7c81a38800464de33c51","last_reissued_at":"2026-07-05T11:15:52.096654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:52.096654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Additive codes from linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Simeon Ball, Tabriz Popatia","submitted_at":"2025-06-04T10:26:24Z","abstract_excerpt":"We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03805","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03805/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.03805","created_at":"2026-07-05T11:15:52.096711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03805v1","created_at":"2026-07-05T11:15:52.096711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03805","created_at":"2026-07-05T11:15:52.096711+00:00"},{"alias_kind":"pith_short_12","alias_value":"UR5LLAHDWNXQ","created_at":"2026-07-05T11:15:52.096711+00:00"},{"alias_kind":"pith_short_16","alias_value":"UR5LLAHDWNXQXMU5","created_at":"2026-07-05T11:15:52.096711+00:00"},{"alias_kind":"pith_short_8","alias_value":"UR5LLAHD","created_at":"2026-07-05T11:15:52.096711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.16327","citing_title":"Generalized Hamming weights of additive codes and geometric counterparts","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3","json":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3.json","graph_json":"https://pith.science/api/pith-number/UR5LLAHDWNXQXMU5UZNZK4XAV3/graph.json","events_json":"https://pith.science/api/pith-number/UR5LLAHDWNXQXMU5UZNZK4XAV3/events.json","paper":"https://pith.science/paper/UR5LLAHD"},"agent_actions":{"view_html":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3","download_json":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3.json","view_paper":"https://pith.science/paper/UR5LLAHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03805&json=true","fetch_graph":"https://pith.science/api/pith-number/UR5LLAHDWNXQXMU5UZNZK4XAV3/graph.json","fetch_events":"https://pith.science/api/pith-number/UR5LLAHDWNXQXMU5UZNZK4XAV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3/action/storage_attestation","attest_author":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3/action/author_attestation","sign_citation":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3/action/citation_signature","submit_replication":"https://pith.science/pith/UR5LLAHDWNXQXMU5UZNZK4XAV3/action/replication_record"}},"created_at":"2026-07-05T11:15:52.096711+00:00","updated_at":"2026-07-05T11:15:52.096711+00:00"}