{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B4EL4N3VNNJFIG5B7JFVF4TWXS","short_pith_number":"pith:B4EL4N3V","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"},"canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","source":{"kind":"arxiv","id":"1309.2250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2250","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2250v1","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2250","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"B4EL4N3VNNJF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B4EL4N3VNNJFIG5B","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B4EL4N3V","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B4EL4N3VNNJFIG5B7JFVF4TWXS","target":"record","payload":{"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"},"canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","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"},"source_kind":"arxiv","source_id":"1309.2250","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-18T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXGximzRdVH4G3VuwfrLlO9hsTRJmeOVs3mE96VXVL9DAoa7Cx8OrdQQJCdqMNoUAxbix89kHSS0hYHEqIYaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:04:24.572910Z"},"content_sha256":"2a33efd7b10142f20fc543af08bd59da9c1e037e0a4dbf6e614d8e931305ad91","schema_version":"1.0","event_id":"sha256:2a33efd7b10142f20fc543af08bd59da9c1e037e0a4dbf6e614d8e931305ad91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B4EL4N3VNNJFIG5B7JFVF4TWXS","target":"graph","payload":{"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"},"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-18T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DchRuaqM9cymk+3y0chfAmSlfsaHFvms8PJsv518eBbY4ozH3pWjwOE08wxneDNat5WNzKnmpTrv9u1CjwelDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:04:24.573964Z"},"content_sha256":"dbfa116c6d823fbf7997e3b305e2456bc395f144112546d238db49258e3afe65","schema_version":"1.0","event_id":"sha256:dbfa116c6d823fbf7997e3b305e2456bc395f144112546d238db49258e3afe65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/bundle.json","state_url":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/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-05-31T19:04:24Z","links":{"resolver":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS","bundle":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/bundle.json","state":"https://pith.science/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4EL4N3VNNJFIG5B7JFVF4TWXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B4EL4N3VNNJFIG5B7JFVF4TWXS","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":"6e2947786500ef9026ae1e06b3bfe261ccd11e4657ee27abf94d64667a18c4aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-09T18:33:36Z","title_canon_sha256":"9ce94150d3c83d0baca500982348d6ec1903055af147c7321033981f1f028a8d"},"schema_version":"1.0","source":{"id":"1309.2250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2250","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2250v1","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2250","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"B4EL4N3VNNJF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B4EL4N3VNNJFIG5B","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B4EL4N3V","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:dbfa116c6d823fbf7997e3b305e2456bc395f144112546d238db49258e3afe65","target":"graph","created_at":"2026-05-18T03:13:46Z","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 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","authors_text":"R. Asthana, R. C. S. Chauhan, Y. N. Singh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-09T18:33:36Z","title":"A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar (Optical) Orthogonal Codes with Same Code-length and Low Weight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2250","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:2a33efd7b10142f20fc543af08bd59da9c1e037e0a4dbf6e614d8e931305ad91","target":"record","created_at":"2026-05-18T03:13:46Z","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":"6e2947786500ef9026ae1e06b3bfe261ccd11e4657ee27abf94d64667a18c4aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-09T18:33:36Z","title_canon_sha256":"9ce94150d3c83d0baca500982348d6ec1903055af147c7321033981f1f028a8d"},"schema_version":"1.0","source":{"id":"1309.2250","kind":"arxiv","version":1}},"canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f08be37756b52541ba1fa4b52f276bc8bfd1d3ec24f22959a5e1e33e225fe7a","first_computed_at":"2026-05-18T03:13:46.837113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:46.837113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RmuPj9HKVLXdoWtJnEORSrbf0yV5/odTqoC5f2pa96uj51DSJLCAcdXuKmVm5e2+4ob8RVk/q8W0hIid4YXvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:46.837799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a33efd7b10142f20fc543af08bd59da9c1e037e0a4dbf6e614d8e931305ad91","sha256:dbfa116c6d823fbf7997e3b305e2456bc395f144112546d238db49258e3afe65"],"state_sha256":"ad4c55ec0d3ad186d9c7010c185ffc895229faeb05aa960e69db95306a8faf1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glalACtpsW7Dh5v1uYuc7m6tgG/p4oLt2rXVYgfeZ3uwBFFz8w8j8R6L95il6VEJaqi6YbdxD7ImH/dHvSf/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:04:24.578415Z","bundle_sha256":"268559a19eca5e9f546df7d4bef3a32cdf6e5668cbcd8f44650d7a4e7c762e79"}}