{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NLEWNDITSWZTT2V4L5C347RLJT","short_pith_number":"pith:NLEWNDIT","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"},"canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","source":{"kind":"arxiv","id":"1401.8096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8096","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8096v2","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8096","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"NLEWNDITSWZT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLEWNDITSWZTT2V4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLEWNDIT","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NLEWNDITSWZTT2V4L5C347RLJT","target":"record","payload":{"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"},"canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","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"},"source_kind":"arxiv","source_id":"1401.8096","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDtgQLrXYemMDAslliMAAV5rH8+15KmE1oDdTPOGSeonkXgnuXO8UjdzCYDWoSOZsuYdhC3/89gsvnaqRFAWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:59.968578Z"},"content_sha256":"920826d11f8e2e6e79ea9ebf95e65aa67d83f8a5f9258fa5ab5eebd330e4499e","schema_version":"1.0","event_id":"sha256:920826d11f8e2e6e79ea9ebf95e65aa67d83f8a5f9258fa5ab5eebd330e4499e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NLEWNDITSWZTT2V4L5C347RLJT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdIV672jhcnzO+6x8mgSFBald4e37fJXLCuii6/dCENhDXPHvMgVPa6YrUaCf59XQ5n7KjJP8PLnXNTLpE/GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:59.969300Z"},"content_sha256":"3b7c13777039abac67036faa5b07e0b68a6a9177207d1149bc6f7c4ea6bf2ccb","schema_version":"1.0","event_id":"sha256:3b7c13777039abac67036faa5b07e0b68a6a9177207d1149bc6f7c4ea6bf2ccb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/bundle.json","state_url":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLEWNDITSWZTT2V4L5C347RLJT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T23:33:59Z","links":{"resolver":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT","bundle":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/bundle.json","state":"https://pith.science/pith/NLEWNDITSWZTT2V4L5C347RLJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLEWNDITSWZTT2V4L5C347RLJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NLEWNDITSWZTT2V4L5C347RLJT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"205d72174fc3b9f1c0d5ca897914fc4574444b30fe0d8b9c2f8bf2dfe27aabbe","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-01-31T09:34:29Z","title_canon_sha256":"6ce5e6df20356dbcf4b2235e888915cd0c9d37aeed790f9e05b411f8381f5bd9"},"schema_version":"1.0","source":{"id":"1401.8096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.8096","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1401.8096v2","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8096","created_at":"2026-05-18T02:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"NLEWNDITSWZT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLEWNDITSWZTT2V4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLEWNDIT","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:3b7c13777039abac67036faa5b07e0b68a6a9177207d1149bc6f7c4ea6bf2ccb","target":"graph","created_at":"2026-05-18T02:40:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Caterina De Bacco, Chi Ho Yeung, David Saad, Silvio Franz","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-01-31T09:34:29Z","title":"Shortest node-disjoint paths on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8096","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:920826d11f8e2e6e79ea9ebf95e65aa67d83f8a5f9258fa5ab5eebd330e4499e","target":"record","created_at":"2026-05-18T02:40:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"205d72174fc3b9f1c0d5ca897914fc4574444b30fe0d8b9c2f8bf2dfe27aabbe","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2014-01-31T09:34:29Z","title_canon_sha256":"6ce5e6df20356dbcf4b2235e888915cd0c9d37aeed790f9e05b411f8381f5bd9"},"schema_version":"1.0","source":{"id":"1401.8096","kind":"arxiv","version":2}},"canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ac9668d1395b339eabc5f45be7e2b4ccff7b7c813d9d08fa1bd3e8030c95918","first_computed_at":"2026-05-18T02:40:02.025887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:02.025887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tUMOhhHoUKJMc1TQluJeZ6rlnxy9sW2O0Ri3GJY1zWOqoadXlbFTDOt9TN4E25umQ4h/GwppXCXrjzHg1qzPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:02.026370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.8096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:920826d11f8e2e6e79ea9ebf95e65aa67d83f8a5f9258fa5ab5eebd330e4499e","sha256:3b7c13777039abac67036faa5b07e0b68a6a9177207d1149bc6f7c4ea6bf2ccb"],"state_sha256":"1f74cf6539ebd9042815cf814401d40311de0f8edfa071610135edb5158aa74e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6eLCGnkBnakUs0R64SMad2uo4pDYtQ3cmgrjZrvRp9ebKacg9er6EvaqmnjL4gXGbItwMF9+wf2D5nJGMPCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:33:59.973973Z","bundle_sha256":"98816f405eee3b128fa92479bf96f91865b5dbe9fad46b3cb1a39ad454e3368d"}}