{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:7Z4D2QX5K4XXWDUBCHXQAYYBOO","short_pith_number":"pith:7Z4D2QX5","schema_version":"1.0","canonical_sha256":"fe783d42fd572f7b0e8111ef00630173b02d6d942a21da6a6825aaac0ed8dab5","source":{"kind":"arxiv","id":"0801.1260","version":3},"attestation_state":"computed","paper":{"title":"Balanced routing of random calls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Colin McDiarmid, Malwina J. Luczak","submitted_at":"2008-01-08T20:51:25Z","abstract_excerpt":"We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balanced dynamic alternative routing algorithm simultaneously selects $d$ random two-link routes, and the call is accepted on a route minimising the maximum of the loads on its two links, provided nei"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0801.1260","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-01-08T20:51:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"65bc1ee31a8cd51b22163ea5863539d18eeee86c071aa55a4e0649e219b33fe8","abstract_canon_sha256":"5524ed44bebe91eabcc663ed834622e2ff0fa77a92a18b41d280b8d8957c0e0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:45.201458Z","signature_b64":"eZX4bqXhp4HnwnfEdmVYwWc8+nsK/BCp/IhiNFpTJHzX07yXPEqbTxuvM9LmDP4x+N96HPKrnCZrQePD0+RzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe783d42fd572f7b0e8111ef00630173b02d6d942a21da6a6825aaac0ed8dab5","last_reissued_at":"2026-05-18T01:37:45.200997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:45.200997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced routing of random calls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Colin McDiarmid, Malwina J. Luczak","submitted_at":"2008-01-08T20:51:25Z","abstract_excerpt":"We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balanced dynamic alternative routing algorithm simultaneously selects $d$ random two-link routes, and the call is accepted on a route minimising the maximum of the loads on its two links, provided nei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1260","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0801.1260","created_at":"2026-05-18T01:37:45.201066+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.1260v3","created_at":"2026-05-18T01:37:45.201066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1260","created_at":"2026-05-18T01:37:45.201066+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Z4D2QX5K4XX","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Z4D2QX5K4XXWDUB","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Z4D2QX5","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO","json":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO.json","graph_json":"https://pith.science/api/pith-number/7Z4D2QX5K4XXWDUBCHXQAYYBOO/graph.json","events_json":"https://pith.science/api/pith-number/7Z4D2QX5K4XXWDUBCHXQAYYBOO/events.json","paper":"https://pith.science/paper/7Z4D2QX5"},"agent_actions":{"view_html":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO","download_json":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO.json","view_paper":"https://pith.science/paper/7Z4D2QX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.1260&json=true","fetch_graph":"https://pith.science/api/pith-number/7Z4D2QX5K4XXWDUBCHXQAYYBOO/graph.json","fetch_events":"https://pith.science/api/pith-number/7Z4D2QX5K4XXWDUBCHXQAYYBOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO/action/storage_attestation","attest_author":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO/action/author_attestation","sign_citation":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO/action/citation_signature","submit_replication":"https://pith.science/pith/7Z4D2QX5K4XXWDUBCHXQAYYBOO/action/replication_record"}},"created_at":"2026-05-18T01:37:45.201066+00:00","updated_at":"2026-05-18T01:37:45.201066+00:00"}