{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GGEQUYEF263DHB6G73NVYECIDJ","short_pith_number":"pith:GGEQUYEF","schema_version":"1.0","canonical_sha256":"31890a6085d7b63387c6fedb5c10481a5001ea3f971745510eafba5b63875d56","source":{"kind":"arxiv","id":"1705.08711","version":2},"attestation_state":"computed","paper":{"title":"Non-orthogonal Multiple Access for High-reliable and Low-latency V2X Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Boya Di, Geoffrey Ye Li, Lingyang Song, Yonghui Li","submitted_at":"2017-05-24T11:48:55Z","abstract_excerpt":"In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low latency and high reliability, and thus, we propose a non-orthogonal multiple access scheme to reduce the latency and to improve the packet reception probability. In the proposed scheme, the BS performs the semi-persistent scheduling to optimize the time scheduling and allocate frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control. We formul"},"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":"1705.08711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-24T11:48:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5d17311d2d1e5599a254c65b09a0e288d5bafc2da5b14ae9eff3deba6b5cc41a","abstract_canon_sha256":"9a6031bb578938a63e2ee2627aade593f7b6a7930fec43723a8d5747a8756c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:10.594518Z","signature_b64":"zLY/vhuXbyR9tezAykJXhuRrVqND2FxfntPnPbYSeMKMJAAV8U57Ek3RdfFOMXcjIO1tp6KH/ooptlA9FT3cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31890a6085d7b63387c6fedb5c10481a5001ea3f971745510eafba5b63875d56","last_reissued_at":"2026-05-18T00:29:10.594041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:10.594041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-orthogonal Multiple Access for High-reliable and Low-latency V2X Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Boya Di, Geoffrey Ye Li, Lingyang Song, Yonghui Li","submitted_at":"2017-05-24T11:48:55Z","abstract_excerpt":"In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low latency and high reliability, and thus, we propose a non-orthogonal multiple access scheme to reduce the latency and to improve the packet reception probability. In the proposed scheme, the BS performs the semi-persistent scheduling to optimize the time scheduling and allocate frequency resources in a non-orthogonal manner while the vehicles autonomously perform distributed power control. We formul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08711","kind":"arxiv","version":2},"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":"1705.08711","created_at":"2026-05-18T00:29:10.594112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08711v2","created_at":"2026-05-18T00:29:10.594112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08711","created_at":"2026-05-18T00:29:10.594112+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGEQUYEF263D","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGEQUYEF263DHB6G","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGEQUYEF","created_at":"2026-05-18T12:31:15.632608+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/GGEQUYEF263DHB6G73NVYECIDJ","json":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ.json","graph_json":"https://pith.science/api/pith-number/GGEQUYEF263DHB6G73NVYECIDJ/graph.json","events_json":"https://pith.science/api/pith-number/GGEQUYEF263DHB6G73NVYECIDJ/events.json","paper":"https://pith.science/paper/GGEQUYEF"},"agent_actions":{"view_html":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ","download_json":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ.json","view_paper":"https://pith.science/paper/GGEQUYEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08711&json=true","fetch_graph":"https://pith.science/api/pith-number/GGEQUYEF263DHB6G73NVYECIDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GGEQUYEF263DHB6G73NVYECIDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ/action/storage_attestation","attest_author":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ/action/author_attestation","sign_citation":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ/action/citation_signature","submit_replication":"https://pith.science/pith/GGEQUYEF263DHB6G73NVYECIDJ/action/replication_record"}},"created_at":"2026-05-18T00:29:10.594112+00:00","updated_at":"2026-05-18T00:29:10.594112+00:00"}