{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7LWUORMSYIJFCR3WZ5Y4SNX56B","short_pith_number":"pith:7LWUORMS","schema_version":"1.0","canonical_sha256":"faed474592c212514776cf71c936fdf07f205258ceca77b9cecf674c5ca82ff1","source":{"kind":"arxiv","id":"1906.12017","version":1},"attestation_state":"computed","paper":{"title":"Binary optimal linear codes from posets of the disjoint union of two chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jong Yoon Hyun, Qin Yue, Yansheng Wu","submitted_at":"2019-06-28T02:13:26Z","abstract_excerpt":"Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear 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":"1906.12017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-28T02:13:26Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"ed0c07285fdfdafe90bf9c28fd4ec319555067ad8e2c23bf1a8524b78d5011f5","abstract_canon_sha256":"3a6c1cf156d9132dda0de0239563003a8cb0fbae9ad1c66fba4517d00c8a4f26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:59.522820Z","signature_b64":"ELay6tzC3msjeUHVb05ZJCrlBuzAVUE7lxQvMqyqFmbZDr8lGB2HbW19Vp7ihvykqCHAnw6eFCGIcW6jNZ3FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faed474592c212514776cf71c936fdf07f205258ceca77b9cecf674c5ca82ff1","last_reissued_at":"2026-05-17T23:41:59.522355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:59.522355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary optimal linear codes from posets of the disjoint union of two chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jong Yoon Hyun, Qin Yue, Yansheng Wu","submitted_at":"2019-06-28T02:13:26Z","abstract_excerpt":"Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12017","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":"1906.12017","created_at":"2026-05-17T23:41:59.522436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12017v1","created_at":"2026-05-17T23:41:59.522436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12017","created_at":"2026-05-17T23:41:59.522436+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LWUORMSYIJF","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LWUORMSYIJFCR3W","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LWUORMS","created_at":"2026-05-18T12:33:12.712433+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/7LWUORMSYIJFCR3WZ5Y4SNX56B","json":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B.json","graph_json":"https://pith.science/api/pith-number/7LWUORMSYIJFCR3WZ5Y4SNX56B/graph.json","events_json":"https://pith.science/api/pith-number/7LWUORMSYIJFCR3WZ5Y4SNX56B/events.json","paper":"https://pith.science/paper/7LWUORMS"},"agent_actions":{"view_html":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B","download_json":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B.json","view_paper":"https://pith.science/paper/7LWUORMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12017&json=true","fetch_graph":"https://pith.science/api/pith-number/7LWUORMSYIJFCR3WZ5Y4SNX56B/graph.json","fetch_events":"https://pith.science/api/pith-number/7LWUORMSYIJFCR3WZ5Y4SNX56B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B/action/storage_attestation","attest_author":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B/action/author_attestation","sign_citation":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B/action/citation_signature","submit_replication":"https://pith.science/pith/7LWUORMSYIJFCR3WZ5Y4SNX56B/action/replication_record"}},"created_at":"2026-05-17T23:41:59.522436+00:00","updated_at":"2026-05-17T23:41:59.522436+00:00"}