{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JNLNEPQ5B3PERHZ5ADD32SSISC","short_pith_number":"pith:JNLNEPQ5","canonical_record":{"source":{"id":"1307.3103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:33:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a68267d07584afc81fe98cbe0a0c7a078532ccb82f79101fd7ef8960567da08","abstract_canon_sha256":"377eda060c152cda88e68efba6d2637fbbe86c2f7bc469601aa546eecbed76b7"},"schema_version":"1.0"},"canonical_sha256":"4b56d23e1d0ede489f3d00c7bd4a4890bc7d7772a0ffe5061160961092e589bb","source":{"kind":"arxiv","id":"1307.3103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3103","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3103v1","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3103","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"JNLNEPQ5B3PE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNLNEPQ5B3PERHZ5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNLNEPQ5","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JNLNEPQ5B3PERHZ5ADD32SSISC","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:33:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a68267d07584afc81fe98cbe0a0c7a078532ccb82f79101fd7ef8960567da08","abstract_canon_sha256":"377eda060c152cda88e68efba6d2637fbbe86c2f7bc469601aa546eecbed76b7"},"schema_version":"1.0"},"canonical_sha256":"4b56d23e1d0ede489f3d00c7bd4a4890bc7d7772a0ffe5061160961092e589bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:41.184113Z","signature_b64":"ytIfrXLLXSIeR4e81Wm1Tm1muUFQ6QGdu2j6k3ALFgJoyYjbBO7wRy62QQxmIMjpsUlE5gnPI5ICM5L3TNXZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b56d23e1d0ede489f3d00c7bd4a4890bc7d7772a0ffe5061160961092e589bb","last_reissued_at":"2026-05-18T03:18:41.183456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:41.183456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3103","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-18T03:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cps1XPxtdwIDtvW5TDO1j2D1dakneMyP14W5MGbFVvpukhEXoMhl/ePGSzo2OGFYG2HbWkitgsWvetm+24DFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:01:46.779031Z"},"content_sha256":"3c223c1028b5c8b2ceec4e620ba8d372ce933645412d979915249cc69c1da3c3","schema_version":"1.0","event_id":"sha256:3c223c1028b5c8b2ceec4e620ba8d372ce933645412d979915249cc69c1da3c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JNLNEPQ5B3PERHZ5ADD32SSISC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Minimizing Base Station Power Consumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gunther Auer, Harald Haas, Hauke Holtkamp","submitted_at":"2013-07-11T13:33:15Z","abstract_excerpt":"We consider resource allocation over a wireless downlink where Base Station (BS) power consumption is minimized while upholding a set of required link rates. A Power and Resource Allocation Including Sleep (PRAIS) method is proposed that combines resource sharing, Power Control (PC), and Discontinuous Transmission (DTX), such that downlink power consumption is minimized, which can be formed into a convex optimization problem. Unlike conventional approaches that aim at minimizing transmit power, in this work the BS mains supply power is chosen as the relevant metric. Based on a linear power mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3103","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-18T03:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FQmf991U3BiL4cXj76T+PrSUR3KdT3twUyU+HgSzyal+5DFcsNrMXr7GqtuYEZqnLOyB+Nq9sD/CyX+G454Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:01:46.779419Z"},"content_sha256":"1c17c625b393283616660c2cb1ffba4c6025adb00d1f45500d40b71d7c56fba5","schema_version":"1.0","event_id":"sha256:1c17c625b393283616660c2cb1ffba4c6025adb00d1f45500d40b71d7c56fba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/bundle.json","state_url":"https://pith.science/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/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-09T06:01:46Z","links":{"resolver":"https://pith.science/pith/JNLNEPQ5B3PERHZ5ADD32SSISC","bundle":"https://pith.science/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/bundle.json","state":"https://pith.science/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNLNEPQ5B3PERHZ5ADD32SSISC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JNLNEPQ5B3PERHZ5ADD32SSISC","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":"377eda060c152cda88e68efba6d2637fbbe86c2f7bc469601aa546eecbed76b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:33:15Z","title_canon_sha256":"8a68267d07584afc81fe98cbe0a0c7a078532ccb82f79101fd7ef8960567da08"},"schema_version":"1.0","source":{"id":"1307.3103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3103","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3103v1","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3103","created_at":"2026-05-18T03:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"JNLNEPQ5B3PE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNLNEPQ5B3PERHZ5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNLNEPQ5","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:1c17c625b393283616660c2cb1ffba4c6025adb00d1f45500d40b71d7c56fba5","target":"graph","created_at":"2026-05-18T03:18:41Z","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":"We consider resource allocation over a wireless downlink where Base Station (BS) power consumption is minimized while upholding a set of required link rates. A Power and Resource Allocation Including Sleep (PRAIS) method is proposed that combines resource sharing, Power Control (PC), and Discontinuous Transmission (DTX), such that downlink power consumption is minimized, which can be formed into a convex optimization problem. Unlike conventional approaches that aim at minimizing transmit power, in this work the BS mains supply power is chosen as the relevant metric. Based on a linear power mod","authors_text":"Gunther Auer, Harald Haas, Hauke Holtkamp","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:33:15Z","title":"On Minimizing Base Station Power Consumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3103","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:3c223c1028b5c8b2ceec4e620ba8d372ce933645412d979915249cc69c1da3c3","target":"record","created_at":"2026-05-18T03:18:41Z","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":"377eda060c152cda88e68efba6d2637fbbe86c2f7bc469601aa546eecbed76b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:33:15Z","title_canon_sha256":"8a68267d07584afc81fe98cbe0a0c7a078532ccb82f79101fd7ef8960567da08"},"schema_version":"1.0","source":{"id":"1307.3103","kind":"arxiv","version":1}},"canonical_sha256":"4b56d23e1d0ede489f3d00c7bd4a4890bc7d7772a0ffe5061160961092e589bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b56d23e1d0ede489f3d00c7bd4a4890bc7d7772a0ffe5061160961092e589bb","first_computed_at":"2026-05-18T03:18:41.183456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:41.183456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytIfrXLLXSIeR4e81Wm1Tm1muUFQ6QGdu2j6k3ALFgJoyYjbBO7wRy62QQxmIMjpsUlE5gnPI5ICM5L3TNXZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:41.184113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c223c1028b5c8b2ceec4e620ba8d372ce933645412d979915249cc69c1da3c3","sha256:1c17c625b393283616660c2cb1ffba4c6025adb00d1f45500d40b71d7c56fba5"],"state_sha256":"ad4bc88cddaa8b8ac03ed890843fc2823b6f99e16e16e59b2ba6cfbd62454467"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R53j1ppre0eGty4hdvyD7lbj6Hr6f1L4uDyLxwbz16XKzJC/NFZ5HEiHBHdFk1aZ1wATSHmD7PbIpygPeh4yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:01:46.781637Z","bundle_sha256":"414f67060ffd125b036d330d5fc2434f7ea305abf0e550cea134e453a27b82fa"}}