{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:SA7DH3J7MAQ5SZNWOVMNA65GBY","short_pith_number":"pith:SA7DH3J7","canonical_record":{"source":{"id":"0808.0987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-07T09:26:12Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"7f61ce043b0b547a78451f236af28a75a765a4f839ab2239d75ef151fc0eea1c","abstract_canon_sha256":"c0304c6b8f3837e005c63591e9e1e4f1d5ba0705c67c2949588adedcd233e24f"},"schema_version":"1.0"},"canonical_sha256":"903e33ed3f6021d965b67558d07ba60e3cbeb8a33f662beac88f50241ccb314e","source":{"kind":"arxiv","id":"0808.0987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0987","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0987v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0987","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"SA7DH3J7MAQ5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SA7DH3J7MAQ5SZNW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SA7DH3J7","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:SA7DH3J7MAQ5SZNWOVMNA65GBY","target":"record","payload":{"canonical_record":{"source":{"id":"0808.0987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-07T09:26:12Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"7f61ce043b0b547a78451f236af28a75a765a4f839ab2239d75ef151fc0eea1c","abstract_canon_sha256":"c0304c6b8f3837e005c63591e9e1e4f1d5ba0705c67c2949588adedcd233e24f"},"schema_version":"1.0"},"canonical_sha256":"903e33ed3f6021d965b67558d07ba60e3cbeb8a33f662beac88f50241ccb314e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.666585Z","signature_b64":"0v6ByogGskV4irMwgiz2PWzJoBgWKaTbxOb2qKSFb2GNWUYzIAoYK0+gePZ/H+uQ7+VWzzFZUBy3OOWVE4V5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903e33ed3f6021d965b67558d07ba60e3cbeb8a33f662beac88f50241ccb314e","last_reissued_at":"2026-05-18T00:59:11.665929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.665929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.0987","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xa6K0SyeBuX52BCVszfd9isdGBpA2bCD5xFzB2eqP7X+0Qhuk9myTQCJB0Oj/4U6HX7Roe7nlmsVR1z9n1p9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:40:50.810683Z"},"content_sha256":"4c33017a7e605f737cbf9523e0326e0801746791a3a3eda0f84b71fc9198b199","schema_version":"1.0","event_id":"sha256:4c33017a7e605f737cbf9523e0326e0801746791a3a3eda0f84b71fc9198b199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:SA7DH3J7MAQ5SZNWOVMNA65GBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new graph perspective on max-min fairness in Gaussian parallel channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, Marcin Wiczanowski","submitted_at":"2008-08-07T09:26:12Z","abstract_excerpt":"In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases. As our central results, we characterize the laws which determine the value of the achievable max-min fair performance as a function of channel sharing policy and power allocation (to channels and users). In particular, we show that the max-min fair performance behaves as a specialized version of the Lovasz function, or Delsarte bound, of a certain graph induced by channel s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0987","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qaukG+rAjAnUj2BZQioaNugB2VT6i5z6TAWn8VvmwwJ85aBBeNbDbdHGF2w6caGkUz6aA8/n/hQEbOYXyCnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:40:50.811027Z"},"content_sha256":"a1de89743ee6e1df3b982954b28e9f621daf87755e7c4c88b162a78e3aab9a12","schema_version":"1.0","event_id":"sha256:a1de89743ee6e1df3b982954b28e9f621daf87755e7c4c88b162a78e3aab9a12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/bundle.json","state_url":"https://pith.science/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/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-11T13:40:50Z","links":{"resolver":"https://pith.science/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY","bundle":"https://pith.science/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/bundle.json","state":"https://pith.science/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA7DH3J7MAQ5SZNWOVMNA65GBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:SA7DH3J7MAQ5SZNWOVMNA65GBY","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":"c0304c6b8f3837e005c63591e9e1e4f1d5ba0705c67c2949588adedcd233e24f","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-07T09:26:12Z","title_canon_sha256":"7f61ce043b0b547a78451f236af28a75a765a4f839ab2239d75ef151fc0eea1c"},"schema_version":"1.0","source":{"id":"0808.0987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.0987","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0808.0987v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.0987","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"SA7DH3J7MAQ5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"SA7DH3J7MAQ5SZNW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"SA7DH3J7","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:a1de89743ee6e1df3b982954b28e9f621daf87755e7c4c88b162a78e3aab9a12","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases. As our central results, we characterize the laws which determine the value of the achievable max-min fair performance as a function of channel sharing policy and power allocation (to channels and users). In particular, we show that the max-min fair performance behaves as a specialized version of the Lovasz function, or Delsarte bound, of a certain graph induced by channel s","authors_text":"Holger Boche, Marcin Wiczanowski","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-07T09:26:12Z","title":"A new graph perspective on max-min fairness in Gaussian parallel channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.0987","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:4c33017a7e605f737cbf9523e0326e0801746791a3a3eda0f84b71fc9198b199","target":"record","created_at":"2026-05-18T00:59:11Z","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":"c0304c6b8f3837e005c63591e9e1e4f1d5ba0705c67c2949588adedcd233e24f","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-08-07T09:26:12Z","title_canon_sha256":"7f61ce043b0b547a78451f236af28a75a765a4f839ab2239d75ef151fc0eea1c"},"schema_version":"1.0","source":{"id":"0808.0987","kind":"arxiv","version":1}},"canonical_sha256":"903e33ed3f6021d965b67558d07ba60e3cbeb8a33f662beac88f50241ccb314e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"903e33ed3f6021d965b67558d07ba60e3cbeb8a33f662beac88f50241ccb314e","first_computed_at":"2026-05-18T00:59:11.665929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.665929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0v6ByogGskV4irMwgiz2PWzJoBgWKaTbxOb2qKSFb2GNWUYzIAoYK0+gePZ/H+uQ7+VWzzFZUBy3OOWVE4V5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.666585Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.0987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c33017a7e605f737cbf9523e0326e0801746791a3a3eda0f84b71fc9198b199","sha256:a1de89743ee6e1df3b982954b28e9f621daf87755e7c4c88b162a78e3aab9a12"],"state_sha256":"8f3d20c220d3ec8ca9250041c6cd8b223f454e8caae76088826c15ed5e2ed586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfoXwgiXRWchDDmpCx0tgMVXjksoVdc3PB99uqXQcBSXg9Osko7gwRho1iCYfSqI7KR9LI5JMB592baLK5PSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:40:50.813084Z","bundle_sha256":"94874dcb17b0e8c38f0ce6fe7aa3a928b06c632a409c5d43ff76f7b926648818"}}