{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SLGTQ3NMTNYZJL4IW4MELG2EQE","short_pith_number":"pith:SLGTQ3NM","canonical_record":{"source":{"id":"1207.3650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-16T12:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"54a8ebf6da032a2d0e94071b2c226776f91dc896786370515f5392b0045e78ad","abstract_canon_sha256":"0c25a1f9c599a4d18de471f64dbaa7a264376e33ee18626348f1e46c8d40afc1"},"schema_version":"1.0"},"canonical_sha256":"92cd386dac9b7194af88b718459b448104666e1c3e82047a2678c6d91ee99e2a","source":{"kind":"arxiv","id":"1207.3650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3650","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3650v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3650","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"SLGTQ3NMTNYZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SLGTQ3NMTNYZJL4I","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SLGTQ3NM","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SLGTQ3NMTNYZJL4IW4MELG2EQE","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-16T12:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"54a8ebf6da032a2d0e94071b2c226776f91dc896786370515f5392b0045e78ad","abstract_canon_sha256":"0c25a1f9c599a4d18de471f64dbaa7a264376e33ee18626348f1e46c8d40afc1"},"schema_version":"1.0"},"canonical_sha256":"92cd386dac9b7194af88b718459b448104666e1c3e82047a2678c6d91ee99e2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:59.986352Z","signature_b64":"pTAkbYyL9/CDXrbE5WrVxnvSqiu4Q/Bvh9fbQLZmxsCHB6XsKd8MH3KYctOc0rwu0K5YipsHWlcDeQvey2ZVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92cd386dac9b7194af88b718459b448104666e1c3e82047a2678c6d91ee99e2a","last_reissued_at":"2026-05-18T03:50:59.985650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:59.985650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3650","source_version":1,"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-18T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyOoELvQ2IaynxSTuZ7bQiKi9hXd5AMFuQcDsMjWkGcDumEoyJTbP+mZhV0lUTS43mr2fABf7/Da1IyoOIiXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:18:40.778634Z"},"content_sha256":"a6e3cb4055a1e4e9f97b73a060c268cf9caac9ed93838c34adf90a9d27ba89d3","schema_version":"1.0","event_id":"sha256:a6e3cb4055a1e4e9f97b73a060c268cf9caac9ed93838c34adf90a9d27ba89d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SLGTQ3NMTNYZJL4IW4MELG2EQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best-effort networks: modeling and performance analysis via large networks asymptotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Arnaud De La Fortelle (INRIA Rocquencourt), Guy Fayolle (INRIA Rocquencourt), James Roberts, Jean-Marc Lasgouttes (INRIA Rocquencourt), Laurent Massouli\\'e","submitted_at":"2012-07-16T12:30:29Z","abstract_excerpt":"In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-effort service. We introduce the so-called min bandwidth sharing policy as a conservative approximation to the classical max-min policy. We establish necessary and sufficient ergodicity conditions for best-effort networks under the min policy. We then resort to the mean field technique of statistical physics to analyze network performance deriving fixed point equations for the stationary distribution of large symmetrica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3650","kind":"arxiv","version":1},"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-18T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btRqzdOmxxF2ESl/UHMSfvvv2KNEJOin13AIjD1ocEnaP54jWjMJukmyosbBHjKMxg1FeIKtThUHx1p9U2BaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:18:40.779264Z"},"content_sha256":"11dd4d0d2307197ad03a93fef6ce31a0db98b48110d6816e7480418a21aa4ec5","schema_version":"1.0","event_id":"sha256:11dd4d0d2307197ad03a93fef6ce31a0db98b48110d6816e7480418a21aa4ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/bundle.json","state_url":"https://pith.science/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/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-08T16:18:40Z","links":{"resolver":"https://pith.science/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE","bundle":"https://pith.science/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/bundle.json","state":"https://pith.science/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLGTQ3NMTNYZJL4IW4MELG2EQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SLGTQ3NMTNYZJL4IW4MELG2EQE","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":"0c25a1f9c599a4d18de471f64dbaa7a264376e33ee18626348f1e46c8d40afc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-16T12:30:29Z","title_canon_sha256":"54a8ebf6da032a2d0e94071b2c226776f91dc896786370515f5392b0045e78ad"},"schema_version":"1.0","source":{"id":"1207.3650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3650","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3650v1","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3650","created_at":"2026-05-18T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"SLGTQ3NMTNYZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SLGTQ3NMTNYZJL4I","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SLGTQ3NM","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:11dd4d0d2307197ad03a93fef6ce31a0db98b48110d6816e7480418a21aa4ec5","target":"graph","created_at":"2026-05-18T03:50:59Z","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":"In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-effort service. We introduce the so-called min bandwidth sharing policy as a conservative approximation to the classical max-min policy. We establish necessary and sufficient ergodicity conditions for best-effort networks under the min policy. We then resort to the mean field technique of statistical physics to analyze network performance deriving fixed point equations for the stationary distribution of large symmetrica","authors_text":"Arnaud De La Fortelle (INRIA Rocquencourt), Guy Fayolle (INRIA Rocquencourt), James Roberts, Jean-Marc Lasgouttes (INRIA Rocquencourt), Laurent Massouli\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-16T12:30:29Z","title":"Best-effort networks: modeling and performance analysis via large networks asymptotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3650","kind":"arxiv","version":1},"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:a6e3cb4055a1e4e9f97b73a060c268cf9caac9ed93838c34adf90a9d27ba89d3","target":"record","created_at":"2026-05-18T03:50:59Z","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":"0c25a1f9c599a4d18de471f64dbaa7a264376e33ee18626348f1e46c8d40afc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-16T12:30:29Z","title_canon_sha256":"54a8ebf6da032a2d0e94071b2c226776f91dc896786370515f5392b0045e78ad"},"schema_version":"1.0","source":{"id":"1207.3650","kind":"arxiv","version":1}},"canonical_sha256":"92cd386dac9b7194af88b718459b448104666e1c3e82047a2678c6d91ee99e2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92cd386dac9b7194af88b718459b448104666e1c3e82047a2678c6d91ee99e2a","first_computed_at":"2026-05-18T03:50:59.985650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:59.985650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pTAkbYyL9/CDXrbE5WrVxnvSqiu4Q/Bvh9fbQLZmxsCHB6XsKd8MH3KYctOc0rwu0K5YipsHWlcDeQvey2ZVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:59.986352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6e3cb4055a1e4e9f97b73a060c268cf9caac9ed93838c34adf90a9d27ba89d3","sha256:11dd4d0d2307197ad03a93fef6ce31a0db98b48110d6816e7480418a21aa4ec5"],"state_sha256":"39694ee50296e48aedd07beda160487bc6833c07683f72800ceddfca46d4f6d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUQEoj6WJdEEDwJFsFYJJx1x01UKE+n0iU+O6NXhst/lVShrITgkX4VGJXuS0Ml8FvgPSZHrutSXNhWlwLoQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:18:40.781694Z","bundle_sha256":"7f8a2ec4a3b574f8ced55ac876c558a843055ca2137bcb8b47004630707f6222"}}