{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2D6DRR6SOLCZVKBNPHFO753K7I","short_pith_number":"pith:2D6DRR6S","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"},"canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","source":{"kind":"arxiv","id":"1804.04467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04467","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04467v1","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04467","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"2D6DRR6SOLCZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2D6DRR6SOLCZVKBN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2D6DRR6S","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2D6DRR6SOLCZVKBNPHFO753K7I","target":"record","payload":{"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"},"canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","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"},"source_kind":"arxiv","source_id":"1804.04467","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocimHVnG//gaOmiz/pERMR8iGsAqzB0+nIZmDBKewXeN71ClrYrqYVa6yEnGkYR+1rP4QG94qkwa+M6dXaVHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:29:25.326480Z"},"content_sha256":"d277bc1c649b827f38ee934cb7b1d1e6696dbcd3caa252b5663b03b80cdbeab9","schema_version":"1.0","event_id":"sha256:d277bc1c649b827f38ee934cb7b1d1e6696dbcd3caa252b5663b03b80cdbeab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2D6DRR6SOLCZVKBNPHFO753K7I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X+UobfeP61In5kBP5TxI1mqVrWW+W3dnDbYvTlbuw/ipScixIwzYEERHXbv5B4yPOakISHxHueurHfJ6P4IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:29:25.327161Z"},"content_sha256":"1b428578214814070894f5fb9c046598c6a0a3fa0f0c0084e264145e524d39dc","schema_version":"1.0","event_id":"sha256:1b428578214814070894f5fb9c046598c6a0a3fa0f0c0084e264145e524d39dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/bundle.json","state_url":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2D6DRR6SOLCZVKBNPHFO753K7I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:29:25Z","links":{"resolver":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I","bundle":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/bundle.json","state":"https://pith.science/pith/2D6DRR6SOLCZVKBNPHFO753K7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2D6DRR6SOLCZVKBNPHFO753K7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2D6DRR6SOLCZVKBNPHFO753K7I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b310edc2fc86c8c3b0f0f80284f2b76549a5a88ddcb4132b9221953b00bf79c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-12T12:31:47Z","title_canon_sha256":"56db618091580992c2a1d9b67eaaaea20278c5fd743a29cc13a83038a32ed4c4"},"schema_version":"1.0","source":{"id":"1804.04467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04467","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04467v1","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04467","created_at":"2026-05-18T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"2D6DRR6SOLCZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2D6DRR6SOLCZVKBN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2D6DRR6S","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:1b428578214814070894f5fb9c046598c6a0a3fa0f0c0084e264145e524d39dc","target":"graph","created_at":"2026-05-18T00:18:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}$","authors_text":"Lidong Wang, Tao Feng, Xiaomiao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-12T12:31:47Z","title":"Optimal $2$-D $(n\\times m,3,2,1)$-optical orthogonal codes and related equi-difference conflict avoiding codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04467","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d277bc1c649b827f38ee934cb7b1d1e6696dbcd3caa252b5663b03b80cdbeab9","target":"record","created_at":"2026-05-18T00:18:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b310edc2fc86c8c3b0f0f80284f2b76549a5a88ddcb4132b9221953b00bf79c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-12T12:31:47Z","title_canon_sha256":"56db618091580992c2a1d9b67eaaaea20278c5fd743a29cc13a83038a32ed4c4"},"schema_version":"1.0","source":{"id":"1804.04467","kind":"arxiv","version":1}},"canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0fc38c7d272c59aa82d79caeff76afa170a1de1102108e2f2345d7c06ba40c3","first_computed_at":"2026-05-18T00:18:37.469112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:37.469112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83uppgZsKrRWaDbhg1wG36R61UzJX3V1ow8/3aNM67VfN26n5714d10JiNsD5x0V3wZeF0QcGzj+tXi1VediAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:37.469730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d277bc1c649b827f38ee934cb7b1d1e6696dbcd3caa252b5663b03b80cdbeab9","sha256:1b428578214814070894f5fb9c046598c6a0a3fa0f0c0084e264145e524d39dc"],"state_sha256":"f2743ba1af1a4edf1ada4641fa639ab282656985a0afbe5e6e3b89bf965d5fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CFKekspBW5VWiZhe+JeoUtw5Xkz1hd8UMUBt6BSXfSmX4dJr7ZNjlCgCp3WoamaXMXCE//UtNk+ZCl0QcJXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:29:25.331081Z","bundle_sha256":"45710d829d73f97e81831a1c8f140d56cbca3010a772107013acd3b445ac0633"}}