{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:U4SSH6R5DDE6CA3ZE5ASC7QNPH","short_pith_number":"pith:U4SSH6R5","canonical_record":{"source":{"id":"1904.06511","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2019-04-13T09:18:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"234c4ac6df831da79d7ec1ed07ad2e71fb0ad25480abe31ebc1a2f8b37f4e9be","abstract_canon_sha256":"20dac765af38ab0442ff5671120e4a97d8e62822a935c79eb8c49872e78b3a1b"},"schema_version":"1.0"},"canonical_sha256":"a72523fa3d18c9e103792741217e0d79dd56229e446626973faebc08e23df3a7","source":{"kind":"arxiv","id":"1904.06511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06511","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06511v1","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06511","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"U4SSH6R5DDE6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U4SSH6R5DDE6CA3Z","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U4SSH6R5","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:U4SSH6R5DDE6CA3ZE5ASC7QNPH","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06511","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2019-04-13T09:18:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"234c4ac6df831da79d7ec1ed07ad2e71fb0ad25480abe31ebc1a2f8b37f4e9be","abstract_canon_sha256":"20dac765af38ab0442ff5671120e4a97d8e62822a935c79eb8c49872e78b3a1b"},"schema_version":"1.0"},"canonical_sha256":"a72523fa3d18c9e103792741217e0d79dd56229e446626973faebc08e23df3a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:38.993624Z","signature_b64":"GtBOBo3RmJB3Rh+yyTPf4P4cJr2JF2fzunj7EkVGdeXxpXjJzCz0j90BYdJJ1XvDVj4+0hJYl7gHmUn3OMQHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72523fa3d18c9e103792741217e0d79dd56229e446626973faebc08e23df3a7","last_reissued_at":"2026-05-17T23:48:38.993031Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:38.993031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06511","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:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAsDj3RaOUdtWE3NyR/Fx0dvpxCSJIJoi/KikArUWCqmnNfnFY1wHymhdrPKegkCLWBuC4IYgeUFPX4jRaojDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:12:24.728649Z"},"content_sha256":"6b28f7709ca75874c5dc4695504ccbb0b069ca66d1ad37fbf199dd570c6755f9","schema_version":"1.0","event_id":"sha256:6b28f7709ca75874c5dc4695504ccbb0b069ca66d1ad37fbf199dd570c6755f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:U4SSH6R5DDE6CA3ZE5ASC7QNPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Scheduling and Power Control for V2V Broadcast Communication with Adjacent Channel Interference","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"eess.SP","authors_text":"Anver Hisham, Di Yuan, Erik G. Str\\\"om, Fredrik Br\\\"annstr\\\"om","submitted_at":"2019-04-13T09:18:16Z","abstract_excerpt":"This paper investigates how to mitigate the impact of adjacent channel interference (ACI) in vehicular broadcast communication, using scheduling and power control. Our objective is to maximize the number of connected vehicles. First, we formulate the joint scheduling and power control problem as a mixed Boolean linear programming (MBLP) problem. From this problem formulation, we derive scheduling alone problem as Boolean linear programming (BLP) problem, and power control alone problem as an MBLP problem. Due to the hardness in solving joint scheduling and power control for multiple timeslots,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06511","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:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHsy1NG+uuwcgPy37wx6wDQ/w67FJIkhuzdsgVDConrWGjILIOeJZqlBra1utIFEtRNNS9vGtD5LcdedTtEzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:12:24.729284Z"},"content_sha256":"97d8b8e54f5aa1f2da3379db3b26787545ab9291906813c4c08161ae2fa03c73","schema_version":"1.0","event_id":"sha256:97d8b8e54f5aa1f2da3379db3b26787545ab9291906813c4c08161ae2fa03c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/bundle.json","state_url":"https://pith.science/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/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-27T06:12:24Z","links":{"resolver":"https://pith.science/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH","bundle":"https://pith.science/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/bundle.json","state":"https://pith.science/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4SSH6R5DDE6CA3ZE5ASC7QNPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U4SSH6R5DDE6CA3ZE5ASC7QNPH","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":"20dac765af38ab0442ff5671120e4a97d8e62822a935c79eb8c49872e78b3a1b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2019-04-13T09:18:16Z","title_canon_sha256":"234c4ac6df831da79d7ec1ed07ad2e71fb0ad25480abe31ebc1a2f8b37f4e9be"},"schema_version":"1.0","source":{"id":"1904.06511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06511","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06511v1","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06511","created_at":"2026-05-17T23:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"U4SSH6R5DDE6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"U4SSH6R5DDE6CA3Z","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"U4SSH6R5","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:97d8b8e54f5aa1f2da3379db3b26787545ab9291906813c4c08161ae2fa03c73","target":"graph","created_at":"2026-05-17T23:48:38Z","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 how to mitigate the impact of adjacent channel interference (ACI) in vehicular broadcast communication, using scheduling and power control. Our objective is to maximize the number of connected vehicles. First, we formulate the joint scheduling and power control problem as a mixed Boolean linear programming (MBLP) problem. From this problem formulation, we derive scheduling alone problem as Boolean linear programming (BLP) problem, and power control alone problem as an MBLP problem. Due to the hardness in solving joint scheduling and power control for multiple timeslots,","authors_text":"Anver Hisham, Di Yuan, Erik G. Str\\\"om, Fredrik Br\\\"annstr\\\"om","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2019-04-13T09:18:16Z","title":"Joint Scheduling and Power Control for V2V Broadcast Communication with Adjacent Channel Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06511","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:6b28f7709ca75874c5dc4695504ccbb0b069ca66d1ad37fbf199dd570c6755f9","target":"record","created_at":"2026-05-17T23:48:38Z","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":"20dac765af38ab0442ff5671120e4a97d8e62822a935c79eb8c49872e78b3a1b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"eess.SP","submitted_at":"2019-04-13T09:18:16Z","title_canon_sha256":"234c4ac6df831da79d7ec1ed07ad2e71fb0ad25480abe31ebc1a2f8b37f4e9be"},"schema_version":"1.0","source":{"id":"1904.06511","kind":"arxiv","version":1}},"canonical_sha256":"a72523fa3d18c9e103792741217e0d79dd56229e446626973faebc08e23df3a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a72523fa3d18c9e103792741217e0d79dd56229e446626973faebc08e23df3a7","first_computed_at":"2026-05-17T23:48:38.993031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:38.993031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtBOBo3RmJB3Rh+yyTPf4P4cJr2JF2fzunj7EkVGdeXxpXjJzCz0j90BYdJJ1XvDVj4+0hJYl7gHmUn3OMQHBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:38.993624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b28f7709ca75874c5dc4695504ccbb0b069ca66d1ad37fbf199dd570c6755f9","sha256:97d8b8e54f5aa1f2da3379db3b26787545ab9291906813c4c08161ae2fa03c73"],"state_sha256":"e1863ae57658ba74fd4d12a214e1c2ff94d4bc55c6f4a4aa720fa9343eccbc7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0H9ckWrtLT9gjrNjsPT7SvSL0e6wa36CAu/c9Mpn8Q8/HjEjCMyQ90q06jihnw5hGQFkAsuqOABRCE/QMitDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:12:24.733105Z","bundle_sha256":"7b129f5e5be1a11236e857f5ecdae422ee25b7b6929f23b9699ebea10145e85f"}}