{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3U6OPXVR42Z2OKVHUWMGAHLOXE","short_pith_number":"pith:3U6OPXVR","schema_version":"1.0","canonical_sha256":"dd3ce7deb1e6b3a72aa7a598601d6eb9295b681b004e3dada49a7d63c20a46a5","source":{"kind":"arxiv","id":"1012.4134","version":3},"attestation_state":"computed","paper":{"title":"On triply even binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Koichi Betsumiya","submitted_at":"2010-12-19T00:27:50Z","abstract_excerpt":"A triply even code is a binary linear code in which the weight of every codeword is divisible by 8. We show how two doubly even codes of lengths m_1 and m_2 can be combined to make a triply even code of length m_1+m_2, and then prove that every maximal triply even code of length 48 can be obtained by combining two doubly even codes of length 24 in a certain way. Using this result, we show that there are exactly 10 maximal triply even codes of length 48 up to equivalence."},"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":"1012.4134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-19T00:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"88a04419a85594c5f823bb055c2df303770f7c469af20e38ad4ffd9e514802e4","abstract_canon_sha256":"dba8a584fefc903a2e71c25c3862024c2ad33103693e51f915a7cbda7855b185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:24.745601Z","signature_b64":"n6ORm9Jq7AwbhguFRVe4xnAXiaGZZvEMuowpAUQ7aLDhmIBKtniiQ5TndVyRsiEPG1/pHH6umVdIV2JVkfuyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd3ce7deb1e6b3a72aa7a598601d6eb9295b681b004e3dada49a7d63c20a46a5","last_reissued_at":"2026-05-18T03:44:24.744866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:24.744866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On triply even binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Koichi Betsumiya","submitted_at":"2010-12-19T00:27:50Z","abstract_excerpt":"A triply even code is a binary linear code in which the weight of every codeword is divisible by 8. We show how two doubly even codes of lengths m_1 and m_2 can be combined to make a triply even code of length m_1+m_2, and then prove that every maximal triply even code of length 48 can be obtained by combining two doubly even codes of length 24 in a certain way. Using this result, we show that there are exactly 10 maximal triply even codes of length 48 up to equivalence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4134","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":"1012.4134","created_at":"2026-05-18T03:44:24.744986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4134v3","created_at":"2026-05-18T03:44:24.744986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4134","created_at":"2026-05-18T03:44:24.744986+00:00"},{"alias_kind":"pith_short_12","alias_value":"3U6OPXVR42Z2","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3U6OPXVR42Z2OKVH","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3U6OPXVR","created_at":"2026-05-18T12:26:03.138858+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/3U6OPXVR42Z2OKVHUWMGAHLOXE","json":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE.json","graph_json":"https://pith.science/api/pith-number/3U6OPXVR42Z2OKVHUWMGAHLOXE/graph.json","events_json":"https://pith.science/api/pith-number/3U6OPXVR42Z2OKVHUWMGAHLOXE/events.json","paper":"https://pith.science/paper/3U6OPXVR"},"agent_actions":{"view_html":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE","download_json":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE.json","view_paper":"https://pith.science/paper/3U6OPXVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4134&json=true","fetch_graph":"https://pith.science/api/pith-number/3U6OPXVR42Z2OKVHUWMGAHLOXE/graph.json","fetch_events":"https://pith.science/api/pith-number/3U6OPXVR42Z2OKVHUWMGAHLOXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE/action/storage_attestation","attest_author":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE/action/author_attestation","sign_citation":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE/action/citation_signature","submit_replication":"https://pith.science/pith/3U6OPXVR42Z2OKVHUWMGAHLOXE/action/replication_record"}},"created_at":"2026-05-18T03:44:24.744986+00:00","updated_at":"2026-05-18T03:44:24.744986+00:00"}