{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4CBPCDAWKDT3JO6CZA64CEVXU2","short_pith_number":"pith:4CBPCDAW","canonical_record":{"source":{"id":"1603.03645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-11T14:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"70ce24360ab70171819c51053de1e3aa588317ec5b54180e9ebc356cee768d34","abstract_canon_sha256":"349749508783ea1dfef41263d2be14116e379365460c4fb7ff7c55f0202daa95"},"schema_version":"1.0"},"canonical_sha256":"e082f10c1650e7b4bbc2c83dc112b7a69c1e4fe1a29e67ae250fe31c4f0fd374","source":{"kind":"arxiv","id":"1603.03645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03645","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03645v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03645","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"4CBPCDAWKDT3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4CBPCDAWKDT3JO6C","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4CBPCDAW","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4CBPCDAWKDT3JO6CZA64CEVXU2","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-11T14:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"70ce24360ab70171819c51053de1e3aa588317ec5b54180e9ebc356cee768d34","abstract_canon_sha256":"349749508783ea1dfef41263d2be14116e379365460c4fb7ff7c55f0202daa95"},"schema_version":"1.0"},"canonical_sha256":"e082f10c1650e7b4bbc2c83dc112b7a69c1e4fe1a29e67ae250fe31c4f0fd374","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.088151Z","signature_b64":"Vkix/8K3mpZiRq8ssYrnqlpkr6DtCVr+lNiP/XkrgQA5sFdWLSDS32RJxM2Y9xPOZhBicntPFgNUEH5351yvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e082f10c1650e7b4bbc2c83dc112b7a69c1e4fe1a29e67ae250fe31c4f0fd374","last_reissued_at":"2026-05-18T01:19:15.087455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.087455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03645","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAWn5lyAWOXIEru1SbqSxtsccn02n5Sh8O1C0V6VKO6ijisxoT6I8v6DpmV2jxHIleo599CKKU8u3s/51z3LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:30.303938Z"},"content_sha256":"9effa6ca4329b2163f9ec8cc4db97aeef4ad27142b6264c8e39bc9a16b83705f","schema_version":"1.0","event_id":"sha256:9effa6ca4329b2163f9ec8cc4db97aeef4ad27142b6264c8e39bc9a16b83705f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4CBPCDAWKDT3JO6CZA64CEVXU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mobile-service based Max-Min Fairness Resource Scheduling for Heterogeneous Vehicular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fengping An, Jingtao SU, Ke Xiong, Xiaofei Di, Yu Zhang","submitted_at":"2016-03-11T14:34:53Z","abstract_excerpt":"This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03645","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fO44TsWlPJ7oYngPshA1oiER91RPpbUQpEd3zcvdHYijeAziPsa0nF5GuikaL2F682Hz4aWfgWeL84UxGl4dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:30.304639Z"},"content_sha256":"efac8660c5fc3914dbfe15befb5bb809cc25a1d472f9371f1c88984fd428d9e7","schema_version":"1.0","event_id":"sha256:efac8660c5fc3914dbfe15befb5bb809cc25a1d472f9371f1c88984fd428d9e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/bundle.json","state_url":"https://pith.science/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/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-29T15:09:30Z","links":{"resolver":"https://pith.science/pith/4CBPCDAWKDT3JO6CZA64CEVXU2","bundle":"https://pith.science/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/bundle.json","state":"https://pith.science/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CBPCDAWKDT3JO6CZA64CEVXU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4CBPCDAWKDT3JO6CZA64CEVXU2","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":"349749508783ea1dfef41263d2be14116e379365460c4fb7ff7c55f0202daa95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-11T14:34:53Z","title_canon_sha256":"70ce24360ab70171819c51053de1e3aa588317ec5b54180e9ebc356cee768d34"},"schema_version":"1.0","source":{"id":"1603.03645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03645","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03645v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03645","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"4CBPCDAWKDT3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4CBPCDAWKDT3JO6C","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4CBPCDAW","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:efac8660c5fc3914dbfe15befb5bb809cc25a1d472f9371f1c88984fd428d9e7","target":"graph","created_at":"2026-05-18T01:19:15Z","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 scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Sim","authors_text":"Fengping An, Jingtao SU, Ke Xiong, Xiaofei Di, Yu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-11T14:34:53Z","title":"Mobile-service based Max-Min Fairness Resource Scheduling for Heterogeneous Vehicular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03645","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:9effa6ca4329b2163f9ec8cc4db97aeef4ad27142b6264c8e39bc9a16b83705f","target":"record","created_at":"2026-05-18T01:19:15Z","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":"349749508783ea1dfef41263d2be14116e379365460c4fb7ff7c55f0202daa95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-11T14:34:53Z","title_canon_sha256":"70ce24360ab70171819c51053de1e3aa588317ec5b54180e9ebc356cee768d34"},"schema_version":"1.0","source":{"id":"1603.03645","kind":"arxiv","version":1}},"canonical_sha256":"e082f10c1650e7b4bbc2c83dc112b7a69c1e4fe1a29e67ae250fe31c4f0fd374","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e082f10c1650e7b4bbc2c83dc112b7a69c1e4fe1a29e67ae250fe31c4f0fd374","first_computed_at":"2026-05-18T01:19:15.087455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:15.087455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vkix/8K3mpZiRq8ssYrnqlpkr6DtCVr+lNiP/XkrgQA5sFdWLSDS32RJxM2Y9xPOZhBicntPFgNUEH5351yvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:15.088151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9effa6ca4329b2163f9ec8cc4db97aeef4ad27142b6264c8e39bc9a16b83705f","sha256:efac8660c5fc3914dbfe15befb5bb809cc25a1d472f9371f1c88984fd428d9e7"],"state_sha256":"ca3452e54c9a72e2eefef114b24b0123337e60639584d6e59e2ddf125026fd98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StNzvGE8HlclITPjMBO0HxGx0F1PrbXslsPcvy0ObwS2pOw/uE0mo38vZ+IygHtIyZKbPqqzUx+Qg9+rxSGKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:09:30.308368Z","bundle_sha256":"2da372c17465cd305b5f4a934be785de1118cdc921de71a4f8a562cf4b190715"}}