{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5OKQ2P35TJRYRHT5VJNODJMQ47","short_pith_number":"pith:5OKQ2P35","schema_version":"1.0","canonical_sha256":"eb950d3f7d9a63889e7daa5ae1a590e7ff9d8056244919bcf5cfdfe6923933c4","source":{"kind":"arxiv","id":"2203.03906","version":3},"attestation_state":"computed","paper":{"title":"Designing Heterogeneous GNNs with Desired Permutation Properties for Wireless Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Chenyang Yang, Jianyu Zhao, Tingting Liu","submitted_at":"2022-03-08T08:02:54Z","abstract_excerpt":"Graph neural networks (GNNs) have been designed for learning a variety of wireless policies, i.e., the mappings from environment parameters to decision variables, thanks to their superior performance, and the potential in enabling scalability and size generalizability. These merits are rooted in leveraging permutation prior, i.e., satisfying the permutation property of the policy to be learned (referred to as desired permutation property). Many wireless policies are with complicated permutation properties. To satisfy these properties, heterogeneous GNNs (HetGNNs) should be used to learn such p"},"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":"2203.03906","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-08T08:02:54Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c5d710769b786aa4421a25f019ca000a5d249d2a29bbd6f3e53bccc52cc39cf7","abstract_canon_sha256":"9ada28bd4fe5b542b32a7f4c888e98342648824fc36cb8e23f8594d9ff5fc5f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:10.187500Z","signature_b64":"9GQjJ9u9CKFY8BeFA8eyoIzo75TiiGegQiIF67Moy7hD0D5H6+i027G2L0dYlscsCFlzs6l0RW4H8iVZTnJYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb950d3f7d9a63889e7daa5ae1a590e7ff9d8056244919bcf5cfdfe6923933c4","last_reissued_at":"2026-07-05T10:42:10.187088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:10.187088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Heterogeneous GNNs with Desired Permutation Properties for Wireless Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Chenyang Yang, Jianyu Zhao, Tingting Liu","submitted_at":"2022-03-08T08:02:54Z","abstract_excerpt":"Graph neural networks (GNNs) have been designed for learning a variety of wireless policies, i.e., the mappings from environment parameters to decision variables, thanks to their superior performance, and the potential in enabling scalability and size generalizability. These merits are rooted in leveraging permutation prior, i.e., satisfying the permutation property of the policy to be learned (referred to as desired permutation property). Many wireless policies are with complicated permutation properties. To satisfy these properties, heterogeneous GNNs (HetGNNs) should be used to learn such p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03906","kind":"arxiv","version":3},"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/2203.03906/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":"2203.03906","created_at":"2026-07-05T10:42:10.187146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03906v3","created_at":"2026-07-05T10:42:10.187146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03906","created_at":"2026-07-05T10:42:10.187146+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OKQ2P35TJRY","created_at":"2026-07-05T10:42:10.187146+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OKQ2P35TJRYRHT5","created_at":"2026-07-05T10:42:10.187146+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OKQ2P35","created_at":"2026-07-05T10:42:10.187146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19499","citing_title":"Graph Reinforcement Learning for QoS-Aware Load Balancing in Open Radio Access Networks","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47","json":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47.json","graph_json":"https://pith.science/api/pith-number/5OKQ2P35TJRYRHT5VJNODJMQ47/graph.json","events_json":"https://pith.science/api/pith-number/5OKQ2P35TJRYRHT5VJNODJMQ47/events.json","paper":"https://pith.science/paper/5OKQ2P35"},"agent_actions":{"view_html":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47","download_json":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47.json","view_paper":"https://pith.science/paper/5OKQ2P35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03906&json=true","fetch_graph":"https://pith.science/api/pith-number/5OKQ2P35TJRYRHT5VJNODJMQ47/graph.json","fetch_events":"https://pith.science/api/pith-number/5OKQ2P35TJRYRHT5VJNODJMQ47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47/action/storage_attestation","attest_author":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47/action/author_attestation","sign_citation":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47/action/citation_signature","submit_replication":"https://pith.science/pith/5OKQ2P35TJRYRHT5VJNODJMQ47/action/replication_record"}},"created_at":"2026-07-05T10:42:10.187146+00:00","updated_at":"2026-07-05T10:42:10.187146+00:00"}