{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IHJQBOPTCQA2E4XPJCZMYKCG52","short_pith_number":"pith:IHJQBOPT","canonical_record":{"source":{"id":"1801.02679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T20:36:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5e453824c30d2d1dc7260ea0548fda4907175303e3413edc880bf923b6c1f4e","abstract_canon_sha256":"2308839dc3464480079d5cef8157afb69f9fae2692ba83447784a9b66d4d604e"},"schema_version":"1.0"},"canonical_sha256":"41d300b9f31401a272ef48b2cc2846eebd1fe8c16070df2d2ad8be7e65d81469","source":{"kind":"arxiv","id":"1801.02679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02679","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02679v1","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02679","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"IHJQBOPTCQA2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHJQBOPTCQA2E4XP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHJQBOPT","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IHJQBOPTCQA2E4XPJCZMYKCG52","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T20:36:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5e453824c30d2d1dc7260ea0548fda4907175303e3413edc880bf923b6c1f4e","abstract_canon_sha256":"2308839dc3464480079d5cef8157afb69f9fae2692ba83447784a9b66d4d604e"},"schema_version":"1.0"},"canonical_sha256":"41d300b9f31401a272ef48b2cc2846eebd1fe8c16070df2d2ad8be7e65d81469","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:22.765884Z","signature_b64":"0Wx2+7G6q3aIAMrwVqqUdDBv2wEiTq5OFIoht6ehwZZOylcljBIDb2UnSY3dIROoh9VHh23BNqcLFKCJ2h/iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d300b9f31401a272ef48b2cc2846eebd1fe8c16070df2d2ad8be7e65d81469","last_reissued_at":"2026-05-18T00:26:22.765058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:22.765058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02679","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-18T00:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXd6ayzNAMgEhY+9jYkVS5OjOEQwc2DexhWLyMOkLsvv6NeytIXw+tJrOnxh/GQM8msr/QY9H7hVGDb+I0apDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:20.594821Z"},"content_sha256":"66a55340736f6500802838ff9ec8ce81a09fa398a5bf1f5485cd35c2d8ac2c9a","schema_version":"1.0","event_id":"sha256:66a55340736f6500802838ff9ec8ce81a09fa398a5bf1f5485cd35c2d8ac2c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IHJQBOPTCQA2E4XPJCZMYKCG52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Based Radio Resource Management for Vehicular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Geoffrey Ye Li, Le Liang, Shijie Xie, Xingxing Yu, Zhi Ding","submitted_at":"2018-01-08T20:36:07Z","abstract_excerpt":"This paper investigates the resource allocation problem in device-to-device (D2D)-based vehicular communications, based on slow fading statistics of channel state information (CSI), to alleviate signaling overhead for reporting rapidly varying accurate CSI of mobile links. We consider the case when each vehicle-to-infrastructure (V2I) link shares spectrum with multiple vehicle-to-vehicle (V2V) links. Leveraging the slow fading statistical CSI of mobile links, we maximize the sum V2I capacity while guaranteeing the reliability of all V2V links. We propose a graph-based algorithm that uses graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02679","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-18T00:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6LJD9C5/LGM1PN4ukt9hsVCj+dcvJMPAMx4RW+0jMTDO67N4LRUjZs24oTUwAP5L1ka2SlzVuQ/Nzyd0Az2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:20.595472Z"},"content_sha256":"e85e8bc4f8d5ee48b20c8039c25ee10f95c0d8571455a9ec07dbde51c5f39cf6","schema_version":"1.0","event_id":"sha256:e85e8bc4f8d5ee48b20c8039c25ee10f95c0d8571455a9ec07dbde51c5f39cf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/bundle.json","state_url":"https://pith.science/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/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-25T17:58:20Z","links":{"resolver":"https://pith.science/pith/IHJQBOPTCQA2E4XPJCZMYKCG52","bundle":"https://pith.science/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/bundle.json","state":"https://pith.science/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHJQBOPTCQA2E4XPJCZMYKCG52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHJQBOPTCQA2E4XPJCZMYKCG52","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":"2308839dc3464480079d5cef8157afb69f9fae2692ba83447784a9b66d4d604e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T20:36:07Z","title_canon_sha256":"e5e453824c30d2d1dc7260ea0548fda4907175303e3413edc880bf923b6c1f4e"},"schema_version":"1.0","source":{"id":"1801.02679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02679","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02679v1","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02679","created_at":"2026-05-18T00:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"IHJQBOPTCQA2","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHJQBOPTCQA2E4XP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHJQBOPT","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e85e8bc4f8d5ee48b20c8039c25ee10f95c0d8571455a9ec07dbde51c5f39cf6","target":"graph","created_at":"2026-05-18T00:26:22Z","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":"This paper investigates the resource allocation problem in device-to-device (D2D)-based vehicular communications, based on slow fading statistics of channel state information (CSI), to alleviate signaling overhead for reporting rapidly varying accurate CSI of mobile links. We consider the case when each vehicle-to-infrastructure (V2I) link shares spectrum with multiple vehicle-to-vehicle (V2V) links. Leveraging the slow fading statistical CSI of mobile links, we maximize the sum V2I capacity while guaranteeing the reliability of all V2V links. We propose a graph-based algorithm that uses graph","authors_text":"Geoffrey Ye Li, Le Liang, Shijie Xie, Xingxing Yu, Zhi Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T20:36:07Z","title":"Graph-Based Radio Resource Management for Vehicular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02679","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:66a55340736f6500802838ff9ec8ce81a09fa398a5bf1f5485cd35c2d8ac2c9a","target":"record","created_at":"2026-05-18T00:26:22Z","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":"2308839dc3464480079d5cef8157afb69f9fae2692ba83447784a9b66d4d604e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T20:36:07Z","title_canon_sha256":"e5e453824c30d2d1dc7260ea0548fda4907175303e3413edc880bf923b6c1f4e"},"schema_version":"1.0","source":{"id":"1801.02679","kind":"arxiv","version":1}},"canonical_sha256":"41d300b9f31401a272ef48b2cc2846eebd1fe8c16070df2d2ad8be7e65d81469","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41d300b9f31401a272ef48b2cc2846eebd1fe8c16070df2d2ad8be7e65d81469","first_computed_at":"2026-05-18T00:26:22.765058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:22.765058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Wx2+7G6q3aIAMrwVqqUdDBv2wEiTq5OFIoht6ehwZZOylcljBIDb2UnSY3dIROoh9VHh23BNqcLFKCJ2h/iBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:22.765884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66a55340736f6500802838ff9ec8ce81a09fa398a5bf1f5485cd35c2d8ac2c9a","sha256:e85e8bc4f8d5ee48b20c8039c25ee10f95c0d8571455a9ec07dbde51c5f39cf6"],"state_sha256":"55bbfe9537d1305a0fd84a4b84b180d541d823630b4019ebaa43a286bab25a9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USDeiJLEgRmbWCSin7AE21y5p3Ci679/J5IW3yDHbxNqHwjoyBUTKZTgYEjanZljolfW1uzlE7Zc66C8eKvECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:58:20.598811Z","bundle_sha256":"2023e282b30dccf6f6b84f490e318544c348c8a68f4a6ea3e749ac806b892c73"}}