{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BMPNKBG53PAFJX7Z3HZD5LTIYS","short_pith_number":"pith:BMPNKBG5","canonical_record":{"source":{"id":"1502.03372","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T16:58:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"56e4590be3c0b88d65ce909236c1ba39973b6b2f14941d9d61a05ee043e50001","abstract_canon_sha256":"e2010ff104f966568d2155abf9dd4b96f2c5c64d3b1a30e576c088e2752ad454"},"schema_version":"1.0"},"canonical_sha256":"0b1ed504dddbc054dff9d9f23eae68c4a4e06c1c70a297e097e2e4cdc1047449","source":{"kind":"arxiv","id":"1502.03372","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03372","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03372v3","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03372","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"BMPNKBG53PAF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BMPNKBG53PAFJX7Z","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BMPNKBG5","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BMPNKBG53PAFJX7Z3HZD5LTIYS","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03372","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T16:58:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"56e4590be3c0b88d65ce909236c1ba39973b6b2f14941d9d61a05ee043e50001","abstract_canon_sha256":"e2010ff104f966568d2155abf9dd4b96f2c5c64d3b1a30e576c088e2752ad454"},"schema_version":"1.0"},"canonical_sha256":"0b1ed504dddbc054dff9d9f23eae68c4a4e06c1c70a297e097e2e4cdc1047449","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:47.035580Z","signature_b64":"kc7JM6iXpWV7NDKQRhyEvSS6XGzvS+sKM8jOmkgRHjsTlWyopvhppyuWVlARaTOHnqHzL06SGUPL3X3SLbUfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1ed504dddbc054dff9d9f23eae68c4a4e06c1c70a297e097e2e4cdc1047449","last_reissued_at":"2026-05-18T01:20:47.035119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:47.035119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03372","source_version":3,"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwosucbYKd29Gudcb8Zaswh65bIHtcLR+NjXgnuJSd1wem9+VyriYdDmYwyv/geJDfW3hgQ7uw/sc5SPkGXZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:19.824569Z"},"content_sha256":"af6e3c7bea79ea0380b98e1ad2f43068e20e3660ad57911b6f026522d82adb11","schema_version":"1.0","event_id":"sha256:af6e3c7bea79ea0380b98e1ad2f43068e20e3660ad57911b6f026522d82adb11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BMPNKBG53PAFJX7Z3HZD5LTIYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Distributed Stateless Algorithm for $\\alpha$-Fair Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Cliff Stein, Gil Zussman, Jelena Marasevic","submitted_at":"2015-02-11T16:58:16Z","abstract_excerpt":"Over the past two decades, fair resource allocation problems have received considerable attention in a variety of application areas. However, little progress has been made in the design of distributed algorithms with convergence guarantees for general and commonly used $\\alpha$-fair allocations. In this paper, we study weighted $\\alpha$-fair packing problems, that is, the problems of maximizing the objective functions (i) $\\sum_j w_j x_j^{1-\\alpha}/(1-\\alpha)$ when $\\alpha > 0$, $\\alpha \\neq 1$ and (ii) $\\sum_j w_j \\ln x_j$ when $\\alpha = 1$, over linear constraints $Ax \\leq b$, $x\\geq 0$, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03372","kind":"arxiv","version":3},"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFtACdMyVmlDt2qUT4fACHIU68O+88fXth/KDjzINKRgizeVT76/sJjkScgV2PbYu7BHlM4wqUlPG51rTmPhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:19.824926Z"},"content_sha256":"1b312a45c65ff055d8d27ac700da9699fd8e5f82a065c84fc24ccdf2dac02dcc","schema_version":"1.0","event_id":"sha256:1b312a45c65ff055d8d27ac700da9699fd8e5f82a065c84fc24ccdf2dac02dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/bundle.json","state_url":"https://pith.science/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/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-10T21:49:19Z","links":{"resolver":"https://pith.science/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS","bundle":"https://pith.science/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/bundle.json","state":"https://pith.science/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMPNKBG53PAFJX7Z3HZD5LTIYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BMPNKBG53PAFJX7Z3HZD5LTIYS","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":"e2010ff104f966568d2155abf9dd4b96f2c5c64d3b1a30e576c088e2752ad454","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T16:58:16Z","title_canon_sha256":"56e4590be3c0b88d65ce909236c1ba39973b6b2f14941d9d61a05ee043e50001"},"schema_version":"1.0","source":{"id":"1502.03372","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03372","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03372v3","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03372","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"BMPNKBG53PAF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BMPNKBG53PAFJX7Z","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BMPNKBG5","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:1b312a45c65ff055d8d27ac700da9699fd8e5f82a065c84fc24ccdf2dac02dcc","target":"graph","created_at":"2026-05-18T01:20:47Z","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":"Over the past two decades, fair resource allocation problems have received considerable attention in a variety of application areas. However, little progress has been made in the design of distributed algorithms with convergence guarantees for general and commonly used $\\alpha$-fair allocations. In this paper, we study weighted $\\alpha$-fair packing problems, that is, the problems of maximizing the objective functions (i) $\\sum_j w_j x_j^{1-\\alpha}/(1-\\alpha)$ when $\\alpha > 0$, $\\alpha \\neq 1$ and (ii) $\\sum_j w_j \\ln x_j$ when $\\alpha = 1$, over linear constraints $Ax \\leq b$, $x\\geq 0$, whe","authors_text":"Cliff Stein, Gil Zussman, Jelena Marasevic","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T16:58:16Z","title":"A Fast Distributed Stateless Algorithm for $\\alpha$-Fair Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03372","kind":"arxiv","version":3},"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:af6e3c7bea79ea0380b98e1ad2f43068e20e3660ad57911b6f026522d82adb11","target":"record","created_at":"2026-05-18T01:20:47Z","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":"e2010ff104f966568d2155abf9dd4b96f2c5c64d3b1a30e576c088e2752ad454","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-11T16:58:16Z","title_canon_sha256":"56e4590be3c0b88d65ce909236c1ba39973b6b2f14941d9d61a05ee043e50001"},"schema_version":"1.0","source":{"id":"1502.03372","kind":"arxiv","version":3}},"canonical_sha256":"0b1ed504dddbc054dff9d9f23eae68c4a4e06c1c70a297e097e2e4cdc1047449","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b1ed504dddbc054dff9d9f23eae68c4a4e06c1c70a297e097e2e4cdc1047449","first_computed_at":"2026-05-18T01:20:47.035119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:47.035119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kc7JM6iXpWV7NDKQRhyEvSS6XGzvS+sKM8jOmkgRHjsTlWyopvhppyuWVlARaTOHnqHzL06SGUPL3X3SLbUfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:47.035580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03372","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6e3c7bea79ea0380b98e1ad2f43068e20e3660ad57911b6f026522d82adb11","sha256:1b312a45c65ff055d8d27ac700da9699fd8e5f82a065c84fc24ccdf2dac02dcc"],"state_sha256":"b82270e2df0a3974994c007d4b06d72089feda60f70b68b72bc762b917aadf96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZA4YlzrnThYDjlGXoq1i92M4RM5JCb/6K7zR53XX6wtlZKqFI3FU+JLQAGALsAaxTGbrkNL1FvzeDDfy1/uDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:49:19.826872Z","bundle_sha256":"305b17aa8cf3a3f2c8b10dd37e05087edaca474e1b5ba6826a3eebbdda854877"}}