{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3AW7Y7IFRSX3OZPYH2IYVOZWUK","short_pith_number":"pith:3AW7Y7IF","schema_version":"1.0","canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","source":{"kind":"arxiv","id":"1503.00540","version":1},"attestation_state":"computed","paper":{"title":"The edge-disjoint path problem on random graphs by message-passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alfredo Braunstein, Caterina De Bacco, Fabrizio Altarelli, Luca Dall'Asta, Silvio Franz","submitted_at":"2015-03-02T14:27:02Z","abstract_excerpt":"We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an exponential computational cost in the number of paths. To overcome this obstacle we propose an efficient implementation by mapping the equations onto a weighted combinatorial matching problem over an auxiliary graph. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization "},"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":"1503.00540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-03-02T14:27:02Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"3e24b356b4ca08e9eac592aa101e19b4cccf4ebcb957df115682035f67eefe8b","abstract_canon_sha256":"37da3ad3598c6e4fc8d8934137a34c5760adbd706c6199efba6fa74f4a2a8451"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:18.870846Z","signature_b64":"wCZ7uS0f0WIgkVNlRJoS69XmkeD/uCsT74X8lR1bh1OCpQgXL1i/opf3u4a8K/fUBdlT3M8uNWttlCNRXdheCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","last_reissued_at":"2026-05-18T01:22:18.870055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:18.870055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The edge-disjoint path problem on random graphs by message-passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alfredo Braunstein, Caterina De Bacco, Fabrizio Altarelli, Luca Dall'Asta, Silvio Franz","submitted_at":"2015-03-02T14:27:02Z","abstract_excerpt":"We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an exponential computational cost in the number of paths. To overcome this obstacle we propose an efficient implementation by mapping the equations onto a weighted combinatorial matching problem over an auxiliary graph. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00540","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":"1503.00540","created_at":"2026-05-18T01:22:18.870192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00540v1","created_at":"2026-05-18T01:22:18.870192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00540","created_at":"2026-05-18T01:22:18.870192+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AW7Y7IFRSX3","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AW7Y7IFRSX3OZPY","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AW7Y7IF","created_at":"2026-05-18T12:29:02.477457+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/3AW7Y7IFRSX3OZPYH2IYVOZWUK","json":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK.json","graph_json":"https://pith.science/api/pith-number/3AW7Y7IFRSX3OZPYH2IYVOZWUK/graph.json","events_json":"https://pith.science/api/pith-number/3AW7Y7IFRSX3OZPYH2IYVOZWUK/events.json","paper":"https://pith.science/paper/3AW7Y7IF"},"agent_actions":{"view_html":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK","download_json":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK.json","view_paper":"https://pith.science/paper/3AW7Y7IF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00540&json=true","fetch_graph":"https://pith.science/api/pith-number/3AW7Y7IFRSX3OZPYH2IYVOZWUK/graph.json","fetch_events":"https://pith.science/api/pith-number/3AW7Y7IFRSX3OZPYH2IYVOZWUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/action/storage_attestation","attest_author":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/action/author_attestation","sign_citation":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/action/citation_signature","submit_replication":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/action/replication_record"}},"created_at":"2026-05-18T01:22:18.870192+00:00","updated_at":"2026-05-18T01:22:18.870192+00:00"}