{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IJHVJOD3ORBRXQH36BEWM2BKOT","short_pith_number":"pith:IJHVJOD3","canonical_record":{"source":{"id":"1512.09293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-31T14:32:08Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"fee16b0378724136753a05154784865e9f1661542b5ea4f59a13453e68d83c16","abstract_canon_sha256":"cb915d79f97b6b4ca9e1cc5af7a20f9873685606542c0f5b42f193f15e4604ee"},"schema_version":"1.0"},"canonical_sha256":"424f54b87b74431bc0fbf04966682a74cf160618722d70710984d94137c96b50","source":{"kind":"arxiv","id":"1512.09293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09293","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09293v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09293","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"IJHVJOD3ORBR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IJHVJOD3ORBRXQH3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IJHVJOD3","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IJHVJOD3ORBRXQH36BEWM2BKOT","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-31T14:32:08Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"fee16b0378724136753a05154784865e9f1661542b5ea4f59a13453e68d83c16","abstract_canon_sha256":"cb915d79f97b6b4ca9e1cc5af7a20f9873685606542c0f5b42f193f15e4604ee"},"schema_version":"1.0"},"canonical_sha256":"424f54b87b74431bc0fbf04966682a74cf160618722d70710984d94137c96b50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:51.746258Z","signature_b64":"saMjlqYla6EQ9sYPHb4APdrEpUZBuxz0ef45//o7+3UHubyEw3hsTcxhQxsZfVlkrUO1vszgQXuGyVOjhdRYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"424f54b87b74431bc0fbf04966682a74cf160618722d70710984d94137c96b50","last_reissued_at":"2026-05-18T00:36:51.745611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:51.745611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09293","source_version":2,"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65n6F+jHQWo9Hdr5cBOONPxZi6d6wF0IggF3Zon1QWKuCkWqz4cenRB3dWyl5Xn+UCFaqr/Kgx716fdq0AwjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:07:51.035717Z"},"content_sha256":"d9f584b34cb3928e6a5fe5a7b25448f9eb30c27e2096d8946ebb0c59c0906f19","schema_version":"1.0","event_id":"sha256:d9f584b34cb3928e6a5fe5a7b25448f9eb30c27e2096d8946ebb0c59c0906f19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IJHVJOD3ORBRXQH36BEWM2BKOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Controlling congestion on complex networks: fairness, efficiency and network structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"physics.soc-ph","authors_text":"Lubos Buzna, Rui Carvalho","submitted_at":"2015-12-31T14:32:08Z","abstract_excerpt":"We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09293","kind":"arxiv","version":2},"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBFbafY4zGArRIZjNb+P3kfBnxDND/4jM5AT2crXZtkcXZM2QhdFEyfKh2efWC1f2Er+Pxt/7bVM0987ld4WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:07:51.036072Z"},"content_sha256":"63da7e40b35302dac3f098107c333e2ce7f2d04136efe2b570b98b33aff7e1c5","schema_version":"1.0","event_id":"sha256:63da7e40b35302dac3f098107c333e2ce7f2d04136efe2b570b98b33aff7e1c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/bundle.json","state_url":"https://pith.science/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/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-01T06:07:51Z","links":{"resolver":"https://pith.science/pith/IJHVJOD3ORBRXQH36BEWM2BKOT","bundle":"https://pith.science/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/bundle.json","state":"https://pith.science/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJHVJOD3ORBRXQH36BEWM2BKOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IJHVJOD3ORBRXQH36BEWM2BKOT","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":"cb915d79f97b6b4ca9e1cc5af7a20f9873685606542c0f5b42f193f15e4604ee","cross_cats_sorted":["cs.NI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-31T14:32:08Z","title_canon_sha256":"fee16b0378724136753a05154784865e9f1661542b5ea4f59a13453e68d83c16"},"schema_version":"1.0","source":{"id":"1512.09293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09293","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09293v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09293","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"IJHVJOD3ORBR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IJHVJOD3ORBRXQH3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IJHVJOD3","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:63da7e40b35302dac3f098107c333e2ce7f2d04136efe2b570b98b33aff7e1c5","target":"graph","created_at":"2026-05-18T00:36:51Z","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 two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is fa","authors_text":"Lubos Buzna, Rui Carvalho","cross_cats":["cs.NI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-31T14:32:08Z","title":"Controlling congestion on complex networks: fairness, efficiency and network structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09293","kind":"arxiv","version":2},"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:d9f584b34cb3928e6a5fe5a7b25448f9eb30c27e2096d8946ebb0c59c0906f19","target":"record","created_at":"2026-05-18T00:36:51Z","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":"cb915d79f97b6b4ca9e1cc5af7a20f9873685606542c0f5b42f193f15e4604ee","cross_cats_sorted":["cs.NI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-31T14:32:08Z","title_canon_sha256":"fee16b0378724136753a05154784865e9f1661542b5ea4f59a13453e68d83c16"},"schema_version":"1.0","source":{"id":"1512.09293","kind":"arxiv","version":2}},"canonical_sha256":"424f54b87b74431bc0fbf04966682a74cf160618722d70710984d94137c96b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"424f54b87b74431bc0fbf04966682a74cf160618722d70710984d94137c96b50","first_computed_at":"2026-05-18T00:36:51.745611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:51.745611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"saMjlqYla6EQ9sYPHb4APdrEpUZBuxz0ef45//o7+3UHubyEw3hsTcxhQxsZfVlkrUO1vszgQXuGyVOjhdRYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:51.746258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9f584b34cb3928e6a5fe5a7b25448f9eb30c27e2096d8946ebb0c59c0906f19","sha256:63da7e40b35302dac3f098107c333e2ce7f2d04136efe2b570b98b33aff7e1c5"],"state_sha256":"5eaf7bbcdccb4f474a944b8f2936c99b0867a67a4a7015f45ba70efb96167586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zN1PkoDmndYvbYHDv9T8kJIALxmRrc6jOe0lGP5307dyBUmtrMB+us8o3hdx/acBIAr6SIfe54PdptTktNaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:07:51.038048Z","bundle_sha256":"80e64bf16d5c26d82037a889d0f941dab63fff1ed41cdecda829d94b58b35792"}}