{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XUD7RN3BBAJDOTBJESPIEBIBUG","short_pith_number":"pith:XUD7RN3B","schema_version":"1.0","canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","source":{"kind":"arxiv","id":"1905.07868","version":2},"attestation_state":"computed","paper":{"title":"Error Exponent Bounds for the Bee-Identification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Lav R. Varshney, Vincent Y. F. Tan","submitted_at":"2019-05-20T04:24:30Z","abstract_excerpt":"Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We formally introduce this `bee-identification problem', define its error exponent, and derive efficiently computable upper and lower bounds for this exponent. We show that joint decoding of barcodes provides a significantly better exponent compared to separate decoding followed by permutation inference. For low rates, we prove that the lower bound on the bee-identification exponent obtained using typical random codes (TRC) is strictly better than the corresponding bound obta"},"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":"1905.07868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-20T04:24:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"722a7cb4d4855019d0790fdf939a175db6b3eb4c4d08968af44a7108cf086ca8","abstract_canon_sha256":"db9e37b0818edbbf80630167f4124602338d3f41cfbd81eac6e31b38f0f71902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:18.555575Z","signature_b64":"veOEOzEw0HuSLLHXE4AuMJDSTAXUWEJRk5TWg1o7y/yJDeZwPqdfVB25jlf3VMdv5kE23aPV0YTr2UL1wQR8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","last_reissued_at":"2026-05-17T23:44:18.554918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:18.554918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Exponent Bounds for the Bee-Identification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anshoo Tandon, Lav R. Varshney, Vincent Y. F. Tan","submitted_at":"2019-05-20T04:24:30Z","abstract_excerpt":"Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We formally introduce this `bee-identification problem', define its error exponent, and derive efficiently computable upper and lower bounds for this exponent. We show that joint decoding of barcodes provides a significantly better exponent compared to separate decoding followed by permutation inference. For low rates, we prove that the lower bound on the bee-identification exponent obtained using typical random codes (TRC) is strictly better than the corresponding bound obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07868","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07868","created_at":"2026-05-17T23:44:18.555030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07868v2","created_at":"2026-05-17T23:44:18.555030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07868","created_at":"2026-05-17T23:44:18.555030+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUD7RN3BBAJD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUD7RN3BBAJDOTBJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUD7RN3B","created_at":"2026-05-18T12:33:33.725879+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/XUD7RN3BBAJDOTBJESPIEBIBUG","json":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG.json","graph_json":"https://pith.science/api/pith-number/XUD7RN3BBAJDOTBJESPIEBIBUG/graph.json","events_json":"https://pith.science/api/pith-number/XUD7RN3BBAJDOTBJESPIEBIBUG/events.json","paper":"https://pith.science/paper/XUD7RN3B"},"agent_actions":{"view_html":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG","download_json":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG.json","view_paper":"https://pith.science/paper/XUD7RN3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07868&json=true","fetch_graph":"https://pith.science/api/pith-number/XUD7RN3BBAJDOTBJESPIEBIBUG/graph.json","fetch_events":"https://pith.science/api/pith-number/XUD7RN3BBAJDOTBJESPIEBIBUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/action/storage_attestation","attest_author":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/action/author_attestation","sign_citation":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/action/citation_signature","submit_replication":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/action/replication_record"}},"created_at":"2026-05-17T23:44:18.555030+00:00","updated_at":"2026-05-17T23:44:18.555030+00:00"}