{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FYDCDLCVNNXTHJ2QKCQ3RKHGBB","short_pith_number":"pith:FYDCDLCV","canonical_record":{"source":{"id":"1710.02703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-07T16:10:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e79f2c5dbbd73dcb92ebe0d9ccecf5fa19b808a4b497e6b0d7f388dde9461f4d","abstract_canon_sha256":"f557fccfce459c04c5fcd0050288e6eb39a7d664f8ce30110cc1e8e88f1d49e5"},"schema_version":"1.0"},"canonical_sha256":"2e0621ac556b6f33a75050a1b8a8e6085a431446baf60901161579bd7c654938","source":{"kind":"arxiv","id":"1710.02703","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02703","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02703v2","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02703","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"FYDCDLCVNNXT","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYDCDLCVNNXTHJ2Q","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYDCDLCV","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FYDCDLCVNNXTHJ2QKCQ3RKHGBB","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-07T16:10:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e79f2c5dbbd73dcb92ebe0d9ccecf5fa19b808a4b497e6b0d7f388dde9461f4d","abstract_canon_sha256":"f557fccfce459c04c5fcd0050288e6eb39a7d664f8ce30110cc1e8e88f1d49e5"},"schema_version":"1.0"},"canonical_sha256":"2e0621ac556b6f33a75050a1b8a8e6085a431446baf60901161579bd7c654938","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:01.691792Z","signature_b64":"JyNLM4JOb1NbV1Rd+Y2KKfa4w2jsSXZ8MhxbpX1unxaiBC8Qbo51z73QShTwcwnqhmK/IFG9tGu1k0wqUw3CDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e0621ac556b6f33a75050a1b8a8e6085a431446baf60901161579bd7c654938","last_reissued_at":"2026-05-18T00:33:01.691374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:01.691374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02703","source_version":2,"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:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8felO1+df2jmy+3updOuUHuOKYVLeynhxiPDb8XBweZC7WtdF2QTHD5ym6iFfBA/Vnq0ofGfIfkRtW/vdUAtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:20:50.794721Z"},"content_sha256":"58b01086d56745bc5171a13a1c19ad743e2cd899f92875641272e8fc80de9c17","schema_version":"1.0","event_id":"sha256:58b01086d56745bc5171a13a1c19ad743e2cd899f92875641272e8fc80de9c17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FYDCDLCVNNXTHJ2QKCQ3RKHGBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Properties of Syndrome Distribution for Blind Reconstruction of Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arti D. Yardi, Saravanan Vijayakumaran","submitted_at":"2017-10-07T16:10:59Z","abstract_excerpt":"In the problem of blind reconstruction of channel codes, the receiver does not have the knowledge of the channel code used at the transmitter and the aim is to identify this unknown channel code corresponding to the given received sequence. In this paper, we study this blind reconstruction problem for binary cyclic codes. In the literature, several researchers have proposed blind reconstruction algorithms that make use of the distribution of the syndromes (remainders) of the received polynomials with respect to a candidate polynomial for the generator polynomial of the cyclic code. However, ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02703","kind":"arxiv","version":2},"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:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wYf7jx4X8W8RNq4VQyB0pVumNAq81OtsLLCrk5+gebJTTnZ9PUSrHdgYd6qMkKcqRrwSHjqu/JIphmYs2LsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:20:50.795065Z"},"content_sha256":"7164aed66d06b1e43b27797810fe6189ff6cdc106f443269599dc423a360e45f","schema_version":"1.0","event_id":"sha256:7164aed66d06b1e43b27797810fe6189ff6cdc106f443269599dc423a360e45f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/bundle.json","state_url":"https://pith.science/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/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-28T12:20:50Z","links":{"resolver":"https://pith.science/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB","bundle":"https://pith.science/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/bundle.json","state":"https://pith.science/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYDCDLCVNNXTHJ2QKCQ3RKHGBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FYDCDLCVNNXTHJ2QKCQ3RKHGBB","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":"f557fccfce459c04c5fcd0050288e6eb39a7d664f8ce30110cc1e8e88f1d49e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-07T16:10:59Z","title_canon_sha256":"e79f2c5dbbd73dcb92ebe0d9ccecf5fa19b808a4b497e6b0d7f388dde9461f4d"},"schema_version":"1.0","source":{"id":"1710.02703","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02703","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02703v2","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02703","created_at":"2026-05-18T00:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"FYDCDLCVNNXT","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYDCDLCVNNXTHJ2Q","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYDCDLCV","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:7164aed66d06b1e43b27797810fe6189ff6cdc106f443269599dc423a360e45f","target":"graph","created_at":"2026-05-18T00:33:01Z","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":"In the problem of blind reconstruction of channel codes, the receiver does not have the knowledge of the channel code used at the transmitter and the aim is to identify this unknown channel code corresponding to the given received sequence. In this paper, we study this blind reconstruction problem for binary cyclic codes. In the literature, several researchers have proposed blind reconstruction algorithms that make use of the distribution of the syndromes (remainders) of the received polynomials with respect to a candidate polynomial for the generator polynomial of the cyclic code. However, ve","authors_text":"Arti D. Yardi, Saravanan Vijayakumaran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-07T16:10:59Z","title":"Properties of Syndrome Distribution for Blind Reconstruction of Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02703","kind":"arxiv","version":2},"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:58b01086d56745bc5171a13a1c19ad743e2cd899f92875641272e8fc80de9c17","target":"record","created_at":"2026-05-18T00:33:01Z","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":"f557fccfce459c04c5fcd0050288e6eb39a7d664f8ce30110cc1e8e88f1d49e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-07T16:10:59Z","title_canon_sha256":"e79f2c5dbbd73dcb92ebe0d9ccecf5fa19b808a4b497e6b0d7f388dde9461f4d"},"schema_version":"1.0","source":{"id":"1710.02703","kind":"arxiv","version":2}},"canonical_sha256":"2e0621ac556b6f33a75050a1b8a8e6085a431446baf60901161579bd7c654938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e0621ac556b6f33a75050a1b8a8e6085a431446baf60901161579bd7c654938","first_computed_at":"2026-05-18T00:33:01.691374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:01.691374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JyNLM4JOb1NbV1Rd+Y2KKfa4w2jsSXZ8MhxbpX1unxaiBC8Qbo51z73QShTwcwnqhmK/IFG9tGu1k0wqUw3CDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:01.691792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02703","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58b01086d56745bc5171a13a1c19ad743e2cd899f92875641272e8fc80de9c17","sha256:7164aed66d06b1e43b27797810fe6189ff6cdc106f443269599dc423a360e45f"],"state_sha256":"152bb46e53b20d5636bee7f4d5cbf48ec1e87534769a123079cf7a1e1a80fd3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXcjxejkupMXuYpJyqVZ1KFmu4L6GlYAgUanv9aKXhl29NIGyaOYa2QDu64V76EwdGHouC658Oa8vUspFkQwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:20:50.797054Z","bundle_sha256":"b1847966e01127da0b10fb84d4cf99681c9ddb4d75821c135242854b4fe8dfd3"}}