{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EDZHLIWU3RVLSSDEZVXQFU4FZU","short_pith_number":"pith:EDZHLIWU","canonical_record":{"source":{"id":"1702.05679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T00:06:32Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"759001fa872d86cfc34b38b1433e8120db3352a6066085cfe504105e40ae742c","abstract_canon_sha256":"fad3741a3336c2f8d4360f0606191802e1d5995ce6f5bde822d126555b0ee0b9"},"schema_version":"1.0"},"canonical_sha256":"20f275a2d4dc6ab94864cd6f02d385cd250bdaa12aaccd324d21b091e2d41aaf","source":{"kind":"arxiv","id":"1702.05679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05679","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05679v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05679","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"EDZHLIWU3RVL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDZHLIWU3RVLSSDE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDZHLIWU","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EDZHLIWU3RVLSSDEZVXQFU4FZU","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T00:06:32Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"759001fa872d86cfc34b38b1433e8120db3352a6066085cfe504105e40ae742c","abstract_canon_sha256":"fad3741a3336c2f8d4360f0606191802e1d5995ce6f5bde822d126555b0ee0b9"},"schema_version":"1.0"},"canonical_sha256":"20f275a2d4dc6ab94864cd6f02d385cd250bdaa12aaccd324d21b091e2d41aaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:25.690377Z","signature_b64":"eu4OJeauE3/xh3WVd/JXcRcvV51hPcCeLYz/rLnD48axCkjuksjdnmV0lgOBIMhWUowI8jRi5cm9DC/0CZHoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20f275a2d4dc6ab94864cd6f02d385cd250bdaa12aaccd324d21b091e2d41aaf","last_reissued_at":"2026-05-18T00:50:25.689717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:25.689717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05679","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-05-18T00:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWRoWykTkK/I3xbxG4kOpHEerZGQbGL37xIzJhwtdOXaH+2uFuTV1bjoFF9V9jQKMnaZCF4hpq/weSZC8aefCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:15:57.169604Z"},"content_sha256":"ad412d90edbcd07e536bba3864eb419a1bfb1674ee5a1d2b1ed691e91e0722de","schema_version":"1.0","event_id":"sha256:ad412d90edbcd07e536bba3864eb419a1bfb1674ee5a1d2b1ed691e91e0722de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EDZHLIWU3RVLSSDEZVXQFU4FZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Binnan Zhuang, Dongning Guo, Ermin Wei, Michael L. Honig","submitted_at":"2017-02-19T00:06:32Z","abstract_excerpt":"Joint allocation of spectrum and user association is considered for a large cellular network. The objective is to optimize a network utility function such as average delay given traffic statistics collected over a slow timescale. A key challenge is scalability: given $n$ Access Points (APs), there are $O(2^n)$ ways in which the APs can share the spectrum. The number of variables is reduced from $O(2^n)$ to $O(nk)$, where $k$ is the number of users, by optimizing over local overlapping neighborhoods, defined by interference conditions, and by exploiting the existence of sparse solutions in whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05679","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":""},"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-05-18T00:50:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua1WWhU/NDeWx0jyCVyXdcxR0+vQDI7WiYLvexOP0IDHBr0uuNZ1C+HfhCwTr0jq692K78TbYThC3ownqWCXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:15:57.169950Z"},"content_sha256":"40ab97ed77cd5aaff61dddd12dd1065896010a2bd47e9f07ce79a4e39a3a6187","schema_version":"1.0","event_id":"sha256:40ab97ed77cd5aaff61dddd12dd1065896010a2bd47e9f07ce79a4e39a3a6187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/bundle.json","state_url":"https://pith.science/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/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-07-02T23:15:57Z","links":{"resolver":"https://pith.science/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU","bundle":"https://pith.science/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/bundle.json","state":"https://pith.science/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDZHLIWU3RVLSSDEZVXQFU4FZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EDZHLIWU3RVLSSDEZVXQFU4FZU","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":"fad3741a3336c2f8d4360f0606191802e1d5995ce6f5bde822d126555b0ee0b9","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T00:06:32Z","title_canon_sha256":"759001fa872d86cfc34b38b1433e8120db3352a6066085cfe504105e40ae742c"},"schema_version":"1.0","source":{"id":"1702.05679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05679","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05679v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05679","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"EDZHLIWU3RVL","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDZHLIWU3RVLSSDE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDZHLIWU","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:40ab97ed77cd5aaff61dddd12dd1065896010a2bd47e9f07ce79a4e39a3a6187","target":"graph","created_at":"2026-05-18T00:50:25Z","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"},"paper":{"abstract_excerpt":"Joint allocation of spectrum and user association is considered for a large cellular network. The objective is to optimize a network utility function such as average delay given traffic statistics collected over a slow timescale. A key challenge is scalability: given $n$ Access Points (APs), there are $O(2^n)$ ways in which the APs can share the spectrum. The number of variables is reduced from $O(2^n)$ to $O(nk)$, where $k$ is the number of users, by optimizing over local overlapping neighborhoods, defined by interference conditions, and by exploiting the existence of sparse solutions in whic","authors_text":"Binnan Zhuang, Dongning Guo, Ermin Wei, Michael L. Honig","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T00:06:32Z","title":"Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05679","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:ad412d90edbcd07e536bba3864eb419a1bfb1674ee5a1d2b1ed691e91e0722de","target":"record","created_at":"2026-05-18T00:50:25Z","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":"fad3741a3336c2f8d4360f0606191802e1d5995ce6f5bde822d126555b0ee0b9","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-19T00:06:32Z","title_canon_sha256":"759001fa872d86cfc34b38b1433e8120db3352a6066085cfe504105e40ae742c"},"schema_version":"1.0","source":{"id":"1702.05679","kind":"arxiv","version":1}},"canonical_sha256":"20f275a2d4dc6ab94864cd6f02d385cd250bdaa12aaccd324d21b091e2d41aaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20f275a2d4dc6ab94864cd6f02d385cd250bdaa12aaccd324d21b091e2d41aaf","first_computed_at":"2026-05-18T00:50:25.689717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.689717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eu4OJeauE3/xh3WVd/JXcRcvV51hPcCeLYz/rLnD48axCkjuksjdnmV0lgOBIMhWUowI8jRi5cm9DC/0CZHoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.690377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad412d90edbcd07e536bba3864eb419a1bfb1674ee5a1d2b1ed691e91e0722de","sha256:40ab97ed77cd5aaff61dddd12dd1065896010a2bd47e9f07ce79a4e39a3a6187"],"state_sha256":"eaa2d7617188b1b2fb85b7ec2993ccdd5409daf4f7a0b4c23128eceeb7e13954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRRu4cLatQiRJlXQu7zVyE5vhGD2F/YhcxtKRhVZ9h8grXumm9siNtFrydmo7p6pyoMvhLIDEONEgNR1YwOFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:15:57.171982Z","bundle_sha256":"1b1aaae269aeb51bfe1c25e1760155a50656fb87557ea7a1dc0b35dfe19ed10d"}}