{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VLBTR7R4M6GHW3TCVU354VQFUI","short_pith_number":"pith:VLBTR7R4","canonical_record":{"source":{"id":"2204.00159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-01T02:02:31Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"ee2a6098b5006fde8a647fc3fba0eced51dee6a86ad2abf2e095d25f25a262c8","abstract_canon_sha256":"af9bacb11e1eaeaea18cf38ec9a945df55bf0c5064ead86e676be9df9083bafd"},"schema_version":"1.0"},"canonical_sha256":"aac338fe3c678c7b6e62ad37de5605a22c14bf348be098698a848f0027fd21e6","source":{"kind":"arxiv","id":"2204.00159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.00159","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2204.00159v1","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.00159","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"VLBTR7R4M6GH","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"VLBTR7R4M6GHW3TC","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"VLBTR7R4","created_at":"2026-07-05T04:10:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VLBTR7R4M6GHW3TCVU354VQFUI","target":"record","payload":{"canonical_record":{"source":{"id":"2204.00159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-01T02:02:31Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"ee2a6098b5006fde8a647fc3fba0eced51dee6a86ad2abf2e095d25f25a262c8","abstract_canon_sha256":"af9bacb11e1eaeaea18cf38ec9a945df55bf0c5064ead86e676be9df9083bafd"},"schema_version":"1.0"},"canonical_sha256":"aac338fe3c678c7b6e62ad37de5605a22c14bf348be098698a848f0027fd21e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:43.748628Z","signature_b64":"+mewEe8A+8f5WcMa8s21c+IeHxo+ajjKcCj2Ql6OEgK/8RGWDx1Q4m+KYosVGnO0WQBRfgnkLOoeWMUI5zm8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac338fe3c678c7b6e62ad37de5605a22c14bf348be098698a848f0027fd21e6","last_reissued_at":"2026-07-05T04:10:43.748203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:43.748203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.00159","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-07-05T04:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HA04hxrPpbSXVd2mY0g14PLzPTIES615NMvSI6FPUqFbtnNaME6lnJ945KjzrPcSg7Hc4/UZ0MGrsFT3aJrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:08:15.970287Z"},"content_sha256":"5635c5cd9670c7ce4d5847020f2dfc37f835e2f43951d068d02c2abcf341fc07","schema_version":"1.0","event_id":"sha256:5635c5cd9670c7ce4d5847020f2dfc37f835e2f43951d068d02c2abcf341fc07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VLBTR7R4M6GHW3TCVU354VQFUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure and Ultra-Reliable Provenance Recovery in Sparse Networks: Strategies and Performance Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Huzur Saran, J. Harshan, Manish Bansal, Sriraam S V, Suraj Sajeev, Yih-Chun Hu","submitted_at":"2022-04-01T02:02:31Z","abstract_excerpt":"Provenance embedding algorithms are well known for tracking the footprints of information flow in wireless networks. Recently, low-latency provenance embedding algorithms have received traction in vehicular networks owing to strict deadlines on the delivery of packets. While existing low-latency provenance embedding methods focus on reducing the packet delay, they assume a complete graph on the underlying topology due to the mobility of the participating nodes. We identify that the complete graph assumption leads to sub-optimal performance in provenance recovery, especially when the vehicular "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.00159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.00159/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mioCgME5WvDnqAn69qq4TFnL/skIdUgHK6cGn0CbAUqUDKCOmyJthotwph8Bj6dpC/6GwF5RubuXSf4TVuJeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:08:15.971055Z"},"content_sha256":"61b0870cae076b87d053e7c2a200ed2925ca6d0ca181c2210ff0cb3e99a76487","schema_version":"1.0","event_id":"sha256:61b0870cae076b87d053e7c2a200ed2925ca6d0ca181c2210ff0cb3e99a76487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLBTR7R4M6GHW3TCVU354VQFUI/bundle.json","state_url":"https://pith.science/pith/VLBTR7R4M6GHW3TCVU354VQFUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLBTR7R4M6GHW3TCVU354VQFUI/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-08-23T07:08:15Z","links":{"resolver":"https://pith.science/pith/VLBTR7R4M6GHW3TCVU354VQFUI","bundle":"https://pith.science/pith/VLBTR7R4M6GHW3TCVU354VQFUI/bundle.json","state":"https://pith.science/pith/VLBTR7R4M6GHW3TCVU354VQFUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLBTR7R4M6GHW3TCVU354VQFUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VLBTR7R4M6GHW3TCVU354VQFUI","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":"af9bacb11e1eaeaea18cf38ec9a945df55bf0c5064ead86e676be9df9083bafd","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-01T02:02:31Z","title_canon_sha256":"ee2a6098b5006fde8a647fc3fba0eced51dee6a86ad2abf2e095d25f25a262c8"},"schema_version":"1.0","source":{"id":"2204.00159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.00159","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2204.00159v1","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.00159","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"VLBTR7R4M6GH","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"VLBTR7R4M6GHW3TC","created_at":"2026-07-05T04:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"VLBTR7R4","created_at":"2026-07-05T04:10:43Z"}],"graph_snapshots":[{"event_id":"sha256:61b0870cae076b87d053e7c2a200ed2925ca6d0ca181c2210ff0cb3e99a76487","target":"graph","created_at":"2026-07-05T04:10: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.00159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Provenance embedding algorithms are well known for tracking the footprints of information flow in wireless networks. Recently, low-latency provenance embedding algorithms have received traction in vehicular networks owing to strict deadlines on the delivery of packets. While existing low-latency provenance embedding methods focus on reducing the packet delay, they assume a complete graph on the underlying topology due to the mobility of the participating nodes. We identify that the complete graph assumption leads to sub-optimal performance in provenance recovery, especially when the vehicular ","authors_text":"Huzur Saran, J. Harshan, Manish Bansal, Sriraam S V, Suraj Sajeev, Yih-Chun Hu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-01T02:02:31Z","title":"Secure and Ultra-Reliable Provenance Recovery in Sparse Networks: Strategies and Performance Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.00159","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:5635c5cd9670c7ce4d5847020f2dfc37f835e2f43951d068d02c2abcf341fc07","target":"record","created_at":"2026-07-05T04:10: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":"af9bacb11e1eaeaea18cf38ec9a945df55bf0c5064ead86e676be9df9083bafd","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-01T02:02:31Z","title_canon_sha256":"ee2a6098b5006fde8a647fc3fba0eced51dee6a86ad2abf2e095d25f25a262c8"},"schema_version":"1.0","source":{"id":"2204.00159","kind":"arxiv","version":1}},"canonical_sha256":"aac338fe3c678c7b6e62ad37de5605a22c14bf348be098698a848f0027fd21e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aac338fe3c678c7b6e62ad37de5605a22c14bf348be098698a848f0027fd21e6","first_computed_at":"2026-07-05T04:10:43.748203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:10:43.748203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mewEe8A+8f5WcMa8s21c+IeHxo+ajjKcCj2Ql6OEgK/8RGWDx1Q4m+KYosVGnO0WQBRfgnkLOoeWMUI5zm8AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:10:43.748628Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.00159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5635c5cd9670c7ce4d5847020f2dfc37f835e2f43951d068d02c2abcf341fc07","sha256:61b0870cae076b87d053e7c2a200ed2925ca6d0ca181c2210ff0cb3e99a76487"],"state_sha256":"a5ddad17814b914203e3e2ced955a8ea49c192f0736af22a7b008f22bd410ad2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qT+ObsS27u9oLGt7/0bE+UZ5iYGb+Hha8uMHoBbIg13+9yN9blGAMit85ODmDuY4MzMvWSO+UMa8Tbr7KUVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T07:08:15.976004Z","bundle_sha256":"be014152fbb3101eb60e83d64837b2c80947fe0c4786844b9b2afd2458d84340"}}