{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O2ZXDBXSWL2LCWDS2IFWIV7BRV","short_pith_number":"pith:O2ZXDBXS","canonical_record":{"source":{"id":"1711.07530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-20T20:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"44abd1f1fbed3bbee825536c62b29cf724d8db8ce4fb798bcaccdda1a32bdd0a","abstract_canon_sha256":"9002f839ca01e15ecd1e05a80ebe479cfa3593870090d85a411add7ccbc3c673"},"schema_version":"1.0"},"canonical_sha256":"76b37186f2b2f4b15872d20b6457e18d622ed69d35ef3bd6a6668ec742bc0f65","source":{"kind":"arxiv","id":"1711.07530","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07530","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07530v3","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07530","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2ZXDBXSWL2L","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2ZXDBXSWL2LCWDS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2ZXDBXS","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O2ZXDBXSWL2LCWDS2IFWIV7BRV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-20T20:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"44abd1f1fbed3bbee825536c62b29cf724d8db8ce4fb798bcaccdda1a32bdd0a","abstract_canon_sha256":"9002f839ca01e15ecd1e05a80ebe479cfa3593870090d85a411add7ccbc3c673"},"schema_version":"1.0"},"canonical_sha256":"76b37186f2b2f4b15872d20b6457e18d622ed69d35ef3bd6a6668ec742bc0f65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.177158Z","signature_b64":"kg4IOUnOmChqW7+wm21On5ALLRcfNs+PPcfBFagynf6S8XKYxKzF0yiXVQi33HLiLnofesjO34ltVimti/ScBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b37186f2b2f4b15872d20b6457e18d622ed69d35ef3bd6a6668ec742bc0f65","last_reissued_at":"2026-05-18T00:16:14.176481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.176481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07530","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-18T00:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msbIuG4DoT7wa50EbOJqCNUEJK/KZUBf3JENv0vavX1CHlQlYFfMvQg1k7kfeij+Ir805PDmTxaZFz7vZQc9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:14:49.410810Z"},"content_sha256":"23e5a6018aa659f8cff7e5ae694d3dab6b2a78309078452d2a45a1d7ec6a08cc","schema_version":"1.0","event_id":"sha256:23e5a6018aa659f8cff7e5ae694d3dab6b2a78309078452d2a45a1d7ec6a08cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O2ZXDBXSWL2LCWDS2IFWIV7BRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Resource Inference in Network Utility Maximization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Pascal Frossard, Stefano D'Aronco","submitted_at":"2017-11-20T20:26:57Z","abstract_excerpt":"The amount of transmitted data in computer networks is expected to grow considerably in the future, putting more and more pressure on the network infrastructures. In order to guarantee a good service, it then becomes fundamental to use the network resources efficiently. Network Utility Maximization (NUM) provides a framework to optimize the rate allocation when network resources are limited. Unfortunately, in the scenario where the amount of available resources is not known a priori, classical NUM solving methods do not offer a viable solution. To overcome this limitation we design an overlay "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07530","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-18T00:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIYWwYzFCd4G0Mu1f52IrThZsJXmtdGYXjP07H2QDwEeEQt5yW/LD9Jk6pnqTsiYhPgfWHs1yhmKy9tpFRicDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:14:49.411279Z"},"content_sha256":"34879f32831b662349dd9f80502ffbda9c7a1dfd2c7a8a3ff1f7ab5f6f7b41fa","schema_version":"1.0","event_id":"sha256:34879f32831b662349dd9f80502ffbda9c7a1dfd2c7a8a3ff1f7ab5f6f7b41fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/bundle.json","state_url":"https://pith.science/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/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-21T14:14:49Z","links":{"resolver":"https://pith.science/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV","bundle":"https://pith.science/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/bundle.json","state":"https://pith.science/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2ZXDBXSWL2LCWDS2IFWIV7BRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O2ZXDBXSWL2LCWDS2IFWIV7BRV","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":"9002f839ca01e15ecd1e05a80ebe479cfa3593870090d85a411add7ccbc3c673","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-20T20:26:57Z","title_canon_sha256":"44abd1f1fbed3bbee825536c62b29cf724d8db8ce4fb798bcaccdda1a32bdd0a"},"schema_version":"1.0","source":{"id":"1711.07530","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07530","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07530v3","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07530","created_at":"2026-05-18T00:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2ZXDBXSWL2L","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O2ZXDBXSWL2LCWDS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O2ZXDBXS","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:34879f32831b662349dd9f80502ffbda9c7a1dfd2c7a8a3ff1f7ab5f6f7b41fa","target":"graph","created_at":"2026-05-18T00:16:14Z","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":"The amount of transmitted data in computer networks is expected to grow considerably in the future, putting more and more pressure on the network infrastructures. In order to guarantee a good service, it then becomes fundamental to use the network resources efficiently. Network Utility Maximization (NUM) provides a framework to optimize the rate allocation when network resources are limited. Unfortunately, in the scenario where the amount of available resources is not known a priori, classical NUM solving methods do not offer a viable solution. To overcome this limitation we design an overlay ","authors_text":"Pascal Frossard, Stefano D'Aronco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-20T20:26:57Z","title":"Online Resource Inference in Network Utility Maximization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07530","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:23e5a6018aa659f8cff7e5ae694d3dab6b2a78309078452d2a45a1d7ec6a08cc","target":"record","created_at":"2026-05-18T00:16:14Z","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":"9002f839ca01e15ecd1e05a80ebe479cfa3593870090d85a411add7ccbc3c673","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-20T20:26:57Z","title_canon_sha256":"44abd1f1fbed3bbee825536c62b29cf724d8db8ce4fb798bcaccdda1a32bdd0a"},"schema_version":"1.0","source":{"id":"1711.07530","kind":"arxiv","version":3}},"canonical_sha256":"76b37186f2b2f4b15872d20b6457e18d622ed69d35ef3bd6a6668ec742bc0f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76b37186f2b2f4b15872d20b6457e18d622ed69d35ef3bd6a6668ec742bc0f65","first_computed_at":"2026-05-18T00:16:14.176481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:14.176481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kg4IOUnOmChqW7+wm21On5ALLRcfNs+PPcfBFagynf6S8XKYxKzF0yiXVQi33HLiLnofesjO34ltVimti/ScBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:14.177158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07530","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e5a6018aa659f8cff7e5ae694d3dab6b2a78309078452d2a45a1d7ec6a08cc","sha256:34879f32831b662349dd9f80502ffbda9c7a1dfd2c7a8a3ff1f7ab5f6f7b41fa"],"state_sha256":"0c2620924f31b41e86c53d59caa0ce32b837de36cdeb290e473911141bf4894b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt9MNJiJTeud9qoo/eEE/pFuvtdLwK5r6/7u21HdqsCP644KQmj07+fswsuW6aWVnidjKR5rmrr7XWGafy1XDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:14:49.414080Z","bundle_sha256":"4d6cc322d034d861710900c0959c32b3319a2990c301834d29baf2f031e9549f"}}