{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3AW7Y7IFRSX3OZPYH2IYVOZWUK","short_pith_number":"pith:3AW7Y7IF","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"},"canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","source":{"kind":"arxiv","id":"1503.00540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00540","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00540v1","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00540","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"3AW7Y7IFRSX3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3AW7Y7IFRSX3OZPY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3AW7Y7IF","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3AW7Y7IFRSX3OZPYH2IYVOZWUK","target":"record","payload":{"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"},"canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","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"},"source_kind":"arxiv","source_id":"1503.00540","source_version":1,"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-18T01:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbULYSeNXE97twt8a/HNghpNkH+4JJ2h6hxphSHCGxMAYMOMzXLN8hK2V5XtryzAFyLuN1omdoxixZdWRkETBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:58:27.079701Z"},"content_sha256":"f3483d1ef41547afba0d5acbe73ff4dca0ccf976ae02f9ff87cfb9d4a92548ad","schema_version":"1.0","event_id":"sha256:f3483d1ef41547afba0d5acbe73ff4dca0ccf976ae02f9ff87cfb9d4a92548ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3AW7Y7IFRSX3OZPYH2IYVOZWUK","target":"graph","payload":{"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"},"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-18T01:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mk2GrX0PgQ+2Rc1+MOqoD8SlrxggKjEMj8lKiHBRcklLafl3lSqYVU8XvPiMkhG+y/KpZc7xENUiFUhyb9dkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:58:27.080052Z"},"content_sha256":"e9c3b255e5d7bb8baca7393271afd41d01c246b8fdf2ba4ecdc61d8a3bf0ce08","schema_version":"1.0","event_id":"sha256:e9c3b255e5d7bb8baca7393271afd41d01c246b8fdf2ba4ecdc61d8a3bf0ce08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/bundle.json","state_url":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/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-01T00:58:27Z","links":{"resolver":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK","bundle":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/bundle.json","state":"https://pith.science/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AW7Y7IFRSX3OZPYH2IYVOZWUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3AW7Y7IFRSX3OZPYH2IYVOZWUK","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":"37da3ad3598c6e4fc8d8934137a34c5760adbd706c6199efba6fa74f4a2a8451","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-03-02T14:27:02Z","title_canon_sha256":"3e24b356b4ca08e9eac592aa101e19b4cccf4ebcb957df115682035f67eefe8b"},"schema_version":"1.0","source":{"id":"1503.00540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00540","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00540v1","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00540","created_at":"2026-05-18T01:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"3AW7Y7IFRSX3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3AW7Y7IFRSX3OZPY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3AW7Y7IF","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:e9c3b255e5d7bb8baca7393271afd41d01c246b8fdf2ba4ecdc61d8a3bf0ce08","target":"graph","created_at":"2026-05-18T01:22:18Z","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":"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 ","authors_text":"Alfredo Braunstein, Caterina De Bacco, Fabrizio Altarelli, Luca Dall'Asta, Silvio Franz","cross_cats":["cond-mat.stat-mech","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-03-02T14:27:02Z","title":"The edge-disjoint path problem on random graphs by message-passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00540","kind":"arxiv","version":1},"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:f3483d1ef41547afba0d5acbe73ff4dca0ccf976ae02f9ff87cfb9d4a92548ad","target":"record","created_at":"2026-05-18T01:22:18Z","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":"37da3ad3598c6e4fc8d8934137a34c5760adbd706c6199efba6fa74f4a2a8451","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-03-02T14:27:02Z","title_canon_sha256":"3e24b356b4ca08e9eac592aa101e19b4cccf4ebcb957df115682035f67eefe8b"},"schema_version":"1.0","source":{"id":"1503.00540","kind":"arxiv","version":1}},"canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d82dfc7d058cafb765f83e918abb36a2917138a8d59f43b004610d05442350a8","first_computed_at":"2026-05-18T01:22:18.870055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:18.870055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wCZ7uS0f0WIgkVNlRJoS69XmkeD/uCsT74X8lR1bh1OCpQgXL1i/opf3u4a8K/fUBdlT3M8uNWttlCNRXdheCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:18.870846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3483d1ef41547afba0d5acbe73ff4dca0ccf976ae02f9ff87cfb9d4a92548ad","sha256:e9c3b255e5d7bb8baca7393271afd41d01c246b8fdf2ba4ecdc61d8a3bf0ce08"],"state_sha256":"ffb97f53c56b7cafc20036b505e72c69d4b95ced613ec2a157bf3f2257581349"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdzOPkHIDll2sxzgmH8JhoP2YfFl34hu29aDvadHnxqrTW9bBlVLVKqZElYGwP+PTAgKOHDo5cRJ2UXd51XnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:58:27.082131Z","bundle_sha256":"2ec6e160a645c83cc5541617dfd5cd9d3ddc6040f1ad5799519569aff7846da1"}}