{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D2KERVFX5EPO76UDIHYU2LDWEP","short_pith_number":"pith:D2KERVFX","canonical_record":{"source":{"id":"2604.05175","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-06T21:12:25Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f7dc7b60f4c2791cb8bd74d41df134dc63a30eb74477e91fba56e90b6cd3c4bc","abstract_canon_sha256":"9a1833ebad478d5cbc2de126f06fe0a330d3168cbf2ab42452aeef4af3243918"},"schema_version":"1.0"},"canonical_sha256":"1e9448d4b7e91eeffa8341f14d2c7623e57f4b3e86aff5f7a174781273d9631d","source":{"kind":"arxiv","id":"2604.05175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.05175","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.05175v2","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.05175","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"D2KERVFX5EPO","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"D2KERVFX5EPO76UD","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"D2KERVFX","created_at":"2026-07-30T00:08:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D2KERVFX5EPO76UDIHYU2LDWEP","target":"record","payload":{"canonical_record":{"source":{"id":"2604.05175","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-06T21:12:25Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f7dc7b60f4c2791cb8bd74d41df134dc63a30eb74477e91fba56e90b6cd3c4bc","abstract_canon_sha256":"9a1833ebad478d5cbc2de126f06fe0a330d3168cbf2ab42452aeef4af3243918"},"schema_version":"1.0"},"canonical_sha256":"1e9448d4b7e91eeffa8341f14d2c7623e57f4b3e86aff5f7a174781273d9631d","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9448d4b7e91eeffa8341f14d2c7623e57f4b3e86aff5f7a174781273d9631d","last_reissued_at":"2026-07-30T00:08:14.041255Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T00:08:14.041255Z"},"source_kind":"arxiv","source_id":"2604.05175","source_version":2,"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-30T00:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ao1n91yB3JtNFQqmND5zs4TOCBjMZ03r2vSrjy1hlpmPMlOEGQHEcMwstNhBIV/17TLyoj8Y/7mHr6j7/XFzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:03:38.322378Z"},"content_sha256":"7e525f9e9c7d5457e896106887ce2627d67320c31a7692553e61ec6f48625a00","schema_version":"1.0","event_id":"sha256:7e525f9e9c7d5457e896106887ce2627d67320c31a7692553e61ec6f48625a00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D2KERVFX5EPO76UDIHYU2LDWEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Signal Diffusion Models for Wireless Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks.","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"eess.SP","authors_text":"Alejandro Ribeiro, Samar Hadou, Shirin Saeedi Bidokhti, Yigit Berkay Uslu","submitted_at":"2026-04-06T21:12:25Z","abstract_excerpt":"We consider constrained ergodic resource optimization in wireless networks with graph-structured interference. We train a diffusion model policy to match expert conditional distributions over resource allocations. By leveraging a primal-dual (expert) algorithm, we generate primal iterates that serve as draws from the corresponding expert conditionals for each training network instance. We view the allocations as stochastic graph signals supported on known channel state graphs. We implement the diffusion model architecture as a U-Net hierarchy of graph neural network (GNN) blocks, conditioned o"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In a power-control case study, we show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates, with strong generalization and transferability across network states.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the primal-dual expert algorithm produces representative samples from the true conditional distributions over allocations and that time-sharing of diffusion samples is sufficient to achieve ergodic performance without violating constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A graph-conditioned diffusion model learns to sample near-optimal wireless resource allocations by matching distributions from an expert primal-dual algorithm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"10e968cfee5f3f4994f7f3cecc2608900440cd5bc8cc5d1179d1f411db17522f"},"source":{"id":"2604.05175","kind":"arxiv","version":2},"verdict":{"id":"420044f6-45d0-4a16-bfbc-7c0c0915b513","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T18:48:14.060065Z","strongest_claim":"In a power-control case study, we show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates, with strong generalization and transferability across network states.","one_line_summary":"A graph-conditioned diffusion model learns to sample near-optimal wireless resource allocations by matching distributions from an expert primal-dual algorithm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the primal-dual expert algorithm produces representative samples from the true conditional distributions over allocations and that time-sharing of diffusion samples is sufficient to achieve ergodic performance without violating constraints.","pith_extraction_headline":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.05175/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":2,"snapshot_sha256":"c76e061085c257b86891bd44da7ea997a4bf2f19b4bb59515519b8eeec80ef2d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"420044f6-45d0-4a16-bfbc-7c0c0915b513"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T00:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpUPyj+mCRplGcMQutcLKuMlMe+KPxSxwKbvhiEmr2bnHtvyZZ5PKN2b8rpVLfHdG50F/Y1p+4c7fz+RNgYTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:03:38.323632Z"},"content_sha256":"e70500d591d83ba481015dba75b37192d6c6ae4eeb72d53e39c2ff83428ca239","schema_version":"1.0","event_id":"sha256:e70500d591d83ba481015dba75b37192d6c6ae4eeb72d53e39c2ff83428ca239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2KERVFX5EPO76UDIHYU2LDWEP/bundle.json","state_url":"https://pith.science/pith/D2KERVFX5EPO76UDIHYU2LDWEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2KERVFX5EPO76UDIHYU2LDWEP/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-20T13:03:38Z","links":{"resolver":"https://pith.science/pith/D2KERVFX5EPO76UDIHYU2LDWEP","bundle":"https://pith.science/pith/D2KERVFX5EPO76UDIHYU2LDWEP/bundle.json","state":"https://pith.science/pith/D2KERVFX5EPO76UDIHYU2LDWEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2KERVFX5EPO76UDIHYU2LDWEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D2KERVFX5EPO76UDIHYU2LDWEP","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":"9a1833ebad478d5cbc2de126f06fe0a330d3168cbf2ab42452aeef4af3243918","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-06T21:12:25Z","title_canon_sha256":"f7dc7b60f4c2791cb8bd74d41df134dc63a30eb74477e91fba56e90b6cd3c4bc"},"schema_version":"1.0","source":{"id":"2604.05175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.05175","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.05175v2","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.05175","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"D2KERVFX5EPO","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"D2KERVFX5EPO76UD","created_at":"2026-07-30T00:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"D2KERVFX","created_at":"2026-07-30T00:08:14Z"}],"graph_snapshots":[{"event_id":"sha256:e70500d591d83ba481015dba75b37192d6c6ae4eeb72d53e39c2ff83428ca239","target":"graph","created_at":"2026-07-30T00:08:14Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"In a power-control case study, we show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates, with strong generalization and transferability across network states."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the primal-dual expert algorithm produces representative samples from the true conditional distributions over allocations and that time-sharing of diffusion samples is sufficient to achieve ergodic performance without violating constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A graph-conditioned diffusion model learns to sample near-optimal wireless resource allocations by matching distributions from an expert primal-dual algorithm."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks."}],"snapshot_sha256":"10e968cfee5f3f4994f7f3cecc2608900440cd5bc8cc5d1179d1f411db17522f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c76e061085c257b86891bd44da7ea997a4bf2f19b4bb59515519b8eeec80ef2d"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.05175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider constrained ergodic resource optimization in wireless networks with graph-structured interference. We train a diffusion model policy to match expert conditional distributions over resource allocations. By leveraging a primal-dual (expert) algorithm, we generate primal iterates that serve as draws from the corresponding expert conditionals for each training network instance. We view the allocations as stochastic graph signals supported on known channel state graphs. We implement the diffusion model architecture as a U-Net hierarchy of graph neural network (GNN) blocks, conditioned o","authors_text":"Alejandro Ribeiro, Samar Hadou, Shirin Saeedi Bidokhti, Yigit Berkay Uslu","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-06T21:12:25Z","title":"Graph Signal Diffusion Models for Wireless Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.05175","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T18:48:14.060065Z","id":"420044f6-45d0-4a16-bfbc-7c0c0915b513","model_set":{"reader":"grok-4.3"},"one_line_summary":"A graph-conditioned diffusion model learns to sample near-optimal wireless resource allocations by matching distributions from an expert primal-dual algorithm.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A diffusion model trained on expert allocations can sample near-optimal power controls for graph-structured wireless networks.","strongest_claim":"In a power-control case study, we show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates, with strong generalization and transferability across network states.","weakest_assumption":"That the primal-dual expert algorithm produces representative samples from the true conditional distributions over allocations and that time-sharing of diffusion samples is sufficient to achieve ergodic performance without violating constraints."}},"verdict_id":"420044f6-45d0-4a16-bfbc-7c0c0915b513"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e525f9e9c7d5457e896106887ce2627d67320c31a7692553e61ec6f48625a00","target":"record","created_at":"2026-07-30T00:08:14Z","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":"9a1833ebad478d5cbc2de126f06fe0a330d3168cbf2ab42452aeef4af3243918","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2026-04-06T21:12:25Z","title_canon_sha256":"f7dc7b60f4c2791cb8bd74d41df134dc63a30eb74477e91fba56e90b6cd3c4bc"},"schema_version":"1.0","source":{"id":"2604.05175","kind":"arxiv","version":2}},"canonical_sha256":"1e9448d4b7e91eeffa8341f14d2c7623e57f4b3e86aff5f7a174781273d9631d","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e9448d4b7e91eeffa8341f14d2c7623e57f4b3e86aff5f7a174781273d9631d","first_computed_at":"2026-07-30T00:08:14.041255Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T00:08:14.041255Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2604.05175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e525f9e9c7d5457e896106887ce2627d67320c31a7692553e61ec6f48625a00","sha256:e70500d591d83ba481015dba75b37192d6c6ae4eeb72d53e39c2ff83428ca239"],"state_sha256":"ae04a407139d0ed14e77c0f119655dd7afba6420caff4d9719b1a900da616fad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRV8CxasZz2qtGGrS81BxhcoyOmjx65OrYyAma8byMRlJJjPFWwxuvuHCni4ZSYufv/X8FNoHLzdzLSYC3aABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T13:03:38.330600Z","bundle_sha256":"d49e22be0373b763e9784ff88be0edace7410e1755c54e25ff14e4e76191d2e1"}}