{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4TKA75IBQST4PFZFNLLAXPTPWK","short_pith_number":"pith:4TKA75IB","canonical_record":{"source":{"id":"1609.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-13T07:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"cf252ae740a7773cc4a02deeb2857a54a7e235f689c188d01715a7247e4443e1","abstract_canon_sha256":"2e33ff5d4a7cb600c55dd0ca455efcf9844df930e173c3e2bb9d8f6b84d74e4f"},"schema_version":"1.0"},"canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","source":{"kind":"arxiv","id":"1609.03717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03717","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03717v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03717","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"4TKA75IBQST4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4TKA75IBQST4PFZF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4TKA75IB","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4TKA75IBQST4PFZFNLLAXPTPWK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-13T07:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"cf252ae740a7773cc4a02deeb2857a54a7e235f689c188d01715a7247e4443e1","abstract_canon_sha256":"2e33ff5d4a7cb600c55dd0ca455efcf9844df930e173c3e2bb9d8f6b84d74e4f"},"schema_version":"1.0"},"canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.634641Z","signature_b64":"owDEjMVxioLq510fTf4/wAoJAyhVisNWVpItuOKSRtP6A8pFRyPMMuOk9WXlTkDOcU5DK/1tcJWRPQEkwvLACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","last_reissued_at":"2026-05-18T01:04:42.634018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.634018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03717","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-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+hO6eDwG+KWKqCxpuy3Ituf5vpj7hVQg5QMVUAFv8BEbM6HmGDsiLp23xtHDXH3orsGTZtYnen5iW+Iio6bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:42:50.500036Z"},"content_sha256":"e2b03e0dc357fdd597177c8f12bcfc456d683764733f2502db91d3b55be40616","schema_version":"1.0","event_id":"sha256:e2b03e0dc357fdd597177c8f12bcfc456d683764733f2502db91d3b55be40616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4TKA75IBQST4PFZFNLLAXPTPWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Proximity-aware Resource Allocation in Vehicle-to-Vehicle (V2V) Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Cristina Perfecto, Mehdi Bennis, Muhammad Ikram Ashraf, Walid Saad","submitted_at":"2016-09-13T07:50:32Z","abstract_excerpt":"In this paper, a novel proximity and load-aware resource allocation for vehicle-to-vehicle (V2V) communication is proposed. The proposed approach exploits the spatio-temporal traffic patterns, in terms of load and vehicles' physical proximity, to minimize the total network cost which captures the tradeoffs between load (i.e., service delay) and successful transmissions while satisfying vehicles's quality-of-service (QoS) requirements. To solve the optimization problem under slowly varying channel information, it is decoupled the problem into two interrelated subproblems. First, a dynamic clust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03717","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-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wdg/U5fIX5fEXQJKloO5nWq2wlSmv1MMF6MUDp7CW2W57wBRO7SteiOx4IvJFrruuCe6sUOepO8nLy30mV9XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:42:50.500673Z"},"content_sha256":"49abafc888cabb2e90ac9cfd507f8dff9573c4194233f6d9b7bcd684cea0c7c1","schema_version":"1.0","event_id":"sha256:49abafc888cabb2e90ac9cfd507f8dff9573c4194233f6d9b7bcd684cea0c7c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/bundle.json","state_url":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TKA75IBQST4PFZFNLLAXPTPWK/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-05-27T01:42:50Z","links":{"resolver":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK","bundle":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/bundle.json","state":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TKA75IBQST4PFZFNLLAXPTPWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4TKA75IBQST4PFZFNLLAXPTPWK","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":"2e33ff5d4a7cb600c55dd0ca455efcf9844df930e173c3e2bb9d8f6b84d74e4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-13T07:50:32Z","title_canon_sha256":"cf252ae740a7773cc4a02deeb2857a54a7e235f689c188d01715a7247e4443e1"},"schema_version":"1.0","source":{"id":"1609.03717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03717","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03717v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03717","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"4TKA75IBQST4","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4TKA75IBQST4PFZF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4TKA75IB","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:49abafc888cabb2e90ac9cfd507f8dff9573c4194233f6d9b7bcd684cea0c7c1","target":"graph","created_at":"2026-05-18T01:04:42Z","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 this paper, a novel proximity and load-aware resource allocation for vehicle-to-vehicle (V2V) communication is proposed. The proposed approach exploits the spatio-temporal traffic patterns, in terms of load and vehicles' physical proximity, to minimize the total network cost which captures the tradeoffs between load (i.e., service delay) and successful transmissions while satisfying vehicles's quality-of-service (QoS) requirements. To solve the optimization problem under slowly varying channel information, it is decoupled the problem into two interrelated subproblems. First, a dynamic clust","authors_text":"Cristina Perfecto, Mehdi Bennis, Muhammad Ikram Ashraf, Walid Saad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-13T07:50:32Z","title":"Dynamic Proximity-aware Resource Allocation in Vehicle-to-Vehicle (V2V) Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03717","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:e2b03e0dc357fdd597177c8f12bcfc456d683764733f2502db91d3b55be40616","target":"record","created_at":"2026-05-18T01:04:42Z","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":"2e33ff5d4a7cb600c55dd0ca455efcf9844df930e173c3e2bb9d8f6b84d74e4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-13T07:50:32Z","title_canon_sha256":"cf252ae740a7773cc4a02deeb2857a54a7e235f689c188d01715a7247e4443e1"},"schema_version":"1.0","source":{"id":"1609.03717","kind":"arxiv","version":1}},"canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","first_computed_at":"2026-05-18T01:04:42.634018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:42.634018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"owDEjMVxioLq510fTf4/wAoJAyhVisNWVpItuOKSRtP6A8pFRyPMMuOk9WXlTkDOcU5DK/1tcJWRPQEkwvLACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:42.634641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2b03e0dc357fdd597177c8f12bcfc456d683764733f2502db91d3b55be40616","sha256:49abafc888cabb2e90ac9cfd507f8dff9573c4194233f6d9b7bcd684cea0c7c1"],"state_sha256":"9c4b3745eca48ff9516ea561defec62035018b3c53f438e56d94c6cf9e6d5bd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVBiikwGVjbRHaCB1z54tK0IPrvvpAd1VZTO5OJYx65pHaSwkMUaSQTAs4i4qCHsqz0J9qafEvjBOJ8cHrHdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:42:50.504130Z","bundle_sha256":"bd126cad403458097083dfad0290b3feea69f0419df03cc33eaa61cbd583c0f1"}}