{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XUD7RN3BBAJDOTBJESPIEBIBUG","short_pith_number":"pith:XUD7RN3B","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"},"canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","source":{"kind":"arxiv","id":"1905.07868","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07868","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07868v2","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07868","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"XUD7RN3BBAJD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XUD7RN3BBAJDOTBJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XUD7RN3B","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XUD7RN3BBAJDOTBJESPIEBIBUG","target":"record","payload":{"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"},"canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","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"},"source_kind":"arxiv","source_id":"1905.07868","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-17T23:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DKV8/OJSx7M5i6LVzHWgBOefAImNUoN7UzObX/emPyxxX9c2muYS9UR7kwhZDFEnUUaCALDmvNNpLihrR51Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:42:20.876329Z"},"content_sha256":"ae7e9e6b1977a1976304c5bff4845b2688843c89c08f099bdeb05e073270e1ca","schema_version":"1.0","event_id":"sha256:ae7e9e6b1977a1976304c5bff4845b2688843c89c08f099bdeb05e073270e1ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XUD7RN3BBAJDOTBJESPIEBIBUG","target":"graph","payload":{"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"},"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-17T23:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQHhoUzkadM6nhftT+MYw39L6MI1jJlnOlEbUGcxfkyPWMwqKP3loGfEAv9Jgs3pM9B66Uh95ueITO84nQgKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:42:20.876695Z"},"content_sha256":"01e3209db56c5b0782a4838755ca0a59bac313465875ed5302312756970c7626","schema_version":"1.0","event_id":"sha256:01e3209db56c5b0782a4838755ca0a59bac313465875ed5302312756970c7626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/bundle.json","state_url":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/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-04T02:42:20Z","links":{"resolver":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG","bundle":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/bundle.json","state":"https://pith.science/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUD7RN3BBAJDOTBJESPIEBIBUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XUD7RN3BBAJDOTBJESPIEBIBUG","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":"db9e37b0818edbbf80630167f4124602338d3f41cfbd81eac6e31b38f0f71902","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-20T04:24:30Z","title_canon_sha256":"722a7cb4d4855019d0790fdf939a175db6b3eb4c4d08968af44a7108cf086ca8"},"schema_version":"1.0","source":{"id":"1905.07868","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07868","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07868v2","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07868","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"XUD7RN3BBAJD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XUD7RN3BBAJDOTBJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XUD7RN3B","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:01e3209db56c5b0782a4838755ca0a59bac313465875ed5302312756970c7626","target":"graph","created_at":"2026-05-17T23:44:18Z","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":"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","authors_text":"Anshoo Tandon, Lav R. Varshney, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-20T04:24:30Z","title":"Error Exponent Bounds for the Bee-Identification Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07868","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:ae7e9e6b1977a1976304c5bff4845b2688843c89c08f099bdeb05e073270e1ca","target":"record","created_at":"2026-05-17T23:44:18Z","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":"db9e37b0818edbbf80630167f4124602338d3f41cfbd81eac6e31b38f0f71902","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-20T04:24:30Z","title_canon_sha256":"722a7cb4d4855019d0790fdf939a175db6b3eb4c4d08968af44a7108cf086ca8"},"schema_version":"1.0","source":{"id":"1905.07868","kind":"arxiv","version":2}},"canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd07f8b7610812374c29249e820501a1b3180f25222f7ac2d62371db46383a0c","first_computed_at":"2026-05-17T23:44:18.554918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:18.554918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"veOEOzEw0HuSLLHXE4AuMJDSTAXUWEJRk5TWg1o7y/yJDeZwPqdfVB25jlf3VMdv5kE23aPV0YTr2UL1wQR8AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:18.555575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07868","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae7e9e6b1977a1976304c5bff4845b2688843c89c08f099bdeb05e073270e1ca","sha256:01e3209db56c5b0782a4838755ca0a59bac313465875ed5302312756970c7626"],"state_sha256":"233c18e3b96cffc904e3cd5ab576ba4ec4a4e9d7a5be176210cf2f6a7028547b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qx0YtYfiysou9De8zCdtdZqw0vS98dM6kVP6WVE8yfr31nWw9vox59k24gqdDrQ9eqKaAfPeCzGm64DiUtFrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:42:20.878811Z","bundle_sha256":"2e59978af416bf2e17de6aac9396519a83b449f6066325619b162d7305dd0d1a"}}