{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4TKA75IBQST4PFZFNLLAXPTPWK","short_pith_number":"pith:4TKA75IB","schema_version":"1.0","canonical_sha256":"e4d40ff50184a7c797256ad60bbe6fb292eb8bece312e93b74b1875045b669cd","source":{"kind":"arxiv","id":"1609.03717","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.03717","created_at":"2026-05-18T01:04:42.634104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03717v1","created_at":"2026-05-18T01:04:42.634104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03717","created_at":"2026-05-18T01:04:42.634104+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TKA75IBQST4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TKA75IBQST4PFZF","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TKA75IB","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK","json":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK.json","graph_json":"https://pith.science/api/pith-number/4TKA75IBQST4PFZFNLLAXPTPWK/graph.json","events_json":"https://pith.science/api/pith-number/4TKA75IBQST4PFZFNLLAXPTPWK/events.json","paper":"https://pith.science/paper/4TKA75IB"},"agent_actions":{"view_html":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK","download_json":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK.json","view_paper":"https://pith.science/paper/4TKA75IB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03717&json=true","fetch_graph":"https://pith.science/api/pith-number/4TKA75IBQST4PFZFNLLAXPTPWK/graph.json","fetch_events":"https://pith.science/api/pith-number/4TKA75IBQST4PFZFNLLAXPTPWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/action/storage_attestation","attest_author":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/action/author_attestation","sign_citation":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/action/citation_signature","submit_replication":"https://pith.science/pith/4TKA75IBQST4PFZFNLLAXPTPWK/action/replication_record"}},"created_at":"2026-05-18T01:04:42.634104+00:00","updated_at":"2026-05-18T01:04:42.634104+00:00"}