{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:G4DBKTUS2YBKK6KJ36CFKRFSHC","short_pith_number":"pith:G4DBKTUS","canonical_record":{"source":{"id":"2408.12455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-22T14:53:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8e4f1fbd955c9e4bc30ff5926ab631a567b48bfbb53fd64d2ae9b7f48fd4cf8","abstract_canon_sha256":"135746673f00a136ea0ecab4e8cbcf68abad55ca3c8992ab2be303e3ca84f78a"},"schema_version":"1.0"},"canonical_sha256":"3706154e92d602a57949df845544b23886e6e17ca0c61d4684736ec840d91485","source":{"kind":"arxiv","id":"2408.12455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12455","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12455v1","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12455","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4DBKTUS2YBK","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_16","alias_value":"G4DBKTUS2YBKK6KJ","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_8","alias_value":"G4DBKTUS","created_at":"2026-07-05T08:58:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:G4DBKTUS2YBKK6KJ36CFKRFSHC","target":"record","payload":{"canonical_record":{"source":{"id":"2408.12455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-22T14:53:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b8e4f1fbd955c9e4bc30ff5926ab631a567b48bfbb53fd64d2ae9b7f48fd4cf8","abstract_canon_sha256":"135746673f00a136ea0ecab4e8cbcf68abad55ca3c8992ab2be303e3ca84f78a"},"schema_version":"1.0"},"canonical_sha256":"3706154e92d602a57949df845544b23886e6e17ca0c61d4684736ec840d91485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:10.230644Z","signature_b64":"xY15uN4hdz+9pPC9wrYuQ8j9Gd31JwEHHOO7xjPUihqfOWXiZkqbojYwKgaj5W/tGKFsTw0WYvl/C3wkuSFfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3706154e92d602a57949df845544b23886e6e17ca0c61d4684736ec840d91485","last_reissued_at":"2026-07-05T08:58:10.230146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:10.230146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.12455","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-07-05T08:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlYJD+4HK0hcrAQw9Qy+c7aViZ2vevlaCOd2JhMHCDOZnw1kWmG2Q7a4ptV+vYMdZAOvYBuOWe2qx0z1XC7fDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:55:31.558195Z"},"content_sha256":"b9b5a023134b93a86f7a88f3245a96cd4d24060b5c9e8dfec41fd572de1e67f7","schema_version":"1.0","event_id":"sha256:b9b5a023134b93a86f7a88f3245a96cd4d24060b5c9e8dfec41fd572de1e67f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:G4DBKTUS2YBKK6KJ36CFKRFSHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification Codes via Prime Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emad Zinoghli, Mohammad Javad Salariseddigh","submitted_at":"2024-08-22T14:53:00Z","abstract_excerpt":"We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12455","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.12455/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwKwwj/xEOkOfRBXx+N+zR3wuq99Hcza08tMK66xLTLd417b7S6fZweI3hCzGoxXVieGORxFwWbn7OPgkVWjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:55:31.558678Z"},"content_sha256":"55c3cdcadbcc820fc36392a66aee9f042ea825bc6d4153f7ff1d39e4e1892587","schema_version":"1.0","event_id":"sha256:55c3cdcadbcc820fc36392a66aee9f042ea825bc6d4153f7ff1d39e4e1892587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/bundle.json","state_url":"https://pith.science/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/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-08-07T06:55:31Z","links":{"resolver":"https://pith.science/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC","bundle":"https://pith.science/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/bundle.json","state":"https://pith.science/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4DBKTUS2YBKK6KJ36CFKRFSHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G4DBKTUS2YBKK6KJ36CFKRFSHC","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":"135746673f00a136ea0ecab4e8cbcf68abad55ca3c8992ab2be303e3ca84f78a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-22T14:53:00Z","title_canon_sha256":"b8e4f1fbd955c9e4bc30ff5926ab631a567b48bfbb53fd64d2ae9b7f48fd4cf8"},"schema_version":"1.0","source":{"id":"2408.12455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12455","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12455v1","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12455","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4DBKTUS2YBK","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_16","alias_value":"G4DBKTUS2YBKK6KJ","created_at":"2026-07-05T08:58:10Z"},{"alias_kind":"pith_short_8","alias_value":"G4DBKTUS","created_at":"2026-07-05T08:58:10Z"}],"graph_snapshots":[{"event_id":"sha256:55c3cdcadbcc820fc36392a66aee9f042ea825bc6d4153f7ff1d39e4e1892587","target":"graph","created_at":"2026-07-05T08:58:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.12455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime ","authors_text":"Emad Zinoghli, Mohammad Javad Salariseddigh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-22T14:53:00Z","title":"Identification Codes via Prime Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12455","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:b9b5a023134b93a86f7a88f3245a96cd4d24060b5c9e8dfec41fd572de1e67f7","target":"record","created_at":"2026-07-05T08:58:10Z","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":"135746673f00a136ea0ecab4e8cbcf68abad55ca3c8992ab2be303e3ca84f78a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-22T14:53:00Z","title_canon_sha256":"b8e4f1fbd955c9e4bc30ff5926ab631a567b48bfbb53fd64d2ae9b7f48fd4cf8"},"schema_version":"1.0","source":{"id":"2408.12455","kind":"arxiv","version":1}},"canonical_sha256":"3706154e92d602a57949df845544b23886e6e17ca0c61d4684736ec840d91485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3706154e92d602a57949df845544b23886e6e17ca0c61d4684736ec840d91485","first_computed_at":"2026-07-05T08:58:10.230146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:10.230146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xY15uN4hdz+9pPC9wrYuQ8j9Gd31JwEHHOO7xjPUihqfOWXiZkqbojYwKgaj5W/tGKFsTw0WYvl/C3wkuSFfCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:10.230644Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.12455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9b5a023134b93a86f7a88f3245a96cd4d24060b5c9e8dfec41fd572de1e67f7","sha256:55c3cdcadbcc820fc36392a66aee9f042ea825bc6d4153f7ff1d39e4e1892587"],"state_sha256":"c3e9b3947d8c113f711f9ea972ed7ba750e36367232fcefa2da9b367af68d19b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5A882oHDqeoPIHTLeQQJ83uG1ybIAhdBC81TxTUuq6Ozhu4sZtcaMzBZWxRY/6QX7YVwcY6gcGQaH3xGF7hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:55:31.562810Z","bundle_sha256":"31de9bd3423095086f17e6652d0a3c3b9cd721bc1b208fe420d93f653b5f7991"}}