{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4FZC2WJWIFLECNSONI2FFESVMC","short_pith_number":"pith:4FZC2WJW","schema_version":"1.0","canonical_sha256":"e1722d5936415641364e6a345292556091ec10f608370ba17f8ae4a0cc144b3a","source":{"kind":"arxiv","id":"2405.03908","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Expander Routing: Faster and More Versatile","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hsin-Hao Su, Shang-En Huang, Yi-Jun Chang","submitted_at":"2024-05-06T23:52:20Z","abstract_excerpt":"We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is the source and the destination of at most $\\deg(v)$ tokens. They developed $\\textit{randomized algorithms}$ that solve this problem in $\\text{poly}(\\phi^{-1}) \\cdot 2^{O(\\sqrt{\\log n \\log \\log n})}$ rounds in the $\\textsf{CONGEST}$ model, where $\\phi$ is the conductance of the graph. Later, Ghaffari and Li (DISC 2018) gave an improved algorithm. However, both algorithms are randomized, which means that all the resul"},"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":"2405.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-05-06T23:52:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4cb375a0489e51ab34f0cf1747f1a5d904dabb6b422f0856f811d5e17d576179","abstract_canon_sha256":"2e2ff73a85cdddf1924279152bbac6ac54320bb22ff9921f0ad10ce9ae4621e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:49.438677Z","signature_b64":"Pxmf5QJPzUIUHzfB7183ONSOKl36vnPGKj1A7pLvReDjU3HqpoxHBDEgmqhXA30lFB6CJcrVK6ReFOcZec96BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1722d5936415641364e6a345292556091ec10f608370ba17f8ae4a0cc144b3a","last_reissued_at":"2026-07-05T08:16:49.438250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:49.438250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Expander Routing: Faster and More Versatile","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Hsin-Hao Su, Shang-En Huang, Yi-Jun Chang","submitted_at":"2024-05-06T23:52:20Z","abstract_excerpt":"We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is the source and the destination of at most $\\deg(v)$ tokens. They developed $\\textit{randomized algorithms}$ that solve this problem in $\\text{poly}(\\phi^{-1}) \\cdot 2^{O(\\sqrt{\\log n \\log \\log n})}$ rounds in the $\\textsf{CONGEST}$ model, where $\\phi$ is the conductance of the graph. Later, Ghaffari and Li (DISC 2018) gave an improved algorithm. However, both algorithms are randomized, which means that all the resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03908","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.03908/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.03908","created_at":"2026-07-05T08:16:49.438309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03908v1","created_at":"2026-07-05T08:16:49.438309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03908","created_at":"2026-07-05T08:16:49.438309+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FZC2WJWIFLE","created_at":"2026-07-05T08:16:49.438309+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FZC2WJWIFLECNSO","created_at":"2026-07-05T08:16:49.438309+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FZC2WJW","created_at":"2026-07-05T08:16:49.438309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10632","citing_title":"Local Sherman's Algorithm for Multi-commodity Flow","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC","json":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC.json","graph_json":"https://pith.science/api/pith-number/4FZC2WJWIFLECNSONI2FFESVMC/graph.json","events_json":"https://pith.science/api/pith-number/4FZC2WJWIFLECNSONI2FFESVMC/events.json","paper":"https://pith.science/paper/4FZC2WJW"},"agent_actions":{"view_html":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC","download_json":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC.json","view_paper":"https://pith.science/paper/4FZC2WJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03908&json=true","fetch_graph":"https://pith.science/api/pith-number/4FZC2WJWIFLECNSONI2FFESVMC/graph.json","fetch_events":"https://pith.science/api/pith-number/4FZC2WJWIFLECNSONI2FFESVMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC/action/storage_attestation","attest_author":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC/action/author_attestation","sign_citation":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC/action/citation_signature","submit_replication":"https://pith.science/pith/4FZC2WJWIFLECNSONI2FFESVMC/action/replication_record"}},"created_at":"2026-07-05T08:16:49.438309+00:00","updated_at":"2026-07-05T08:16:49.438309+00:00"}