{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2D6DRR6SOLCZVKBNPHFO753K7I","short_pith_number":"pith:2D6DRR6S","schema_version":"1.0","canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","source":{"kind":"arxiv","id":"1804.04467","version":1},"attestation_state":"computed","paper":{"title":"Optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal codes and related equi-difference conflict avoiding codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lidong Wang, Tao Feng, Xiaomiao Wang","submitted_at":"2018-04-12T12:31:47Z","abstract_excerpt":"This paper focuses on constructions for optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal codes with $m\\equiv 0\\ ({\\rm mod}\\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal equi-difference $1$-D $(m,3,2,1)$-optical orthogonal codes, which is closely related to optimal equi-difference conflict avoiding codes with weight $3$. The exact number of codewords of an optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal code is determined for $n=1,2$, $m\\equiv 0 \\pmod{4}$, and $n\\equiv 0 \\pmod{3}$, $m\\equiv 8 \\pmod{16}$ or $m\\equiv 32 \\pmod{64}$"},"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":"1804.04467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-12T12:31:47Z","cross_cats_sorted":[],"title_canon_sha256":"56db618091580992c2a1d9b67eaaaea20278c5fd743a29cc13a83038a32ed4c4","abstract_canon_sha256":"b310edc2fc86c8c3b0f0f80284f2b76549a5a88ddcb4132b9221953b00bf79c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:37.469730Z","signature_b64":"83uppgZsKrRWaDbhg1wG36R61UzJX3V1ow8/3aNM67VfN26n5714d10JiNsD5x0V3wZeF0QcGzj+tXi1VediAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","last_reissued_at":"2026-05-18T00:18:37.469112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:37.469112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal codes and related equi-difference conflict avoiding codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lidong Wang, Tao Feng, Xiaomiao Wang","submitted_at":"2018-04-12T12:31:47Z","abstract_excerpt":"This paper focuses on constructions for optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal codes with $m\\equiv 0\\ ({\\rm mod}\\ 4)$. An upper bound on the size of such codes is established. It relies heavily on the size of optimal equi-difference $1$-D $(m,3,2,1)$-optical orthogonal codes, which is closely related to optimal equi-difference conflict avoiding codes with weight $3$. The exact number of codewords of an optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal code is determined for $n=1,2$, $m\\equiv 0 \\pmod{4}$, and $n\\equiv 0 \\pmod{3}$, $m\\equiv 8 \\pmod{16}$ or $m\\equiv 32 \\pmod{64}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04467","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":"1804.04467","created_at":"2026-05-18T00:18:37.469183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04467v1","created_at":"2026-05-18T00:18:37.469183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04467","created_at":"2026-05-18T00:18:37.469183+00:00"},{"alias_kind":"pith_short_12","alias_value":"2D6DRR6SOLCZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2D6DRR6SOLCZVKBN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2D6DRR6S","created_at":"2026-05-18T12:31:59.375834+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/2D6DRR6SOLCZVKBNPHFO753K7I","json":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I.json","graph_json":"https://pith.science/api/pith-number/2D6DRR6SOLCZVKBNPHFO753K7I/graph.json","events_json":"https://pith.science/api/pith-number/2D6DRR6SOLCZVKBNPHFO753K7I/events.json","paper":"https://pith.science/paper/2D6DRR6S"},"agent_actions":{"view_html":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I","download_json":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I.json","view_paper":"https://pith.science/paper/2D6DRR6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04467&json=true","fetch_graph":"https://pith.science/api/pith-number/2D6DRR6SOLCZVKBNPHFO753K7I/graph.json","fetch_events":"https://pith.science/api/pith-number/2D6DRR6SOLCZVKBNPHFO753K7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/action/storage_attestation","attest_author":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/action/author_attestation","sign_citation":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/action/citation_signature","submit_replication":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/action/replication_record"}},"created_at":"2026-05-18T00:18:37.469183+00:00","updated_at":"2026-05-18T00:18:37.469183+00:00"}