{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7UXDKTVS5IVGVWCO3UJWRWZBGQ","short_pith_number":"pith:7UXDKTVS","schema_version":"1.0","canonical_sha256":"fd2e354eb2ea2a6ad84edd1368db21342880224ced7a25175a685a7eb367ade8","source":{"kind":"arxiv","id":"1809.06562","version":1},"attestation_state":"computed","paper":{"title":"A Simple Approximation for a Hard Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'as Farag\\'o, Rupei Xu","submitted_at":"2018-09-18T07:20:16Z","abstract_excerpt":"We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In most applications, one can encounter its capacitated generalization, which is known as the Unsplitting Flow problem. These algorithmic tasks are very hard in general, but various efficient (polynomial-time) approximate solutions are known. Nevertheless, the approximations tend to be rather complicated, often rendering them impractical in large, complex networks"},"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":"1809.06562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T07:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"6d59e38a051cd0397798a4d01e68735bb0fee09789e5950d7c52a7aabeba4fba","abstract_canon_sha256":"9a4e90abe1cbd2a332ab18e7047c54cc101b2a934f272f8d0e131191e58b9cdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:25.344820Z","signature_b64":"Wvl3/GhiqdaOA4MixavnvvDCFANeTmxno0nBt45uMsPYeU06tuNbXzbEaljN3ZhqO7XV0o0nrv/mwoTFNPzrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2e354eb2ea2a6ad84edd1368db21342880224ced7a25175a685a7eb367ade8","last_reissued_at":"2026-05-18T00:05:25.344218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:25.344218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Approximation for a Hard Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'as Farag\\'o, Rupei Xu","submitted_at":"2018-09-18T07:20:16Z","abstract_excerpt":"We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In most applications, one can encounter its capacitated generalization, which is known as the Unsplitting Flow problem. These algorithmic tasks are very hard in general, but various efficient (polynomial-time) approximate solutions are known. Nevertheless, the approximations tend to be rather complicated, often rendering them impractical in large, complex networks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06562","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":"1809.06562","created_at":"2026-05-18T00:05:25.344333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06562v1","created_at":"2026-05-18T00:05:25.344333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06562","created_at":"2026-05-18T00:05:25.344333+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UXDKTVS5IVG","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UXDKTVS5IVGVWCO","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UXDKTVS","created_at":"2026-05-18T12:32:11.075285+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/7UXDKTVS5IVGVWCO3UJWRWZBGQ","json":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ.json","graph_json":"https://pith.science/api/pith-number/7UXDKTVS5IVGVWCO3UJWRWZBGQ/graph.json","events_json":"https://pith.science/api/pith-number/7UXDKTVS5IVGVWCO3UJWRWZBGQ/events.json","paper":"https://pith.science/paper/7UXDKTVS"},"agent_actions":{"view_html":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ","download_json":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ.json","view_paper":"https://pith.science/paper/7UXDKTVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06562&json=true","fetch_graph":"https://pith.science/api/pith-number/7UXDKTVS5IVGVWCO3UJWRWZBGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7UXDKTVS5IVGVWCO3UJWRWZBGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ/action/storage_attestation","attest_author":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ/action/author_attestation","sign_citation":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ/action/citation_signature","submit_replication":"https://pith.science/pith/7UXDKTVS5IVGVWCO3UJWRWZBGQ/action/replication_record"}},"created_at":"2026-05-18T00:05:25.344333+00:00","updated_at":"2026-05-18T00:05:25.344333+00:00"}