{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QUMXRFE6ILC2PWZIVAWRKVGSQH","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":"5e5781f4d8c1540223e740f14a3a384eea3c62d0614b7d4afc46858775975572","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T16:48:47Z","title_canon_sha256":"35ced3468ce9438826255fce2effe97d81eeb89b0ebadd1b9a3d87a399f39f84"},"schema_version":"1.0","source":{"id":"1712.07041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07041","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07041v3","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07041","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"QUMXRFE6ILC2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUMXRFE6ILC2PWZI","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUMXRFE6","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:bb6880c10fb9515a3deadb881a250c780359fe64a4563e9feac893bcc3d711a1","target":"graph","created_at":"2026-05-17T23:57:03Z","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":"The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the max-sum algorithm. In particular, recent developments to solve the edge-disjoint paths problem and the prize-collecting Steiner tree problem on graphs have shown remarkable results for several classes of graphs and for benchmark instances. Here we propose a generalization of these techniques for two variants of the Steiner trees packing problem where multiple \"interacting\" trees have to be sought within a given graph. Depen","authors_text":"Alfredo Braunstein, Anna Paola Muntoni","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T16:48:47Z","title":"The cavity approach for Steiner trees packing problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07041","kind":"arxiv","version":3},"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:a31e4e1094d4456757834a7cee916b3a03096c65fb44920bcba67d2ae21d908a","target":"record","created_at":"2026-05-17T23:57:03Z","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":"5e5781f4d8c1540223e740f14a3a384eea3c62d0614b7d4afc46858775975572","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T16:48:47Z","title_canon_sha256":"35ced3468ce9438826255fce2effe97d81eeb89b0ebadd1b9a3d87a399f39f84"},"schema_version":"1.0","source":{"id":"1712.07041","kind":"arxiv","version":3}},"canonical_sha256":"851978949e42c5a7db28a82d1554d281df1a5a4d672079a9cb8fafac31d3be49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"851978949e42c5a7db28a82d1554d281df1a5a4d672079a9cb8fafac31d3be49","first_computed_at":"2026-05-17T23:57:03.145120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:03.145120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DpSmOPnuF1AIXry1jtmPQimDmCxBs9zCV9gvMx1q2RNBvUfKQQeq07BjBWG/Tx8bbdIyZloDP5btpgQy2S2ZBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:03.145792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a31e4e1094d4456757834a7cee916b3a03096c65fb44920bcba67d2ae21d908a","sha256:bb6880c10fb9515a3deadb881a250c780359fe64a4563e9feac893bcc3d711a1"],"state_sha256":"12a77c4143018a3cf7a64c6168190a72cd86c392869e6ed8c0788ab48253cf73"}