{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MBNQMUAX2YNJI4F6DLQTORSWVM","short_pith_number":"pith:MBNQMUAX","schema_version":"1.0","canonical_sha256":"605b065017d61a9470be1ae1374656ab277d450fb405469b934232d5c2d9ce65","source":{"kind":"arxiv","id":"1903.01832","version":1},"attestation_state":"computed","paper":{"title":"Self-orthogonal codes from equitable partitions of association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Svob, Dean Crnkovic, Sanja Rukavina","submitted_at":"2019-03-05T14:10:56Z","abstract_excerpt":"We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal. Further, we introduce a notion of self-orthogonal subspace codes. We show that under some conditions equitable partitions of association schemes yield such self-orthogonal subspace codes and we give some examples from distance-regular graphs."},"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":"1903.01832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T14:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"1fc6d38b362e9bc9056234d627a83a0627093b071dcda31167cae53e2e813aca","abstract_canon_sha256":"5ef90ffdf496bc036ebb89a65da7e3d4d038510e7f64e1dcf0be4cfe643e75d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.647350Z","signature_b64":"GdCLf6iz1RDU7bh8V/zPU6btgWZcT7mn5kiVlDkF73ScAAn3LrAg+uLNaa30NsGG91/iqMnO+TnL081CAZZcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605b065017d61a9470be1ae1374656ab277d450fb405469b934232d5c2d9ce65","last_reissued_at":"2026-05-17T23:51:59.646831Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.646831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-orthogonal codes from equitable partitions of association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Svob, Dean Crnkovic, Sanja Rukavina","submitted_at":"2019-03-05T14:10:56Z","abstract_excerpt":"We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal. Further, we introduce a notion of self-orthogonal subspace codes. We show that under some conditions equitable partitions of association schemes yield such self-orthogonal subspace codes and we give some examples from distance-regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01832","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":"1903.01832","created_at":"2026-05-17T23:51:59.646898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01832v1","created_at":"2026-05-17T23:51:59.646898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01832","created_at":"2026-05-17T23:51:59.646898+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBNQMUAX2YNJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBNQMUAX2YNJI4F6","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBNQMUAX","created_at":"2026-05-18T12:33:21.387695+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/MBNQMUAX2YNJI4F6DLQTORSWVM","json":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM.json","graph_json":"https://pith.science/api/pith-number/MBNQMUAX2YNJI4F6DLQTORSWVM/graph.json","events_json":"https://pith.science/api/pith-number/MBNQMUAX2YNJI4F6DLQTORSWVM/events.json","paper":"https://pith.science/paper/MBNQMUAX"},"agent_actions":{"view_html":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM","download_json":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM.json","view_paper":"https://pith.science/paper/MBNQMUAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01832&json=true","fetch_graph":"https://pith.science/api/pith-number/MBNQMUAX2YNJI4F6DLQTORSWVM/graph.json","fetch_events":"https://pith.science/api/pith-number/MBNQMUAX2YNJI4F6DLQTORSWVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM/action/storage_attestation","attest_author":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM/action/author_attestation","sign_citation":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM/action/citation_signature","submit_replication":"https://pith.science/pith/MBNQMUAX2YNJI4F6DLQTORSWVM/action/replication_record"}},"created_at":"2026-05-17T23:51:59.646898+00:00","updated_at":"2026-05-17T23:51:59.646898+00:00"}