{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EENN3BJ76FAGSPBWPOVHCGQBGP","short_pith_number":"pith:EENN3BJ7","canonical_record":{"source":{"id":"1108.0025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-29T22:26:09Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"ae22e2d211c050583a8373d92ee1ed667eb4f401cd1c89fbe1b8d1318f17936e","abstract_canon_sha256":"f783b84d288de72ee84a6de5ba7bb6d19448eddfd4c88fd166b48b121130fd4c"},"schema_version":"1.0"},"canonical_sha256":"211add853ff140693c367baa711a0133c8ebd6d2befd2015410d72ae6e46dd90","source":{"kind":"arxiv","id":"1108.0025","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0025","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0025v3","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0025","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"EENN3BJ76FAG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EENN3BJ76FAGSPBW","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EENN3BJ7","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EENN3BJ76FAGSPBWPOVHCGQBGP","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-29T22:26:09Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"ae22e2d211c050583a8373d92ee1ed667eb4f401cd1c89fbe1b8d1318f17936e","abstract_canon_sha256":"f783b84d288de72ee84a6de5ba7bb6d19448eddfd4c88fd166b48b121130fd4c"},"schema_version":"1.0"},"canonical_sha256":"211add853ff140693c367baa711a0133c8ebd6d2befd2015410d72ae6e46dd90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:01:05.450155Z","signature_b64":"fFsBvctY+aYGkN8dyHl0YVMwKZ0O4vfFOcS9ps/hbpCQidkRdBmMLeEq9E9P9OKo+ASlEztBMwdsYiDImDh+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211add853ff140693c367baa711a0133c8ebd6d2befd2015410d72ae6e46dd90","last_reissued_at":"2026-05-18T02:01:05.449651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:01:05.449651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0025","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-18T02:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j24tSCniQsVYH13dNoy7nncELKJ6zf5CqPvdraJGgYNbr9iy4pEVDJ+XiSKlSGXTxIqbpkiZcyCYR227l/v3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:29.864917Z"},"content_sha256":"0073d3ce218d39920b305a4153e78cf39cb1181c891d63a4eef46fb11d71af28","schema_version":"1.0","event_id":"sha256:0073d3ce218d39920b305a4153e78cf39cb1181c891d63a4eef46fb11d71af28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EENN3BJ76FAGSPBWPOVHCGQBGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair sharing of resources in a supply network with constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"David K. Arrowsmith, Dirk Helbing, Lubos Buzna, Rui Carvalho, Wolfram Just","submitted_at":"2011-07-29T22:26:09Z","abstract_excerpt":"This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyse a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semi-analytical methods on a nearest neighbour graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0025","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-18T02:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxIDPq4r9nLupdeU3naRXJrEI+5RaOxlx7TnrbD7//Y1+o+5vFwGhySdcmdddZCryvDFT6Fet/VDDhYh0hexBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:29.865660Z"},"content_sha256":"4239909afc2655710f31b2115e899ffa8e9991d94769e73e18c81e44e3e1a9d4","schema_version":"1.0","event_id":"sha256:4239909afc2655710f31b2115e899ffa8e9991d94769e73e18c81e44e3e1a9d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/bundle.json","state_url":"https://pith.science/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/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-05-30T05:20:29Z","links":{"resolver":"https://pith.science/pith/EENN3BJ76FAGSPBWPOVHCGQBGP","bundle":"https://pith.science/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/bundle.json","state":"https://pith.science/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EENN3BJ76FAGSPBWPOVHCGQBGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EENN3BJ76FAGSPBWPOVHCGQBGP","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":"f783b84d288de72ee84a6de5ba7bb6d19448eddfd4c88fd166b48b121130fd4c","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-29T22:26:09Z","title_canon_sha256":"ae22e2d211c050583a8373d92ee1ed667eb4f401cd1c89fbe1b8d1318f17936e"},"schema_version":"1.0","source":{"id":"1108.0025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0025","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0025v3","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0025","created_at":"2026-05-18T02:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"EENN3BJ76FAG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EENN3BJ76FAGSPBW","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EENN3BJ7","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4239909afc2655710f31b2115e899ffa8e9991d94769e73e18c81e44e3e1a9d4","target":"graph","created_at":"2026-05-18T02:01:05Z","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":"This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyse a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semi-analytical methods on a nearest neighbour graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and ","authors_text":"David K. Arrowsmith, Dirk Helbing, Lubos Buzna, Rui Carvalho, Wolfram Just","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-29T22:26:09Z","title":"Fair sharing of resources in a supply network with constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0025","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:0073d3ce218d39920b305a4153e78cf39cb1181c891d63a4eef46fb11d71af28","target":"record","created_at":"2026-05-18T02:01:05Z","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":"f783b84d288de72ee84a6de5ba7bb6d19448eddfd4c88fd166b48b121130fd4c","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-07-29T22:26:09Z","title_canon_sha256":"ae22e2d211c050583a8373d92ee1ed667eb4f401cd1c89fbe1b8d1318f17936e"},"schema_version":"1.0","source":{"id":"1108.0025","kind":"arxiv","version":3}},"canonical_sha256":"211add853ff140693c367baa711a0133c8ebd6d2befd2015410d72ae6e46dd90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"211add853ff140693c367baa711a0133c8ebd6d2befd2015410d72ae6e46dd90","first_computed_at":"2026-05-18T02:01:05.449651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:01:05.449651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fFsBvctY+aYGkN8dyHl0YVMwKZ0O4vfFOcS9ps/hbpCQidkRdBmMLeEq9E9P9OKo+ASlEztBMwdsYiDImDh+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:01:05.450155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0073d3ce218d39920b305a4153e78cf39cb1181c891d63a4eef46fb11d71af28","sha256:4239909afc2655710f31b2115e899ffa8e9991d94769e73e18c81e44e3e1a9d4"],"state_sha256":"e61a9a833ff329ce5558b48896071cf6fc8d5a275792466ee00d87884fdbf770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bDFhebC6Cd5A/D36OI9WHBB94X04pbFaU1CjVVbwbwVuVVEY5pv6inZ0Ly8TsdiiHunxE1F7moWlYVjcgArCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:20:29.869750Z","bundle_sha256":"2bc861f2a93ab9931b76a5f16f198b1d892e5d27c69eeada9428dc6a2b7ca247"}}