{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U4FC237DXRA24T724QY5DXIRDQ","short_pith_number":"pith:U4FC237D","canonical_record":{"source":{"id":"1412.6016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"54f3b7324daa787345cdbfd03e2d6b39d37e6be9d8e8d470b1883a9b45470be1","abstract_canon_sha256":"aca85069b661af8bdeb8da734f319531edcaa485f4e45b8b995e727363899068"},"schema_version":"1.0"},"canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","source":{"kind":"arxiv","id":"1412.6016","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6016","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6016v1","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6016","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"U4FC237DXRA2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U4FC237DXRA24T72","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U4FC237D","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U4FC237DXRA24T724QY5DXIRDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"54f3b7324daa787345cdbfd03e2d6b39d37e6be9d8e8d470b1883a9b45470be1","abstract_canon_sha256":"aca85069b661af8bdeb8da734f319531edcaa485f4e45b8b995e727363899068"},"schema_version":"1.0"},"canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.696002Z","signature_b64":"Jpnv9PzqITo4me6B4D47s4uzASL/22GFk5zvT6YH4zFCMoscsybUbs0JLJZQ1NnjUBDmBZ305WBTo1V7+bD+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","last_reissued_at":"2026-05-18T02:30:55.695478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.695478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6016","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-18T02:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5KTIs4D5b368UmG1v8UfQO29Jo7uBuVB1yV3gqBqDd0aHslvKSwfiv9BHDM5sY7Y7tkMUTL65QOrvcSGO3JpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:26:41.063087Z"},"content_sha256":"dd277112f12bb9ed8fab900e50aff4bddcefd1f57fc227396b0df8dfbd1b0b38","schema_version":"1.0","event_id":"sha256:dd277112f12bb9ed8fab900e50aff4bddcefd1f57fc227396b0df8dfbd1b0b38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U4FC237DXRA24T724QY5DXIRDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of distance fraud attacks in graph-based distance bounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Rolando Trujillo-Rasua","submitted_at":"2014-11-19T16:06:29Z","abstract_excerpt":"Distance bounding (DB) emerged as a countermeasure to the so-called \\emph{relay attack}, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $G = (V, E)$ and a vertex $v \\in V$, is able to find the most frequent $n$-long sequence in $G$ starting from $v$ (MFS problem). However, to the best of our knowledge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6016","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-18T02:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGdnI/pgC8AB/+Fa+BKcAq0uMbexxJEzSXnk6lHkNp3OUalek0fLwLnvXw9+pfBUGjxvCocPmGVsBPVn53sKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:26:41.063450Z"},"content_sha256":"13e537ec7815f14d0fe750b3554611ebc63c381fe1375487406e794280a1129d","schema_version":"1.0","event_id":"sha256:13e537ec7815f14d0fe750b3554611ebc63c381fe1375487406e794280a1129d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/bundle.json","state_url":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4FC237DXRA24T724QY5DXIRDQ/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-02T18:26:41Z","links":{"resolver":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ","bundle":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/bundle.json","state":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4FC237DXRA24T724QY5DXIRDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U4FC237DXRA24T724QY5DXIRDQ","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":"aca85069b661af8bdeb8da734f319531edcaa485f4e45b8b995e727363899068","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","title_canon_sha256":"54f3b7324daa787345cdbfd03e2d6b39d37e6be9d8e8d470b1883a9b45470be1"},"schema_version":"1.0","source":{"id":"1412.6016","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6016","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6016v1","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6016","created_at":"2026-05-18T02:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"U4FC237DXRA2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U4FC237DXRA24T72","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U4FC237D","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:13e537ec7815f14d0fe750b3554611ebc63c381fe1375487406e794280a1129d","target":"graph","created_at":"2026-05-18T02:30:55Z","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":"Distance bounding (DB) emerged as a countermeasure to the so-called \\emph{relay attack}, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $G = (V, E)$ and a vertex $v \\in V$, is able to find the most frequent $n$-long sequence in $G$ starting from $v$ (MFS problem). However, to the best of our knowledge","authors_text":"Rolando Trujillo-Rasua","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","title":"Complexity of distance fraud attacks in graph-based distance bounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6016","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:dd277112f12bb9ed8fab900e50aff4bddcefd1f57fc227396b0df8dfbd1b0b38","target":"record","created_at":"2026-05-18T02:30:55Z","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":"aca85069b661af8bdeb8da734f319531edcaa485f4e45b8b995e727363899068","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","title_canon_sha256":"54f3b7324daa787345cdbfd03e2d6b39d37e6be9d8e8d470b1883a9b45470be1"},"schema_version":"1.0","source":{"id":"1412.6016","kind":"arxiv","version":1}},"canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","first_computed_at":"2026-05-18T02:30:55.695478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:55.695478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jpnv9PzqITo4me6B4D47s4uzASL/22GFk5zvT6YH4zFCMoscsybUbs0JLJZQ1NnjUBDmBZ305WBTo1V7+bD+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:55.696002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6016","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd277112f12bb9ed8fab900e50aff4bddcefd1f57fc227396b0df8dfbd1b0b38","sha256:13e537ec7815f14d0fe750b3554611ebc63c381fe1375487406e794280a1129d"],"state_sha256":"67d8ae9f78e38a15cc7fd212a4a40c2d3e4201dbc5609c6743aae6ebd6739bfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O4/H6RhXVOzuXK6vdqwxOHs3UrlvvjLIWePjcoItxckCg/uhHZJ51iilOPzFenJXZJ+HjgkPse/o/HzDfggDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:26:41.065397Z","bundle_sha256":"7becd9e9978f05c2eed9b627789a460054b39e63a9ff4163673db976caec1fd5"}}