{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TYKFGPEJIOGRFONMLOCI5ALWKQ","short_pith_number":"pith:TYKFGPEJ","schema_version":"1.0","canonical_sha256":"9e14533c89438d12b9ac5b848e81765435717b26de39d7c973f5d6e7bb067afc","source":{"kind":"arxiv","id":"1712.05122","version":2},"attestation_state":"computed","paper":{"title":"A time-efficient frame size adjustment based approach for RFID anti-collision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haipeng Chen, Jian Su, Kexiong Liu, Yu Han","submitted_at":"2017-12-14T08:23:13Z","abstract_excerpt":"Fast and efficient identify a large number of RFID tags in the region of interest is a critical issue in various RFID applications. In this paper, a novel sub-frame-based algorithm with a time-efficient frame size adjustment strategy to reduce the time complexity for EPCglobal C1 Gen2 UHF RFID standard is proposed. By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags. Only when the expected time efficiency in the oncoming frame is higher than that in the previous frame,"},"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":"1712.05122","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-14T08:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"0b26719f9e46a3f4562b67c0203e3bb1fa1d3a731e78ffd68195ce90ab04daa3","abstract_canon_sha256":"25951b7eead6f1ec734d7f2315ac11c9b4675d8c08e81d56de6ac0e4da5e3cdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:21.408410Z","signature_b64":"0ZHe03+m7mgnZ95yS5cO0K/nepKE36rNCR2fsy7GcdqXHCHbCAMinxudou1EDbuyJ1IwpForSo94BZFivFIBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e14533c89438d12b9ac5b848e81765435717b26de39d7c973f5d6e7bb067afc","last_reissued_at":"2026-05-18T00:16:21.408026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:21.408026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A time-efficient frame size adjustment based approach for RFID anti-collision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haipeng Chen, Jian Su, Kexiong Liu, Yu Han","submitted_at":"2017-12-14T08:23:13Z","abstract_excerpt":"Fast and efficient identify a large number of RFID tags in the region of interest is a critical issue in various RFID applications. In this paper, a novel sub-frame-based algorithm with a time-efficient frame size adjustment strategy to reduce the time complexity for EPCglobal C1 Gen2 UHF RFID standard is proposed. By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags. Only when the expected time efficiency in the oncoming frame is higher than that in the previous frame,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05122","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":"1712.05122","created_at":"2026-05-18T00:16:21.408080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05122v2","created_at":"2026-05-18T00:16:21.408080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05122","created_at":"2026-05-18T00:16:21.408080+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYKFGPEJIOGR","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYKFGPEJIOGRFONM","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYKFGPEJ","created_at":"2026-05-18T12:31:46.661854+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/TYKFGPEJIOGRFONMLOCI5ALWKQ","json":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ.json","graph_json":"https://pith.science/api/pith-number/TYKFGPEJIOGRFONMLOCI5ALWKQ/graph.json","events_json":"https://pith.science/api/pith-number/TYKFGPEJIOGRFONMLOCI5ALWKQ/events.json","paper":"https://pith.science/paper/TYKFGPEJ"},"agent_actions":{"view_html":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ","download_json":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ.json","view_paper":"https://pith.science/paper/TYKFGPEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05122&json=true","fetch_graph":"https://pith.science/api/pith-number/TYKFGPEJIOGRFONMLOCI5ALWKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TYKFGPEJIOGRFONMLOCI5ALWKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ/action/storage_attestation","attest_author":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ/action/author_attestation","sign_citation":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ/action/citation_signature","submit_replication":"https://pith.science/pith/TYKFGPEJIOGRFONMLOCI5ALWKQ/action/replication_record"}},"created_at":"2026-05-18T00:16:21.408080+00:00","updated_at":"2026-05-18T00:16:21.408080+00:00"}