{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B4EL4N3VNNJFIG5B7JFVF4TWXS","short_pith_number":"pith:B4EL4N3V","schema_version":"1.0","canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","source":{"kind":"arxiv","id":"1309.2250","version":1},"attestation_state":"computed","paper":{"title":"A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar (Optical) Orthogonal Codes with Same Code-length and Low Weight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. Asthana, R. C. S. Chauhan, Y. N. Singh","submitted_at":"2013-09-09T18:33:36Z","abstract_excerpt":"This paper describes a search algorithm to find multiple sets of one dimensional unipolar (optical) orthogonal codes characterized by parameters, binary code sequence of length (n bits) and weight w (number of bit 1s in the sequence) as well as auto-correlation and cross-correlation constraint respectively for the codes within a set. For a given code length n and code weight w all possible difference sets, with auto-correlation constraints lying from 1 to w-1 can be designed with distinct code serial number. For given cross-correlation constraint from 1 to w-1 Multiple sets can be searched out"},"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":"1309.2250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-09T18:33:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ce94150d3c83d0baca500982348d6ec1903055af147c7321033981f1f028a8d","abstract_canon_sha256":"6e2947786500ef9026ae1e06b3bfe261ccd11e4657ee27abf94d64667a18c4aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:46.837799Z","signature_b64":"RmuPj9HKVLXdoWtJnEORSrbf0yV5/odTqoC5f2pa96uj51DSJLCAcdXuKmVm5e2+4ob8RVk/q8W0hIid4YXvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","last_reissued_at":"2026-05-18T03:13:46.837113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:46.837113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar (Optical) Orthogonal Codes with Same Code-length and Low Weight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. Asthana, R. C. S. Chauhan, Y. N. Singh","submitted_at":"2013-09-09T18:33:36Z","abstract_excerpt":"This paper describes a search algorithm to find multiple sets of one dimensional unipolar (optical) orthogonal codes characterized by parameters, binary code sequence of length (n bits) and weight w (number of bit 1s in the sequence) as well as auto-correlation and cross-correlation constraint respectively for the codes within a set. For a given code length n and code weight w all possible difference sets, with auto-correlation constraints lying from 1 to w-1 can be designed with distinct code serial number. For given cross-correlation constraint from 1 to w-1 Multiple sets can be searched out"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2250","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":"1309.2250","created_at":"2026-05-18T03:13:46.837207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2250v1","created_at":"2026-05-18T03:13:46.837207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2250","created_at":"2026-05-18T03:13:46.837207+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4EL4N3VNNJF","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4EL4N3VNNJFIG5B","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4EL4N3V","created_at":"2026-05-18T12:27:38.830355+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/B4EL4N3VNNJFIG5B7JFVF4TWXS","json":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS.json","graph_json":"https://pith.science/api/pith-number/B4EL4N3VNNJFIG5B7JFVF4TWXS/graph.json","events_json":"https://pith.science/api/pith-number/B4EL4N3VNNJFIG5B7JFVF4TWXS/events.json","paper":"https://pith.science/paper/B4EL4N3V"},"agent_actions":{"view_html":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS","download_json":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS.json","view_paper":"https://pith.science/paper/B4EL4N3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2250&json=true","fetch_graph":"https://pith.science/api/pith-number/B4EL4N3VNNJFIG5B7JFVF4TWXS/graph.json","fetch_events":"https://pith.science/api/pith-number/B4EL4N3VNNJFIG5B7JFVF4TWXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/action/storage_attestation","attest_author":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/action/author_attestation","sign_citation":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/action/citation_signature","submit_replication":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/action/replication_record"}},"created_at":"2026-05-18T03:13:46.837207+00:00","updated_at":"2026-05-18T03:13:46.837207+00:00"}