{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:267BXYIC6FEECIYPTXYHUABVJX","short_pith_number":"pith:267BXYIC","schema_version":"1.0","canonical_sha256":"d7be1be102f14841230f9df07a00354ddb027db9b1c49a6799f42310e07f1841","source":{"kind":"arxiv","id":"2402.00879","version":1},"attestation_state":"computed","paper":{"title":"Graph Representation Learning for Contention and Interference Management in Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.NI","authors_text":"Branka Vucetic, Kishore Chikkam, Pasquale Aliberti, Wibowo Hardjawana, Zhouyou Gu","submitted_at":"2024-01-15T22:23:06Z","abstract_excerpt":"Restricted access window (RAW) in Wi-Fi 802.11ah networks manages contention and interference by grouping users and allocating periodic time slots for each group's transmissions. We will find the optimal user grouping decisions in RAW to maximize the network's worst-case user throughput. We review existing user grouping approaches and highlight their performance limitations in the above problem. We propose formulating user grouping as a graph construction problem where vertices represent users and edge weights indicate the contention and interference. This formulation leverages the graph's max"},"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":"2402.00879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-15T22:23:06Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"85e802ee84b64a1d629130cdbf487779da66e2b988818cf9f1b09ef9c85f8a34","abstract_canon_sha256":"e047259fbfc242e72eb4bdc5297f166867aef35c3a4d4f705957d061eba26133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:39.269982Z","signature_b64":"+TG7q3UMSkL+9L6y9GL3LhOYcdukLtyw6CQQX+Wd/EzW2L8v81nFejtxypoMshnT3zfjYiPZ0W9uZhBH1HP7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7be1be102f14841230f9df07a00354ddb027db9b1c49a6799f42310e07f1841","last_reissued_at":"2026-07-05T09:25:39.269452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:39.269452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Representation Learning for Contention and Interference Management in Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.NI","authors_text":"Branka Vucetic, Kishore Chikkam, Pasquale Aliberti, Wibowo Hardjawana, Zhouyou Gu","submitted_at":"2024-01-15T22:23:06Z","abstract_excerpt":"Restricted access window (RAW) in Wi-Fi 802.11ah networks manages contention and interference by grouping users and allocating periodic time slots for each group's transmissions. We will find the optimal user grouping decisions in RAW to maximize the network's worst-case user throughput. We review existing user grouping approaches and highlight their performance limitations in the above problem. We propose formulating user grouping as a graph construction problem where vertices represent users and edge weights indicate the contention and interference. This formulation leverages the graph's max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00879","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.00879/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.00879","created_at":"2026-07-05T09:25:39.269514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00879v1","created_at":"2026-07-05T09:25:39.269514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00879","created_at":"2026-07-05T09:25:39.269514+00:00"},{"alias_kind":"pith_short_12","alias_value":"267BXYIC6FEE","created_at":"2026-07-05T09:25:39.269514+00:00"},{"alias_kind":"pith_short_16","alias_value":"267BXYIC6FEECIYP","created_at":"2026-07-05T09:25:39.269514+00:00"},{"alias_kind":"pith_short_8","alias_value":"267BXYIC","created_at":"2026-07-05T09:25:39.269514+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/267BXYIC6FEECIYPTXYHUABVJX","json":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX.json","graph_json":"https://pith.science/api/pith-number/267BXYIC6FEECIYPTXYHUABVJX/graph.json","events_json":"https://pith.science/api/pith-number/267BXYIC6FEECIYPTXYHUABVJX/events.json","paper":"https://pith.science/paper/267BXYIC"},"agent_actions":{"view_html":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX","download_json":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX.json","view_paper":"https://pith.science/paper/267BXYIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00879&json=true","fetch_graph":"https://pith.science/api/pith-number/267BXYIC6FEECIYPTXYHUABVJX/graph.json","fetch_events":"https://pith.science/api/pith-number/267BXYIC6FEECIYPTXYHUABVJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX/action/storage_attestation","attest_author":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX/action/author_attestation","sign_citation":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX/action/citation_signature","submit_replication":"https://pith.science/pith/267BXYIC6FEECIYPTXYHUABVJX/action/replication_record"}},"created_at":"2026-07-05T09:25:39.269514+00:00","updated_at":"2026-07-05T09:25:39.269514+00:00"}