{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:HT7FX5LUFAAH4ABYI6O3OKBAWS","short_pith_number":"pith:HT7FX5LU","schema_version":"1.0","canonical_sha256":"3cfe5bf57428007e0038479db72820b48d39df26736b99adaf2eb8cafeeabe19","source":{"kind":"arxiv","id":"math/0511694","version":2},"attestation_state":"computed","paper":{"title":"Optimal flow through the disordered lattice","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Aldous","submitted_at":"2005-11-29T00:16:44Z","abstract_excerpt":"Consider routing traffic on the N x N torus, simultaneously between all source-destination pairs, to minimize the cost $\\sum_ec(e)f^2(e)$, where f(e) is the volume of flow across edge e and the c(e) form an i.i.d. random environment. We prove existence of a rescaled $N\\to \\infty$ limit constant for minimum cost, by comparison with an appropriate analogous problem about minimum-cost flows across a M x M subsquare of the lattice."},"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":"math/0511694","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-11-29T00:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"f9b5ef0262c620a9a8e8255ff83991b049263552f7d813b2f8a55d375d6c4cfd","abstract_canon_sha256":"7b421b1a33dfa8e21fbecaad42785e739cc7e848162d7844bf712212483695cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:53.694432Z","signature_b64":"GdiYbH8t+v+7iMo+kAIQDV5AmPdu/vZLwpwsFpQT6THXU8otLRnm5B01kOXLLc+lwN3ltFCBqHMSrCSdgQUeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cfe5bf57428007e0038479db72820b48d39df26736b99adaf2eb8cafeeabe19","last_reissued_at":"2026-05-18T04:08:53.693815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:53.693815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal flow through the disordered lattice","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Aldous","submitted_at":"2005-11-29T00:16:44Z","abstract_excerpt":"Consider routing traffic on the N x N torus, simultaneously between all source-destination pairs, to minimize the cost $\\sum_ec(e)f^2(e)$, where f(e) is the volume of flow across edge e and the c(e) form an i.i.d. random environment. We prove existence of a rescaled $N\\to \\infty$ limit constant for minimum cost, by comparison with an appropriate analogous problem about minimum-cost flows across a M x M subsquare of the lattice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0511694","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0511694","created_at":"2026-05-18T04:08:53.693909+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0511694v2","created_at":"2026-05-18T04:08:53.693909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0511694","created_at":"2026-05-18T04:08:53.693909+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT7FX5LUFAAH","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT7FX5LUFAAH4ABY","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT7FX5LU","created_at":"2026-05-18T12:25:53.335082+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/HT7FX5LUFAAH4ABYI6O3OKBAWS","json":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS.json","graph_json":"https://pith.science/api/pith-number/HT7FX5LUFAAH4ABYI6O3OKBAWS/graph.json","events_json":"https://pith.science/api/pith-number/HT7FX5LUFAAH4ABYI6O3OKBAWS/events.json","paper":"https://pith.science/paper/HT7FX5LU"},"agent_actions":{"view_html":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS","download_json":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS.json","view_paper":"https://pith.science/paper/HT7FX5LU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0511694&json=true","fetch_graph":"https://pith.science/api/pith-number/HT7FX5LUFAAH4ABYI6O3OKBAWS/graph.json","fetch_events":"https://pith.science/api/pith-number/HT7FX5LUFAAH4ABYI6O3OKBAWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS/action/storage_attestation","attest_author":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS/action/author_attestation","sign_citation":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS/action/citation_signature","submit_replication":"https://pith.science/pith/HT7FX5LUFAAH4ABYI6O3OKBAWS/action/replication_record"}},"created_at":"2026-05-18T04:08:53.693909+00:00","updated_at":"2026-05-18T04:08:53.693909+00:00"}