{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QKGXZPB4VZCWG3EDE62PDY7ZEZ","short_pith_number":"pith:QKGXZPB4","canonical_record":{"source":{"id":"1712.00549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T04:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53dfb352d166f6046cf013506256d28a3efb9efb3ddb16c122e74b5ccc842f1e","abstract_canon_sha256":"c9cab257f81645310c7acaec9a9a69fbae84bd7423b729c141d08723059bac90"},"schema_version":"1.0"},"canonical_sha256":"828d7cbc3cae45636c8327b4f1e3f9265dea9ae204857b458a2804d70cbd2aeb","source":{"kind":"arxiv","id":"1712.00549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00549","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00549v1","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00549","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"QKGXZPB4VZCW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKGXZPB4VZCWG3ED","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKGXZPB4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QKGXZPB4VZCWG3EDE62PDY7ZEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T04:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"53dfb352d166f6046cf013506256d28a3efb9efb3ddb16c122e74b5ccc842f1e","abstract_canon_sha256":"c9cab257f81645310c7acaec9a9a69fbae84bd7423b729c141d08723059bac90"},"schema_version":"1.0"},"canonical_sha256":"828d7cbc3cae45636c8327b4f1e3f9265dea9ae204857b458a2804d70cbd2aeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:45.487630Z","signature_b64":"NyojVGy8+7ZAxrk+TZrAnI9SvgbyaodPWZWXjFDsi97SQUAnvLK9WC8aIgniRBnyM42CWu7NvjDCgAHVAUPzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"828d7cbc3cae45636c8327b4f1e3f9265dea9ae204857b458a2804d70cbd2aeb","last_reissued_at":"2026-05-17T23:52:45.487087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:45.487087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00549","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-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TxU2bX1rYaWvNKZoR19FbG1NV2VvLkljOg9g8kTC27/51tSUTOJ1rWKAi2jeXPSY0+aXeJa6bVdy9ADAG8r0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:21:31.538913Z"},"content_sha256":"ae7d4f94e4a4245c24bd8ebb8294f8c98f6847be8386356f307bdfd5b9d9a7a3","schema_version":"1.0","event_id":"sha256:ae7d4f94e4a4245c24bd8ebb8294f8c98f6847be8386356f307bdfd5b9d9a7a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QKGXZPB4VZCWG3EDE62PDY7ZEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Stage Allocation Scheme for Delay-Sensitive Services in Dense Vehicular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haojun Yang, Kan Zheng, Lei Lei, Long Zhao","submitted_at":"2017-12-02T04:25:32Z","abstract_excerpt":"Driven by the rapid development of wireless communication system, more and more vehicular services can be efficiently supported via vehicle-to-everything (V2X) communications. In order to allocate radio resource with the reasonable implementation complexity in dense urban intersection, a two-stage allocation algorithm is proposed in this paper, whose main objective is to minimize delay and ensure reliability. In particular, as for the first stage, the allocation policy is based on traffic density information (TDI), which is different from utilizing channel state information (CSI) and queue sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00549","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-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTcy2P0JmC5ZZhj2U5q7ERVqAywXoX/E2t6APlHJNqjyXlN8r5sZTX+HhU1yyOABqbhTWbbBt72taJogcq9HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:21:31.539588Z"},"content_sha256":"0d3162c4a6c07361844a63d096e77813969d8ee7182be79a5039e0369283b478","schema_version":"1.0","event_id":"sha256:0d3162c4a6c07361844a63d096e77813969d8ee7182be79a5039e0369283b478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/bundle.json","state_url":"https://pith.science/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/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-27T21:21:31Z","links":{"resolver":"https://pith.science/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ","bundle":"https://pith.science/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/bundle.json","state":"https://pith.science/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKGXZPB4VZCWG3EDE62PDY7ZEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QKGXZPB4VZCWG3EDE62PDY7ZEZ","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":"c9cab257f81645310c7acaec9a9a69fbae84bd7423b729c141d08723059bac90","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T04:25:32Z","title_canon_sha256":"53dfb352d166f6046cf013506256d28a3efb9efb3ddb16c122e74b5ccc842f1e"},"schema_version":"1.0","source":{"id":"1712.00549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00549","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00549v1","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00549","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"QKGXZPB4VZCW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKGXZPB4VZCWG3ED","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKGXZPB4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:0d3162c4a6c07361844a63d096e77813969d8ee7182be79a5039e0369283b478","target":"graph","created_at":"2026-05-17T23:52:45Z","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":"Driven by the rapid development of wireless communication system, more and more vehicular services can be efficiently supported via vehicle-to-everything (V2X) communications. In order to allocate radio resource with the reasonable implementation complexity in dense urban intersection, a two-stage allocation algorithm is proposed in this paper, whose main objective is to minimize delay and ensure reliability. In particular, as for the first stage, the allocation policy is based on traffic density information (TDI), which is different from utilizing channel state information (CSI) and queue sta","authors_text":"Haojun Yang, Kan Zheng, Lei Lei, Long Zhao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T04:25:32Z","title":"A Two-Stage Allocation Scheme for Delay-Sensitive Services in Dense Vehicular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00549","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:ae7d4f94e4a4245c24bd8ebb8294f8c98f6847be8386356f307bdfd5b9d9a7a3","target":"record","created_at":"2026-05-17T23:52:45Z","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":"c9cab257f81645310c7acaec9a9a69fbae84bd7423b729c141d08723059bac90","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T04:25:32Z","title_canon_sha256":"53dfb352d166f6046cf013506256d28a3efb9efb3ddb16c122e74b5ccc842f1e"},"schema_version":"1.0","source":{"id":"1712.00549","kind":"arxiv","version":1}},"canonical_sha256":"828d7cbc3cae45636c8327b4f1e3f9265dea9ae204857b458a2804d70cbd2aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"828d7cbc3cae45636c8327b4f1e3f9265dea9ae204857b458a2804d70cbd2aeb","first_computed_at":"2026-05-17T23:52:45.487087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:45.487087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NyojVGy8+7ZAxrk+TZrAnI9SvgbyaodPWZWXjFDsi97SQUAnvLK9WC8aIgniRBnyM42CWu7NvjDCgAHVAUPzAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:45.487630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae7d4f94e4a4245c24bd8ebb8294f8c98f6847be8386356f307bdfd5b9d9a7a3","sha256:0d3162c4a6c07361844a63d096e77813969d8ee7182be79a5039e0369283b478"],"state_sha256":"820f425291c8098c268950283885032f24114a8acc8fe1be910befe9855d828d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkuiVdxuN+UzD6Aok8Rbgsq2GZV0Eyj9BMY0ITy+c3Hk2Lb6X7OomWWWwOrl+I5rWg14SOVYmDgXVi8UGhqwBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:21:31.542995Z","bundle_sha256":"895d56a399f741149c608d19379e4324281a20a0522a99f350355c0c2da1a2a3"}}