{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CFPNNL2IMIPJT6QBFWOKMJAUVN","short_pith_number":"pith:CFPNNL2I","canonical_record":{"source":{"id":"1410.4612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-17T00:31:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29d3bdeb0a0cb29727fdc539c587dfe9762710d3e8d88108953ee40fb1e8624c","abstract_canon_sha256":"069c77bdab7ea4bd7bd8571c373851570a7bdb050308a66555cfb601a6206d34"},"schema_version":"1.0"},"canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","source":{"kind":"arxiv","id":"1410.4612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4612","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4612v1","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4612","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"CFPNNL2IMIPJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CFPNNL2IMIPJT6QB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CFPNNL2I","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CFPNNL2IMIPJT6QBFWOKMJAUVN","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-17T00:31:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29d3bdeb0a0cb29727fdc539c587dfe9762710d3e8d88108953ee40fb1e8624c","abstract_canon_sha256":"069c77bdab7ea4bd7bd8571c373851570a7bdb050308a66555cfb601a6206d34"},"schema_version":"1.0"},"canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:55.149914Z","signature_b64":"eyflw26bQIM2AplLHMfT1U/6JZ4vqLHhs9pHB9X+0dxoqkySS3Y5uSmMc9H1dPexGlslVTheI5M0g776xQafAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","last_reissued_at":"2026-05-18T02:39:55.149455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:55.149455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4612","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-18T02:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xswKRwMM2SdcFXcpoDXOqnSn0tdn0BVOfMVQ8LVbZsC5HtRJzFaZkW0sSTP6b1t5MUHMrYLJaiL/dd97ElXSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:16.794139Z"},"content_sha256":"67cf8ca52a4d739461329c4fe046b143bd4d3b5a0ef99016c6436059a2d23371","schema_version":"1.0","event_id":"sha256:67cf8ca52a4d739461329c4fe046b143bd4d3b5a0ef99016c6436059a2d23371"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CFPNNL2IMIPJT6QBFWOKMJAUVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identification Codes to Identify Multiple Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hirosuke Yamamoto, Masashi Ueda","submitted_at":"2014-10-17T00:31:21Z","abstract_excerpt":"In the case of ordinary identification coding, a code is devised to identify a single object among $N$ objects. But, in this paper, we consider an identification coding problem to identify $K$ objects at once among $N$ objects in the both cases that $K$ objects are ranked or not ranked. By combining Kurosawa-Yoshida scheme with Moulin-Koetter scheme, an efficient identification coding scheme is proposed, which can attain high coding rate and error exponents compared with the case that an ordinary identification code is used $K$ times. Furthermore, the achievable triplet of rate and error expon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4612","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-18T02:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFXPswg8tDwAFof5MYdDV9I17HQjweL/HOYt3WHmfVG1SaZLhCP4eVVMFCSW7CYPowV2+DawDsQKPegvbzr5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:16.794504Z"},"content_sha256":"8fbbf32a293f39d10b41471c3672fbad917c50f7dd069b33776a823546332ed0","schema_version":"1.0","event_id":"sha256:8fbbf32a293f39d10b41471c3672fbad917c50f7dd069b33776a823546332ed0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/bundle.json","state_url":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/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-21T23:00:16Z","links":{"resolver":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN","bundle":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/bundle.json","state":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CFPNNL2IMIPJT6QBFWOKMJAUVN","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":"069c77bdab7ea4bd7bd8571c373851570a7bdb050308a66555cfb601a6206d34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-17T00:31:21Z","title_canon_sha256":"29d3bdeb0a0cb29727fdc539c587dfe9762710d3e8d88108953ee40fb1e8624c"},"schema_version":"1.0","source":{"id":"1410.4612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4612","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4612v1","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4612","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"CFPNNL2IMIPJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CFPNNL2IMIPJT6QB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CFPNNL2I","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:8fbbf32a293f39d10b41471c3672fbad917c50f7dd069b33776a823546332ed0","target":"graph","created_at":"2026-05-18T02:39:55Z","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 case of ordinary identification coding, a code is devised to identify a single object among $N$ objects. But, in this paper, we consider an identification coding problem to identify $K$ objects at once among $N$ objects in the both cases that $K$ objects are ranked or not ranked. By combining Kurosawa-Yoshida scheme with Moulin-Koetter scheme, an efficient identification coding scheme is proposed, which can attain high coding rate and error exponents compared with the case that an ordinary identification code is used $K$ times. Furthermore, the achievable triplet of rate and error expon","authors_text":"Hirosuke Yamamoto, Masashi Ueda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-17T00:31:21Z","title":"Identification Codes to Identify Multiple Objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4612","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:67cf8ca52a4d739461329c4fe046b143bd4d3b5a0ef99016c6436059a2d23371","target":"record","created_at":"2026-05-18T02:39:55Z","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":"069c77bdab7ea4bd7bd8571c373851570a7bdb050308a66555cfb601a6206d34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-17T00:31:21Z","title_canon_sha256":"29d3bdeb0a0cb29727fdc539c587dfe9762710d3e8d88108953ee40fb1e8624c"},"schema_version":"1.0","source":{"id":"1410.4612","kind":"arxiv","version":1}},"canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","first_computed_at":"2026-05-18T02:39:55.149455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:55.149455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eyflw26bQIM2AplLHMfT1U/6JZ4vqLHhs9pHB9X+0dxoqkySS3Y5uSmMc9H1dPexGlslVTheI5M0g776xQafAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:55.149914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67cf8ca52a4d739461329c4fe046b143bd4d3b5a0ef99016c6436059a2d23371","sha256:8fbbf32a293f39d10b41471c3672fbad917c50f7dd069b33776a823546332ed0"],"state_sha256":"333a878938e6049adffe31501b9d029520d2fa2db9cb5affd9824207ff9148ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QybdCRVm+f4FRIbO2IByaxPqaptNHRTGKdO/qNvEPTes2Zhd4aXVe9mmTVLpC+JIMOqsCxCqOzmJ/T7lealDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:00:16.796495Z","bundle_sha256":"817858565b2f0953a612518d75a582e535f1e3f5317ba7b4bb767f4b4ab398ed"}}