{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MPWCSL7IBLOIPUMTRXNNEM27NT","short_pith_number":"pith:MPWCSL7I","canonical_record":{"source":{"id":"1112.1086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-05T21:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"07cb5f444e5014602a880d3f35e3569ce7de00d863bc6240c7a92c98d4dd4367","abstract_canon_sha256":"aaaba267df4c921001dc2966c22499c8c1db7eee7208b6f4ec089f59aeab0eac"},"schema_version":"1.0"},"canonical_sha256":"63ec292fe80adc87d1938ddad2335f6cd5a0804e9f48db4876042adc2115216f","source":{"kind":"arxiv","id":"1112.1086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1086","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1086v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1086","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"MPWCSL7IBLOI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MPWCSL7IBLOIPUMT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MPWCSL7I","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MPWCSL7IBLOIPUMTRXNNEM27NT","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-05T21:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"07cb5f444e5014602a880d3f35e3569ce7de00d863bc6240c7a92c98d4dd4367","abstract_canon_sha256":"aaaba267df4c921001dc2966c22499c8c1db7eee7208b6f4ec089f59aeab0eac"},"schema_version":"1.0"},"canonical_sha256":"63ec292fe80adc87d1938ddad2335f6cd5a0804e9f48db4876042adc2115216f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.223283Z","signature_b64":"RlIXTVmpP/cz0nZLD1XX3Aj2v4IQpwe3d/PYHMIdQ+Li6FWcB4cbLP7KTDsTlHq3h1TGftiTKfWIaDnmfQZgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63ec292fe80adc87d1938ddad2335f6cd5a0804e9f48db4876042adc2115216f","last_reissued_at":"2026-05-18T00:58:43.222667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.222667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1086","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVOA2p5VrocnWh5kbcnE69J9O8pQ54vGZCqL6VXhiolPtEsKJ93wzdEAyh4frQs89qh5BlSiBvVS4xuidcxyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:56.338109Z"},"content_sha256":"fa1d9051e8a32c404ece73bc8449c45afd4ef6e6c0a946f4294154ea8d524478","schema_version":"1.0","event_id":"sha256:fa1d9051e8a32c404ece73bc8449c45afd4ef6e6c0a946f4294154ea8d524478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MPWCSL7IBLOIPUMTRXNNEM27NT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantitative Analysis for Authentication of Low-cost RFID Tags","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ioannis Paparrizos, Sophia Petridou, Stylianos Basagiannis","submitted_at":"2011-12-05T21:06:17Z","abstract_excerpt":"Formal analysis techniques are widely used today in order to verify and analyze communication protocols. In this work, we launch a quantitative verification analysis for the low- cost Radio Frequency Identification (RFID) protocol proposed by Song and Mitchell. The analysis exploits a Discrete-Time Markov Chain (DTMC) using the well-known PRISM model checker. We have managed to represent up to 100 RFID tags communicating with a reader and quantify each RFID session according to the protocol's computation and transmission cost requirements. As a consequence, not only does the proposed analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1086","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqyNud9Tn2WyrP4f03AqOYbEsxMkG0NjCFMXkv8uRP01O69//fmQwly5xIRMPs3LXYZqf9a8Yde9MBv3ah8mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:56.338471Z"},"content_sha256":"31d269203bc3a620b9fb6ced4fe6df6e65183f018f212e642639c930952ab26f","schema_version":"1.0","event_id":"sha256:31d269203bc3a620b9fb6ced4fe6df6e65183f018f212e642639c930952ab26f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/bundle.json","state_url":"https://pith.science/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/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-02T19:24:56Z","links":{"resolver":"https://pith.science/pith/MPWCSL7IBLOIPUMTRXNNEM27NT","bundle":"https://pith.science/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/bundle.json","state":"https://pith.science/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPWCSL7IBLOIPUMTRXNNEM27NT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MPWCSL7IBLOIPUMTRXNNEM27NT","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":"aaaba267df4c921001dc2966c22499c8c1db7eee7208b6f4ec089f59aeab0eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-05T21:06:17Z","title_canon_sha256":"07cb5f444e5014602a880d3f35e3569ce7de00d863bc6240c7a92c98d4dd4367"},"schema_version":"1.0","source":{"id":"1112.1086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1086","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1086v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1086","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"MPWCSL7IBLOI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MPWCSL7IBLOIPUMT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MPWCSL7I","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:31d269203bc3a620b9fb6ced4fe6df6e65183f018f212e642639c930952ab26f","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"Formal analysis techniques are widely used today in order to verify and analyze communication protocols. In this work, we launch a quantitative verification analysis for the low- cost Radio Frequency Identification (RFID) protocol proposed by Song and Mitchell. The analysis exploits a Discrete-Time Markov Chain (DTMC) using the well-known PRISM model checker. We have managed to represent up to 100 RFID tags communicating with a reader and quantify each RFID session according to the protocol's computation and transmission cost requirements. As a consequence, not only does the proposed analysis ","authors_text":"Ioannis Paparrizos, Sophia Petridou, Stylianos Basagiannis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-05T21:06:17Z","title":"Quantitative Analysis for Authentication of Low-cost RFID Tags"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1086","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:fa1d9051e8a32c404ece73bc8449c45afd4ef6e6c0a946f4294154ea8d524478","target":"record","created_at":"2026-05-18T00:58:43Z","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":"aaaba267df4c921001dc2966c22499c8c1db7eee7208b6f4ec089f59aeab0eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-05T21:06:17Z","title_canon_sha256":"07cb5f444e5014602a880d3f35e3569ce7de00d863bc6240c7a92c98d4dd4367"},"schema_version":"1.0","source":{"id":"1112.1086","kind":"arxiv","version":1}},"canonical_sha256":"63ec292fe80adc87d1938ddad2335f6cd5a0804e9f48db4876042adc2115216f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63ec292fe80adc87d1938ddad2335f6cd5a0804e9f48db4876042adc2115216f","first_computed_at":"2026-05-18T00:58:43.222667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.222667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RlIXTVmpP/cz0nZLD1XX3Aj2v4IQpwe3d/PYHMIdQ+Li6FWcB4cbLP7KTDsTlHq3h1TGftiTKfWIaDnmfQZgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.223283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa1d9051e8a32c404ece73bc8449c45afd4ef6e6c0a946f4294154ea8d524478","sha256:31d269203bc3a620b9fb6ced4fe6df6e65183f018f212e642639c930952ab26f"],"state_sha256":"c42c364ab1a4641449f8fd989ac68b3c73d066b87c04ac227ce4ff0e8e8ef3a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2fiXgHtFtLSdZ4eB+BfclzMM11sVcnWbWNWJ6PElekMURanlFyIX2vVkSn7CBBzUcRCFnx7KZihttNy/oX5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:24:56.340408Z","bundle_sha256":"bad81e8731f02f1990eb555472cf405430593885c138b64beca607b952aef87e"}}