{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NLEWNDITSWZTT2V4L5C347RLJT","short_pith_number":"pith:NLEWNDIT","schema_version":"1.0","canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","source":{"kind":"arxiv","id":"1401.8096","version":2},"attestation_state":"computed","paper":{"title":"Shortest node-disjoint paths on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Caterina De Bacco, Chi Ho Yeung, David Saad, Silvio Franz","submitted_at":"2014-01-31T09:34:29Z","abstract_excerpt":"A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analysed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm."},"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":"1401.8096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-01-31T09:34:29Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"6ce5e6df20356dbcf4b2235e888915cd0c9d37aeed790f9e05b411f8381f5bd9","abstract_canon_sha256":"205d72174fc3b9f1c0d5ca897914fc4574444b30fe0d8b9c2f8bf2dfe27aabbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:02.026370Z","signature_b64":"tUMOhhHoUKJMc1TQluJeZ6rlnxy9sW2O0Ri3GJY1zWOqoadXlbFTDOt9TN4E25umQ4h/GwppXCXrjzHg1qzPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","last_reissued_at":"2026-05-18T02:40:02.025887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:02.025887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest node-disjoint paths on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Caterina De Bacco, Chi Ho Yeung, David Saad, Silvio Franz","submitted_at":"2014-01-31T09:34:29Z","abstract_excerpt":"A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analysed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8096","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":"1401.8096","created_at":"2026-05-18T02:40:02.025954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.8096v2","created_at":"2026-05-18T02:40:02.025954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8096","created_at":"2026-05-18T02:40:02.025954+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLEWNDITSWZT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLEWNDITSWZTT2V4","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLEWNDIT","created_at":"2026-05-18T12:28:41.024544+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/NLEWNDITSWZTT2V4L5C347RLJT","json":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT.json","graph_json":"https://pith.science/api/pith-number/NLEWNDITSWZTT2V4L5C347RLJT/graph.json","events_json":"https://pith.science/api/pith-number/NLEWNDITSWZTT2V4L5C347RLJT/events.json","paper":"https://pith.science/paper/NLEWNDIT"},"agent_actions":{"view_html":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT","download_json":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT.json","view_paper":"https://pith.science/paper/NLEWNDIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.8096&json=true","fetch_graph":"https://pith.science/api/pith-number/NLEWNDITSWZTT2V4L5C347RLJT/graph.json","fetch_events":"https://pith.science/api/pith-number/NLEWNDITSWZTT2V4L5C347RLJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/action/storage_attestation","attest_author":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/action/author_attestation","sign_citation":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/action/citation_signature","submit_replication":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/action/replication_record"}},"created_at":"2026-05-18T02:40:02.025954+00:00","updated_at":"2026-05-18T02:40:02.025954+00:00"}