{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2LUPCFHYAYEEWDH6LY57XVSP3H","short_pith_number":"pith:2LUPCFHY","canonical_record":{"source":{"id":"1408.5091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:13:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"da0e0b2d0a324471b4b76c9834c7db2a3748ff4d042a27d812d6f4d4a325e68e","abstract_canon_sha256":"7dc11a730d3230c319dd29ead9998a3f40e17da3c0b4f36cd7cb200ec965ffb3"},"schema_version":"1.0"},"canonical_sha256":"d2e8f114f806084b0cfe5e3bfbd64fd9f31723611a58e60413b07c02edea7ea9","source":{"kind":"arxiv","id":"1408.5091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5091","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5091v2","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5091","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"2LUPCFHYAYEE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2LUPCFHYAYEEWDH6","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2LUPCFHY","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2LUPCFHYAYEEWDH6LY57XVSP3H","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:13:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"da0e0b2d0a324471b4b76c9834c7db2a3748ff4d042a27d812d6f4d4a325e68e","abstract_canon_sha256":"7dc11a730d3230c319dd29ead9998a3f40e17da3c0b4f36cd7cb200ec965ffb3"},"schema_version":"1.0"},"canonical_sha256":"d2e8f114f806084b0cfe5e3bfbd64fd9f31723611a58e60413b07c02edea7ea9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:05.870152Z","signature_b64":"tBRwc39NsGqhOQ6u+RhWUApauUPvduE25wcj5Bu1fNXqn0wEumc20XKBPco77cvcwtbj1vFhndOA2itJNiXlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e8f114f806084b0cfe5e3bfbd64fd9f31723611a58e60413b07c02edea7ea9","last_reissued_at":"2026-05-18T01:28:05.869604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:05.869604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5091","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-05-18T01:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdP9v4kQqSofKpxDlQdiwd8iVNe/FBccdvST/oGYLyPyWcHF21VzwSqzo7Fpi8YKxg29pPqyKUNZYVwq1+xjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:16:15.901271Z"},"content_sha256":"cb89a7a1d43520b7bb6d21fcdc2adc384b32330bc1d31c649d4c2163aa8bda50","schema_version":"1.0","event_id":"sha256:cb89a7a1d43520b7bb6d21fcdc2adc384b32330bc1d31c649d4c2163aa8bda50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2LUPCFHYAYEEWDH6LY57XVSP3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Joint User Association and Resource Allocation in Heterogeneous Networks via Sparsity Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Andreas Dotzler, Quan Kuang, Wolfgang Utschick","submitted_at":"2014-08-21T18:13:14Z","abstract_excerpt":"This paper studies the joint user association and resource allocation in heterogeneous networks (HetNets) from a novel perspective, motivated by and generalizing the idea of fractional frequency reuse. By treating the multi-cell multi-user resource allocation as resource partitioning among multiple reuse patterns, we propose a unified framework to analyze and compare a wide range of user association and resource allocation strategies for HetNets, and provide an optimal benchmark for network performance. The enabling mechanisms are a novel formulation to consider all possible interference patte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5091","kind":"arxiv","version":2},"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-18T01:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiZh0EhxBldCTNU3+WaFpSl2iO3Bfj3TUVdQ+kzbXOz4smYSb45TdG9K+oDRRViJg3xGLlZOYuzGgaNHwK1nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:16:15.901648Z"},"content_sha256":"c8e6b9c89c0a51b097f8d26a9e186e7ee66bf0cedf4a219db84165b226578528","schema_version":"1.0","event_id":"sha256:c8e6b9c89c0a51b097f8d26a9e186e7ee66bf0cedf4a219db84165b226578528"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/bundle.json","state_url":"https://pith.science/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/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-06-03T01:16:15Z","links":{"resolver":"https://pith.science/pith/2LUPCFHYAYEEWDH6LY57XVSP3H","bundle":"https://pith.science/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/bundle.json","state":"https://pith.science/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LUPCFHYAYEEWDH6LY57XVSP3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2LUPCFHYAYEEWDH6LY57XVSP3H","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":"7dc11a730d3230c319dd29ead9998a3f40e17da3c0b4f36cd7cb200ec965ffb3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:13:14Z","title_canon_sha256":"da0e0b2d0a324471b4b76c9834c7db2a3748ff4d042a27d812d6f4d4a325e68e"},"schema_version":"1.0","source":{"id":"1408.5091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5091","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5091v2","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5091","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"2LUPCFHYAYEE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2LUPCFHYAYEEWDH6","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2LUPCFHY","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:c8e6b9c89c0a51b097f8d26a9e186e7ee66bf0cedf4a219db84165b226578528","target":"graph","created_at":"2026-05-18T01:28:05Z","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":"This paper studies the joint user association and resource allocation in heterogeneous networks (HetNets) from a novel perspective, motivated by and generalizing the idea of fractional frequency reuse. By treating the multi-cell multi-user resource allocation as resource partitioning among multiple reuse patterns, we propose a unified framework to analyze and compare a wide range of user association and resource allocation strategies for HetNets, and provide an optimal benchmark for network performance. The enabling mechanisms are a novel formulation to consider all possible interference patte","authors_text":"Andreas Dotzler, Quan Kuang, Wolfgang Utschick","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:13:14Z","title":"Optimal Joint User Association and Resource Allocation in Heterogeneous Networks via Sparsity Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5091","kind":"arxiv","version":2},"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:cb89a7a1d43520b7bb6d21fcdc2adc384b32330bc1d31c649d4c2163aa8bda50","target":"record","created_at":"2026-05-18T01:28:05Z","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":"7dc11a730d3230c319dd29ead9998a3f40e17da3c0b4f36cd7cb200ec965ffb3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-08-21T18:13:14Z","title_canon_sha256":"da0e0b2d0a324471b4b76c9834c7db2a3748ff4d042a27d812d6f4d4a325e68e"},"schema_version":"1.0","source":{"id":"1408.5091","kind":"arxiv","version":2}},"canonical_sha256":"d2e8f114f806084b0cfe5e3bfbd64fd9f31723611a58e60413b07c02edea7ea9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2e8f114f806084b0cfe5e3bfbd64fd9f31723611a58e60413b07c02edea7ea9","first_computed_at":"2026-05-18T01:28:05.869604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:05.869604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tBRwc39NsGqhOQ6u+RhWUApauUPvduE25wcj5Bu1fNXqn0wEumc20XKBPco77cvcwtbj1vFhndOA2itJNiXlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:05.870152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb89a7a1d43520b7bb6d21fcdc2adc384b32330bc1d31c649d4c2163aa8bda50","sha256:c8e6b9c89c0a51b097f8d26a9e186e7ee66bf0cedf4a219db84165b226578528"],"state_sha256":"5dfa55f2e90244772e061504b9cb7f2e540a7d654620b2f16faca02c5d3b8dbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sXgXjLEwkaLZ6+RZpc9ejCqbeDdzGbQ1sLN696+oKCx6ko/HT4tEDhOsL9lfMAsgwOAb8UII6lnbZCjDyGcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:16:15.903663Z","bundle_sha256":"5120622faaf4b5f7868da49f4c74be3ef095c1130b7368771665b33f30153133"}}