{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HUIFEGGDVDEMNUC2C4SEUDPVQN","short_pith_number":"pith:HUIFEGGD","canonical_record":{"source":{"id":"1404.5064","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-20T19:10:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f253526423c64c87d8a5aa475043daeea1ea8af83bc5eb9b2f776185bf957f99","abstract_canon_sha256":"f3e494b9c32895430770c65993d34e7aaff6e6763394b63e1ed17bd11a676d74"},"schema_version":"1.0"},"canonical_sha256":"3d105218c3a8c8c6d05a17244a0df5836788812414432ee4a9da61cee18c5c48","source":{"kind":"arxiv","id":"1404.5064","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5064","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5064v4","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5064","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"HUIFEGGDVDEM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUIFEGGDVDEMNUC2","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUIFEGGD","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HUIFEGGDVDEMNUC2C4SEUDPVQN","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5064","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-20T19:10:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f253526423c64c87d8a5aa475043daeea1ea8af83bc5eb9b2f776185bf957f99","abstract_canon_sha256":"f3e494b9c32895430770c65993d34e7aaff6e6763394b63e1ed17bd11a676d74"},"schema_version":"1.0"},"canonical_sha256":"3d105218c3a8c8c6d05a17244a0df5836788812414432ee4a9da61cee18c5c48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.986679Z","signature_b64":"8Pi0HZFoH0lGG7FN7shSl120KzGmZ1cwaM4ipjjSZ5wYSBhTBAX+8OIjm0aEmblRjYS4hSN4iYJ/bj0Uok02DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d105218c3a8c8c6d05a17244a0df5836788812414432ee4a9da61cee18c5c48","last_reissued_at":"2026-05-18T01:18:52.986012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.986012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5064","source_version":4,"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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILGidsdkcmiJKTwDFQo6D3ZZDb6wDw05gAH/LYp5n7OD2U55leuYA5137cOCuv7LTqs2V2IHq22yQJu9KqMPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:04.071892Z"},"content_sha256":"268d87d9fe5fe325bf31165b23f60c961fc0117b77832c427839c5da3dc34c5d","schema_version":"1.0","event_id":"sha256:268d87d9fe5fe325bf31165b23f60c961fc0117b77832c427839c5da3dc34c5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HUIFEGGDVDEMNUC2C4SEUDPVQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonhomogeneous Place-Dependent Markov Chains, Unsynchronised AIMD, and Network Utility Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Fabian Wirth, Jia Yuan Yu, Martin Corless, Robert Shorten, Sonja Stuedli","submitted_at":"2014-04-20T19:10:45Z","abstract_excerpt":"We present a solution of a class of network utility maximization (NUM) problems using minimal communication. The constraints of the problem are inspired less by TCP-like congestion control but by problems in the area of internet of things and related areas in which the need arises to bring the behavior of a large group of agents to a social optimum. The approach uses only intermittent feedback, no inter-agent communication, and no common clock.\n  The proposed algorithm is a combination of the classical AIMD algorithm in conjunction with a simple probabilistic rule for the agents to respond to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5064","kind":"arxiv","version":4},"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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lP8YiPTiXVkF5QBD4GNDJfbRWm047ohEdDlSdQEFMB17mVcWWQ1a/Cb4AQ3vWzPkxizKFRt9qyD+C3XPJ580CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:04.072561Z"},"content_sha256":"96f3dc6884dc96ad946d8b39a6f4eb970fa5b3a3594526fcd6b1af0b49579c4e","schema_version":"1.0","event_id":"sha256:96f3dc6884dc96ad946d8b39a6f4eb970fa5b3a3594526fcd6b1af0b49579c4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/bundle.json","state_url":"https://pith.science/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/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-07T21:34:04Z","links":{"resolver":"https://pith.science/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN","bundle":"https://pith.science/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/bundle.json","state":"https://pith.science/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUIFEGGDVDEMNUC2C4SEUDPVQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HUIFEGGDVDEMNUC2C4SEUDPVQN","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":"f3e494b9c32895430770c65993d34e7aaff6e6763394b63e1ed17bd11a676d74","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-20T19:10:45Z","title_canon_sha256":"f253526423c64c87d8a5aa475043daeea1ea8af83bc5eb9b2f776185bf957f99"},"schema_version":"1.0","source":{"id":"1404.5064","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5064","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5064v4","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5064","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"HUIFEGGDVDEM","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUIFEGGDVDEMNUC2","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUIFEGGD","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:96f3dc6884dc96ad946d8b39a6f4eb970fa5b3a3594526fcd6b1af0b49579c4e","target":"graph","created_at":"2026-05-18T01:18:52Z","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 present a solution of a class of network utility maximization (NUM) problems using minimal communication. The constraints of the problem are inspired less by TCP-like congestion control but by problems in the area of internet of things and related areas in which the need arises to bring the behavior of a large group of agents to a social optimum. The approach uses only intermittent feedback, no inter-agent communication, and no common clock.\n  The proposed algorithm is a combination of the classical AIMD algorithm in conjunction with a simple probabilistic rule for the agents to respond to ","authors_text":"Fabian Wirth, Jia Yuan Yu, Martin Corless, Robert Shorten, Sonja Stuedli","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-20T19:10:45Z","title":"Nonhomogeneous Place-Dependent Markov Chains, Unsynchronised AIMD, and Network Utility Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5064","kind":"arxiv","version":4},"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:268d87d9fe5fe325bf31165b23f60c961fc0117b77832c427839c5da3dc34c5d","target":"record","created_at":"2026-05-18T01:18:52Z","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":"f3e494b9c32895430770c65993d34e7aaff6e6763394b63e1ed17bd11a676d74","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-20T19:10:45Z","title_canon_sha256":"f253526423c64c87d8a5aa475043daeea1ea8af83bc5eb9b2f776185bf957f99"},"schema_version":"1.0","source":{"id":"1404.5064","kind":"arxiv","version":4}},"canonical_sha256":"3d105218c3a8c8c6d05a17244a0df5836788812414432ee4a9da61cee18c5c48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d105218c3a8c8c6d05a17244a0df5836788812414432ee4a9da61cee18c5c48","first_computed_at":"2026-05-18T01:18:52.986012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:52.986012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Pi0HZFoH0lGG7FN7shSl120KzGmZ1cwaM4ipjjSZ5wYSBhTBAX+8OIjm0aEmblRjYS4hSN4iYJ/bj0Uok02DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:52.986679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5064","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:268d87d9fe5fe325bf31165b23f60c961fc0117b77832c427839c5da3dc34c5d","sha256:96f3dc6884dc96ad946d8b39a6f4eb970fa5b3a3594526fcd6b1af0b49579c4e"],"state_sha256":"e1fe4ad759175fe0b6359e18d53af93689361bbff2115245deeaa4b7960a6ab5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYu9E9xp6UZhVmteVLDPnz2HorgFWVUOPEDfeNpb/R+4cvNShCfpRk9htsjTiPD8A1n01H/vc0SCQsQVb8rBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:34:04.076326Z","bundle_sha256":"3c5e1a4a352dfd46843896b0720c15de2e55d8f94158be610a862f5c449051c4"}}