{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S3XMXKYZS3OWNHNPZMJWOYPUI2","short_pith_number":"pith:S3XMXKYZ","canonical_record":{"source":{"id":"1704.04053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T09:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"7fc821a33d14abed461c362e699b09649d287f70eb4ace0d8a14070dca6f300a","abstract_canon_sha256":"6de3fc7c4047d2fa81085ce70dfb4d173859039172d0ccedf40f8b62b90a5e84"},"schema_version":"1.0"},"canonical_sha256":"96eecbab1996dd669dafcb136761f446874903225f52b2e31d7ce66b8e6c0914","source":{"kind":"arxiv","id":"1704.04053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04053","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04053v2","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04053","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"S3XMXKYZS3OW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3XMXKYZS3OWNHNP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3XMXKYZ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S3XMXKYZS3OWNHNPZMJWOYPUI2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T09:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"7fc821a33d14abed461c362e699b09649d287f70eb4ace0d8a14070dca6f300a","abstract_canon_sha256":"6de3fc7c4047d2fa81085ce70dfb4d173859039172d0ccedf40f8b62b90a5e84"},"schema_version":"1.0"},"canonical_sha256":"96eecbab1996dd669dafcb136761f446874903225f52b2e31d7ce66b8e6c0914","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:46.443924Z","signature_b64":"Xq0qBD/h0wgEjJM/WJkkhW/D+5mJ2xvofuQ/rB4vChc2HsjmZzB76odbhxaNZEvDZluzpcxsHJYoizZ9ONsxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96eecbab1996dd669dafcb136761f446874903225f52b2e31d7ce66b8e6c0914","last_reissued_at":"2026-05-18T00:21:46.443336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:46.443336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04053","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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSaz76Z0prDIlx7AgMK1DmeJk3wp75ZdGWCnGhzC5JAe7W58+9+iuM21XOflxBMcgrRYd/apPCFK51gODTHxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:32:16.509744Z"},"content_sha256":"843120eaad02f785c417050df43222d04cf4f2ea43c6f89ebe1d5baaefbe8aec","schema_version":"1.0","event_id":"sha256:843120eaad02f785c417050df43222d04cf4f2ea43c6f89ebe1d5baaefbe8aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S3XMXKYZS3OWNHNPZMJWOYPUI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling a Traffic Remapping Attack Game in a Multi-hop Ad Hoc Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jerzy Konorski, Szymon Szott","submitted_at":"2017-04-13T09:37:24Z","abstract_excerpt":"In multi-hop ad hoc networks, selfish nodes may unduly acquire high quality of service (QoS) by assigning higher priority to source packets and lower priority to transit packets. Such traffic remapping attacks (TRAs) are cheap to launch, impossible to prevent, hard to detect, and harmful to non-selfish nodes. While studied mostly in single-hop wireless network settings, TRAs have resisted analysis in multi-hop settings. In this paper we offer a game-theoretic approach: we derive a formal model of opportunistic TRAs, define a TRA game with a heuristic rank-based payoff function, and propose a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04053","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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LdbaRMjEcyWO4xqJdYRg7xcfK9d27wOJQv6Op8M/auCiUxo9RhCK5BSy7IGjcuX3hs2tffQc6xhPGJ1aut4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:32:16.510083Z"},"content_sha256":"b1e5c413944cd06b8ccd5097abe935083025cc31c2b7255f81323b0f452d81cc","schema_version":"1.0","event_id":"sha256:b1e5c413944cd06b8ccd5097abe935083025cc31c2b7255f81323b0f452d81cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/bundle.json","state_url":"https://pith.science/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/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-11T10:32:16Z","links":{"resolver":"https://pith.science/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2","bundle":"https://pith.science/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/bundle.json","state":"https://pith.science/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3XMXKYZS3OWNHNPZMJWOYPUI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S3XMXKYZS3OWNHNPZMJWOYPUI2","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":"6de3fc7c4047d2fa81085ce70dfb4d173859039172d0ccedf40f8b62b90a5e84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T09:37:24Z","title_canon_sha256":"7fc821a33d14abed461c362e699b09649d287f70eb4ace0d8a14070dca6f300a"},"schema_version":"1.0","source":{"id":"1704.04053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04053","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04053v2","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04053","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"S3XMXKYZS3OW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3XMXKYZS3OWNHNP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3XMXKYZ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:b1e5c413944cd06b8ccd5097abe935083025cc31c2b7255f81323b0f452d81cc","target":"graph","created_at":"2026-05-18T00:21:46Z","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":"In multi-hop ad hoc networks, selfish nodes may unduly acquire high quality of service (QoS) by assigning higher priority to source packets and lower priority to transit packets. Such traffic remapping attacks (TRAs) are cheap to launch, impossible to prevent, hard to detect, and harmful to non-selfish nodes. While studied mostly in single-hop wireless network settings, TRAs have resisted analysis in multi-hop settings. In this paper we offer a game-theoretic approach: we derive a formal model of opportunistic TRAs, define a TRA game with a heuristic rank-based payoff function, and propose a b","authors_text":"Jerzy Konorski, Szymon Szott","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T09:37:24Z","title":"Modeling a Traffic Remapping Attack Game in a Multi-hop Ad Hoc Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04053","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:843120eaad02f785c417050df43222d04cf4f2ea43c6f89ebe1d5baaefbe8aec","target":"record","created_at":"2026-05-18T00:21:46Z","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":"6de3fc7c4047d2fa81085ce70dfb4d173859039172d0ccedf40f8b62b90a5e84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-13T09:37:24Z","title_canon_sha256":"7fc821a33d14abed461c362e699b09649d287f70eb4ace0d8a14070dca6f300a"},"schema_version":"1.0","source":{"id":"1704.04053","kind":"arxiv","version":2}},"canonical_sha256":"96eecbab1996dd669dafcb136761f446874903225f52b2e31d7ce66b8e6c0914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96eecbab1996dd669dafcb136761f446874903225f52b2e31d7ce66b8e6c0914","first_computed_at":"2026-05-18T00:21:46.443336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:46.443336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xq0qBD/h0wgEjJM/WJkkhW/D+5mJ2xvofuQ/rB4vChc2HsjmZzB76odbhxaNZEvDZluzpcxsHJYoizZ9ONsxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:46.443924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:843120eaad02f785c417050df43222d04cf4f2ea43c6f89ebe1d5baaefbe8aec","sha256:b1e5c413944cd06b8ccd5097abe935083025cc31c2b7255f81323b0f452d81cc"],"state_sha256":"70d1f20ee6b6df64d730bea0a66d1a582b55dc4dc8e2ad443d160116c026e0ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAB1g24BU7ZcwtJbIq4tYaAazYdvBzhdYe8ndCQ4FKQjSJ0P9afjp08gfM+kXdkqdOaWp4rN1RLyD4S3UasLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:32:16.512209Z","bundle_sha256":"ed59010226e4db55dac2154eb1a42c7c2014583baaee5c920cabd49e8d1c2383"}}