{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NYVN7AHH6L22HXG7ARHMH3KTEJ","short_pith_number":"pith:NYVN7AHH","canonical_record":{"source":{"id":"2505.07598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-12T14:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"b1bbe0d1c18f7f6342c0bd7d3aa1bef660d1774070f62f216f12533d1c25b477","abstract_canon_sha256":"996b1bfe6a6768ab0e49d5e945b8ebf90975249443dfef1ee3eeadf90e1c6d15"},"schema_version":"1.0"},"canonical_sha256":"6e2adf80e7f2f5a3dcdf044ec3ed53226e338c777e3389c3ab435729b33e2262","source":{"kind":"arxiv","id":"2505.07598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07598","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07598v1","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07598","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"NYVN7AHH6L22","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"NYVN7AHH6L22HXG7","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"NYVN7AHH","created_at":"2026-07-05T11:01:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NYVN7AHH6L22HXG7ARHMH3KTEJ","target":"record","payload":{"canonical_record":{"source":{"id":"2505.07598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-12T14:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"b1bbe0d1c18f7f6342c0bd7d3aa1bef660d1774070f62f216f12533d1c25b477","abstract_canon_sha256":"996b1bfe6a6768ab0e49d5e945b8ebf90975249443dfef1ee3eeadf90e1c6d15"},"schema_version":"1.0"},"canonical_sha256":"6e2adf80e7f2f5a3dcdf044ec3ed53226e338c777e3389c3ab435729b33e2262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:50.297729Z","signature_b64":"EJpZkXr7ABstl5Mtg+YcnYpzoGyFh/MfrHoxE3k1ftK2Jivk1Jn0wqjcDpeuU2jiyMlUuFANd7e4o1a5YpbgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2adf80e7f2f5a3dcdf044ec3ed53226e338c777e3389c3ab435729b33e2262","last_reissued_at":"2026-07-05T11:01:50.297226Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:50.297226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.07598","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-07-05T11:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVhWu+bJ+hr0vUk0cg0ysNzlFeTnsPscjNE8vHwlH0FOXvpz/LJOVG/dgeW7ey4EetkCiZiqknN2nIAE/EHNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:56:22.437882Z"},"content_sha256":"830abb1793f6ec19c4ae7acf165496719e9a3ff6bbb2b82be92eaa91489808dc","schema_version":"1.0","event_id":"sha256:830abb1793f6ec19c4ae7acf165496719e9a3ff6bbb2b82be92eaa91489808dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NYVN7AHH6L22HXG7ARHMH3KTEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Link Scheduling with State-Augmented Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alejandro Ribeiro, Navid Naderializadeh, Romina Garcia Camargo, Zhiyang Wang","submitted_at":"2025-05-12T14:22:36Z","abstract_excerpt":"We consider the problem of optimal link scheduling in large-scale wireless ad hoc networks. We specifically aim for the maximum long-term average performance, subject to a minimum transmission requirement for each link to ensure fairness. With a graph structure utilized to represent the conflicts of links, we formulate a constrained optimization problem to learn the scheduling policy, which is parameterized with a graph neural network (GNN). To address the challenge of long-term performance, we use the state-augmentation technique. In particular, by augmenting the Lagrangian dual variables as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07598","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/2505.07598/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"},"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-07-05T11:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/l50AilQs29INNZ5lYl0YXfx5SsskMQZ1MUL7sn3AW8+IU8SSejUIjTHPYPs0xPbII/f87okTc10LstYVGMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:56:22.438405Z"},"content_sha256":"bcd221bd993e4cb95c585364da22a17efed172b8202d4683edeaf1d2b2d7c1e9","schema_version":"1.0","event_id":"sha256:bcd221bd993e4cb95c585364da22a17efed172b8202d4683edeaf1d2b2d7c1e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/bundle.json","state_url":"https://pith.science/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/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-08-15T13:56:22Z","links":{"resolver":"https://pith.science/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ","bundle":"https://pith.science/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/bundle.json","state":"https://pith.science/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYVN7AHH6L22HXG7ARHMH3KTEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NYVN7AHH6L22HXG7ARHMH3KTEJ","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":"996b1bfe6a6768ab0e49d5e945b8ebf90975249443dfef1ee3eeadf90e1c6d15","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-12T14:22:36Z","title_canon_sha256":"b1bbe0d1c18f7f6342c0bd7d3aa1bef660d1774070f62f216f12533d1c25b477"},"schema_version":"1.0","source":{"id":"2505.07598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07598","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07598v1","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07598","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"NYVN7AHH6L22","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_16","alias_value":"NYVN7AHH6L22HXG7","created_at":"2026-07-05T11:01:50Z"},{"alias_kind":"pith_short_8","alias_value":"NYVN7AHH","created_at":"2026-07-05T11:01:50Z"}],"graph_snapshots":[{"event_id":"sha256:bcd221bd993e4cb95c585364da22a17efed172b8202d4683edeaf1d2b2d7c1e9","target":"graph","created_at":"2026-07-05T11:01:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.07598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of optimal link scheduling in large-scale wireless ad hoc networks. We specifically aim for the maximum long-term average performance, subject to a minimum transmission requirement for each link to ensure fairness. With a graph structure utilized to represent the conflicts of links, we formulate a constrained optimization problem to learn the scheduling policy, which is parameterized with a graph neural network (GNN). To address the challenge of long-term performance, we use the state-augmentation technique. In particular, by augmenting the Lagrangian dual variables as ","authors_text":"Alejandro Ribeiro, Navid Naderializadeh, Romina Garcia Camargo, Zhiyang Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-12T14:22:36Z","title":"Wireless Link Scheduling with State-Augmented Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07598","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:830abb1793f6ec19c4ae7acf165496719e9a3ff6bbb2b82be92eaa91489808dc","target":"record","created_at":"2026-07-05T11:01:50Z","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":"996b1bfe6a6768ab0e49d5e945b8ebf90975249443dfef1ee3eeadf90e1c6d15","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-05-12T14:22:36Z","title_canon_sha256":"b1bbe0d1c18f7f6342c0bd7d3aa1bef660d1774070f62f216f12533d1c25b477"},"schema_version":"1.0","source":{"id":"2505.07598","kind":"arxiv","version":1}},"canonical_sha256":"6e2adf80e7f2f5a3dcdf044ec3ed53226e338c777e3389c3ab435729b33e2262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e2adf80e7f2f5a3dcdf044ec3ed53226e338c777e3389c3ab435729b33e2262","first_computed_at":"2026-07-05T11:01:50.297226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:50.297226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJpZkXr7ABstl5Mtg+YcnYpzoGyFh/MfrHoxE3k1ftK2Jivk1Jn0wqjcDpeuU2jiyMlUuFANd7e4o1a5YpbgDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:50.297729Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.07598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:830abb1793f6ec19c4ae7acf165496719e9a3ff6bbb2b82be92eaa91489808dc","sha256:bcd221bd993e4cb95c585364da22a17efed172b8202d4683edeaf1d2b2d7c1e9"],"state_sha256":"f1de123e64c86ebb8e3b4619379ad1891a1dd13206419964a27e0dda1497daac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trWreajF8DrTHxVE5aEciodo24XoX6psbq3hbW9aNM1leegGeuIgSNnkozX6Uy8hJAnrz6jjNTemMNNDNr98DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:56:22.442419Z","bundle_sha256":"17336cad82fcce8be1b214260f5790e877ca2317a27dca411aa43d480b671c82"}}