{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CFPNNL2IMIPJT6QBFWOKMJAUVN","short_pith_number":"pith:CFPNNL2I","schema_version":"1.0","canonical_sha256":"115ed6af48621e99fa012d9ca62414ab7418faa5bbb3f472fa55bdcbf27c9104","source":{"kind":"arxiv","id":"1410.4612","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.4612","created_at":"2026-05-18T02:39:55.149529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4612v1","created_at":"2026-05-18T02:39:55.149529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4612","created_at":"2026-05-18T02:39:55.149529+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFPNNL2IMIPJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFPNNL2IMIPJT6QB","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFPNNL2I","created_at":"2026-05-18T12:28:22.404517+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/CFPNNL2IMIPJT6QBFWOKMJAUVN","json":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN.json","graph_json":"https://pith.science/api/pith-number/CFPNNL2IMIPJT6QBFWOKMJAUVN/graph.json","events_json":"https://pith.science/api/pith-number/CFPNNL2IMIPJT6QBFWOKMJAUVN/events.json","paper":"https://pith.science/paper/CFPNNL2I"},"agent_actions":{"view_html":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN","download_json":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN.json","view_paper":"https://pith.science/paper/CFPNNL2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4612&json=true","fetch_graph":"https://pith.science/api/pith-number/CFPNNL2IMIPJT6QBFWOKMJAUVN/graph.json","fetch_events":"https://pith.science/api/pith-number/CFPNNL2IMIPJT6QBFWOKMJAUVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/action/storage_attestation","attest_author":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/action/author_attestation","sign_citation":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/action/citation_signature","submit_replication":"https://pith.science/pith/CFPNNL2IMIPJT6QBFWOKMJAUVN/action/replication_record"}},"created_at":"2026-05-18T02:39:55.149529+00:00","updated_at":"2026-05-18T02:39:55.149529+00:00"}