{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BQPKH6QBIV2ZSKSDYLVL6B2EXW","short_pith_number":"pith:BQPKH6QB","schema_version":"1.0","canonical_sha256":"0c1ea3fa014575992a43c2eabf0744bdbde026c7f374bbc1b44e9ec8a5a8cdda","source":{"kind":"arxiv","id":"1602.07944","version":1},"attestation_state":"computed","paper":{"title":"Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Lidong Wang, Yanxun Chang","submitted_at":"2016-01-23T12:33:53Z","abstract_excerpt":"In this paper, we further investigate the constructions on three-dimensional $(u\\times v\\times w,k,1)$ optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM-OPP $3$-D $(u\\times v\\times w,k,1)$-OOCs) by way of the corresponding designs. Several new auxiliary designs such as incomplete holey group divisible designs and incomplete group divisible packings are introduced and therefore new constructions are presented. As a consequence, the exact number of codewords of an optimal AM-OPP $3$-D $(u\\times v\\times w,3,1)$-OOC is finally determined "},"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":"1602.07944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-23T12:33:53Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"24feca5bdaad2e0c15c142c8ea8bd8876bc0adbecae2d900e19b6aa6212d6f93","abstract_canon_sha256":"4779795e0ccecf401bd9a28dafba5ad10093bf55a21b30f9618580e5545072a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:58.219848Z","signature_b64":"W+BxQ6u5wm5IPjihrsaVb01B4b5UPNKgWnKng6pam1GcMB3E+rUBqROZ9Gtq23TT+LxSMEQqN1X3aIk4MSBbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c1ea3fa014575992a43c2eabf0744bdbde026c7f374bbc1b44e9ec8a5a8cdda","last_reissued_at":"2026-05-18T01:19:58.219144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:58.219144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determination of sizes of optimal three-dimensional optical orthogonal codes of weight three with the AM-OPP restriction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Lidong Wang, Yanxun Chang","submitted_at":"2016-01-23T12:33:53Z","abstract_excerpt":"In this paper, we further investigate the constructions on three-dimensional $(u\\times v\\times w,k,1)$ optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM-OPP $3$-D $(u\\times v\\times w,k,1)$-OOCs) by way of the corresponding designs. Several new auxiliary designs such as incomplete holey group divisible designs and incomplete group divisible packings are introduced and therefore new constructions are presented. As a consequence, the exact number of codewords of an optimal AM-OPP $3$-D $(u\\times v\\times w,3,1)$-OOC is finally determined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07944","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":"1602.07944","created_at":"2026-05-18T01:19:58.219259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07944v1","created_at":"2026-05-18T01:19:58.219259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07944","created_at":"2026-05-18T01:19:58.219259+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQPKH6QBIV2Z","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQPKH6QBIV2ZSKSD","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQPKH6QB","created_at":"2026-05-18T12:30:07.202191+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/BQPKH6QBIV2ZSKSDYLVL6B2EXW","json":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW.json","graph_json":"https://pith.science/api/pith-number/BQPKH6QBIV2ZSKSDYLVL6B2EXW/graph.json","events_json":"https://pith.science/api/pith-number/BQPKH6QBIV2ZSKSDYLVL6B2EXW/events.json","paper":"https://pith.science/paper/BQPKH6QB"},"agent_actions":{"view_html":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW","download_json":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW.json","view_paper":"https://pith.science/paper/BQPKH6QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07944&json=true","fetch_graph":"https://pith.science/api/pith-number/BQPKH6QBIV2ZSKSDYLVL6B2EXW/graph.json","fetch_events":"https://pith.science/api/pith-number/BQPKH6QBIV2ZSKSDYLVL6B2EXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW/action/storage_attestation","attest_author":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW/action/author_attestation","sign_citation":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW/action/citation_signature","submit_replication":"https://pith.science/pith/BQPKH6QBIV2ZSKSDYLVL6B2EXW/action/replication_record"}},"created_at":"2026-05-18T01:19:58.219259+00:00","updated_at":"2026-05-18T01:19:58.219259+00:00"}