{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PN3PA4J23KBPB2DRH4UMUDEJZ4","short_pith_number":"pith:PN3PA4J2","schema_version":"1.0","canonical_sha256":"7b76f0713ada82f0e8713f28ca0c89cf3b78e5fd079e4b76c45a993e1fba76a3","source":{"kind":"arxiv","id":"1603.09009","version":1},"attestation_state":"computed","paper":{"title":"Routing under Balance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Alina Ene, Gary Miller, Jakub Pachocki","submitted_at":"2016-03-30T01:09:47Z","abstract_excerpt":"We introduce the notion of balance for directed graphs: a weighted directed graph is $\\alpha$-balanced if for every cut $S \\subseteq V$, the total weight of edges going from $S$ to $V\\setminus S$ is within factor $\\alpha$ of the total weight of edges going from $V\\setminus S$ to $S$. Several important families of graphs are nearly balanced, in particular, Eulerian graphs (with $\\alpha = 1$) and residual graphs of $(1+\\epsilon)$-approximate undirected maximum flows (with $\\alpha=O(1/\\epsilon)$).\n  We use the notion of balance to give a more fine-grained understanding of several well-studied rou"},"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":"1603.09009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-30T01:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"dd551d85b816658ef15b75c79c67e09f35adf56195316f826e7e9418c157b852","abstract_canon_sha256":"874f6733d5fdfec32c1b0d24d7e6bc1331960831c40852839c9c28938ac3fdcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:04.025284Z","signature_b64":"gFzCC2m1NwMQA8RnkeJDs4xj4EC8uQjNyziXpg08Mk1Rw8cGnHgunNLRFY4jpzhkRKrM+WsUEUVJXAHzNsqeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b76f0713ada82f0e8713f28ca0c89cf3b78e5fd079e4b76c45a993e1fba76a3","last_reissued_at":"2026-05-18T01:18:04.024472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:04.024472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing under Balance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Alina Ene, Gary Miller, Jakub Pachocki","submitted_at":"2016-03-30T01:09:47Z","abstract_excerpt":"We introduce the notion of balance for directed graphs: a weighted directed graph is $\\alpha$-balanced if for every cut $S \\subseteq V$, the total weight of edges going from $S$ to $V\\setminus S$ is within factor $\\alpha$ of the total weight of edges going from $V\\setminus S$ to $S$. Several important families of graphs are nearly balanced, in particular, Eulerian graphs (with $\\alpha = 1$) and residual graphs of $(1+\\epsilon)$-approximate undirected maximum flows (with $\\alpha=O(1/\\epsilon)$).\n  We use the notion of balance to give a more fine-grained understanding of several well-studied rou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09009","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.09009","created_at":"2026-05-18T01:18:04.024605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09009v1","created_at":"2026-05-18T01:18:04.024605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09009","created_at":"2026-05-18T01:18:04.024605+00:00"},{"alias_kind":"pith_short_12","alias_value":"PN3PA4J23KBP","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PN3PA4J23KBPB2DR","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PN3PA4J2","created_at":"2026-05-18T12:30:39.010887+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/PN3PA4J23KBPB2DRH4UMUDEJZ4","json":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4.json","graph_json":"https://pith.science/api/pith-number/PN3PA4J23KBPB2DRH4UMUDEJZ4/graph.json","events_json":"https://pith.science/api/pith-number/PN3PA4J23KBPB2DRH4UMUDEJZ4/events.json","paper":"https://pith.science/paper/PN3PA4J2"},"agent_actions":{"view_html":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4","download_json":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4.json","view_paper":"https://pith.science/paper/PN3PA4J2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09009&json=true","fetch_graph":"https://pith.science/api/pith-number/PN3PA4J23KBPB2DRH4UMUDEJZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/PN3PA4J23KBPB2DRH4UMUDEJZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4/action/storage_attestation","attest_author":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4/action/author_attestation","sign_citation":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4/action/citation_signature","submit_replication":"https://pith.science/pith/PN3PA4J23KBPB2DRH4UMUDEJZ4/action/replication_record"}},"created_at":"2026-05-18T01:18:04.024605+00:00","updated_at":"2026-05-18T01:18:04.024605+00:00"}