{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:O5Z3CUTI43MKXSMRRBTPQHJ6RQ","short_pith_number":"pith:O5Z3CUTI","canonical_record":{"source":{"id":"0904.2441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T07:33:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1d349446b24e50dc7e5c2fc8afe6508838bbbb8f51f67fed4a27ba06e424930","abstract_canon_sha256":"11e2dd3a6741b9f11f9db8ad5655810f14cd1d6e09a87965d5cae1171436f68e"},"schema_version":"1.0"},"canonical_sha256":"7773b15268e6d8abc9918866f81d3e8c23d57606b65e664a279999b1c7d2278c","source":{"kind":"arxiv","id":"0904.2441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2441","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2441v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2441","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"O5Z3CUTI43MK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O5Z3CUTI43MKXSMR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O5Z3CUTI","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:O5Z3CUTI43MKXSMRRBTPQHJ6RQ","target":"record","payload":{"canonical_record":{"source":{"id":"0904.2441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T07:33:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1d349446b24e50dc7e5c2fc8afe6508838bbbb8f51f67fed4a27ba06e424930","abstract_canon_sha256":"11e2dd3a6741b9f11f9db8ad5655810f14cd1d6e09a87965d5cae1171436f68e"},"schema_version":"1.0"},"canonical_sha256":"7773b15268e6d8abc9918866f81d3e8c23d57606b65e664a279999b1c7d2278c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.221563Z","signature_b64":"7J5HtZ7TM860rL6d6QPipT/ZH4bza+SLj5IHKoFxhZu8EeVqxv1Ffxn99hff/V44duxCpnO7gLo9v2LSzwD2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7773b15268e6d8abc9918866f81d3e8c23d57606b65e664a279999b1c7d2278c","last_reissued_at":"2026-05-18T00:57:58.221152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.221152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.2441","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7qGuMwED7NOoxltAxSdGnLXVEoqehekhYdHqi6FueYd8gt9keBpwEvTWvi25gZeANYz9NzjYLkTBw91RRS4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:21:03.004853Z"},"content_sha256":"0bbcc6471bd2227636cef5e9267f109fbcf854abf4529d4af1bfe392796c4fa7","schema_version":"1.0","event_id":"sha256:0bbcc6471bd2227636cef5e9267f109fbcf854abf4529d4af1bfe392796c4fa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:O5Z3CUTI43MKXSMRRBTPQHJ6RQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Identification of RFID Tags Using Multiple Independent Reader Sessions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Karsten Fyhn Nielsen, Petar Popovski, Rasmus Jacobsen, Torben Larsen","submitted_at":"2009-04-16T07:33:40Z","abstract_excerpt":"Radio Frequency Identification (RFID) systems are gaining momentum in various applications of logistics, inventory, etc. A generic problem in such systems is to ensure that the RFID readers can reliably read a set of RFID tags, such that the probability of missing tags stays below an acceptable value. A tag may be missing (left unread) due to errors in the communication link towards the reader e.g. due to obstacles in the radio path. The present paper proposes techniques that use multiple reader sessions, during which the system of readers obtains a running estimate of the probability to have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2441","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFzf9ibG97qXcfVYA6cFCP61ctE4Evw9SiJI5foj94j5OSs6ek5ldLCvd+wkTvgqXNhpFBPqkEQZPko4rXT4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:21:03.005486Z"},"content_sha256":"c1a0fa8953c6a4b518594c105f42f39cf4fa02338d6e7fd7116eed65bcaf739f","schema_version":"1.0","event_id":"sha256:c1a0fa8953c6a4b518594c105f42f39cf4fa02338d6e7fd7116eed65bcaf739f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/bundle.json","state_url":"https://pith.science/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/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-05-26T11:21:03Z","links":{"resolver":"https://pith.science/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ","bundle":"https://pith.science/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/bundle.json","state":"https://pith.science/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5Z3CUTI43MKXSMRRBTPQHJ6RQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:O5Z3CUTI43MKXSMRRBTPQHJ6RQ","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":"11e2dd3a6741b9f11f9db8ad5655810f14cd1d6e09a87965d5cae1171436f68e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T07:33:40Z","title_canon_sha256":"e1d349446b24e50dc7e5c2fc8afe6508838bbbb8f51f67fed4a27ba06e424930"},"schema_version":"1.0","source":{"id":"0904.2441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2441","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2441v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2441","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"O5Z3CUTI43MK","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O5Z3CUTI43MKXSMR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O5Z3CUTI","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:c1a0fa8953c6a4b518594c105f42f39cf4fa02338d6e7fd7116eed65bcaf739f","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"Radio Frequency Identification (RFID) systems are gaining momentum in various applications of logistics, inventory, etc. A generic problem in such systems is to ensure that the RFID readers can reliably read a set of RFID tags, such that the probability of missing tags stays below an acceptable value. A tag may be missing (left unread) due to errors in the communication link towards the reader e.g. due to obstacles in the radio path. The present paper proposes techniques that use multiple reader sessions, during which the system of readers obtains a running estimate of the probability to have ","authors_text":"Karsten Fyhn Nielsen, Petar Popovski, Rasmus Jacobsen, Torben Larsen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T07:33:40Z","title":"Reliable Identification of RFID Tags Using Multiple Independent Reader Sessions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2441","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:0bbcc6471bd2227636cef5e9267f109fbcf854abf4529d4af1bfe392796c4fa7","target":"record","created_at":"2026-05-18T00:57:58Z","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":"11e2dd3a6741b9f11f9db8ad5655810f14cd1d6e09a87965d5cae1171436f68e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-16T07:33:40Z","title_canon_sha256":"e1d349446b24e50dc7e5c2fc8afe6508838bbbb8f51f67fed4a27ba06e424930"},"schema_version":"1.0","source":{"id":"0904.2441","kind":"arxiv","version":1}},"canonical_sha256":"7773b15268e6d8abc9918866f81d3e8c23d57606b65e664a279999b1c7d2278c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7773b15268e6d8abc9918866f81d3e8c23d57606b65e664a279999b1c7d2278c","first_computed_at":"2026-05-18T00:57:58.221152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.221152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7J5HtZ7TM860rL6d6QPipT/ZH4bza+SLj5IHKoFxhZu8EeVqxv1Ffxn99hff/V44duxCpnO7gLo9v2LSzwD2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.221563Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.2441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bbcc6471bd2227636cef5e9267f109fbcf854abf4529d4af1bfe392796c4fa7","sha256:c1a0fa8953c6a4b518594c105f42f39cf4fa02338d6e7fd7116eed65bcaf739f"],"state_sha256":"bc979a3e644e33699138c6cafd77f6f64ea605a8a8e09b882496f0fd6b5ca841"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTJz4gjAeWYh0EvbHqBChJX0ENv/DK6ygqzPWAfcpkWHiTpeUs96JIoyXYEiMf+7pnDfe9J3ZyGw5fqGIYc2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:21:03.009252Z","bundle_sha256":"01b0e9c0de8a6a5ef6cf0eba6da0704805825bc099e6b0f0a1170eef8ea68bf5"}}