{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7EBYAI2FGN2J2RKUI3LYX4YPHG","short_pith_number":"pith:7EBYAI2F","schema_version":"1.0","canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","source":{"kind":"arxiv","id":"1906.06863","version":2},"attestation_state":"computed","paper":{"title":"A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Dingding Chen, Xingqiong Jiang, Yanchen Deng, Zhongshi He, Ziyu Chen","submitted_at":"2019-06-17T06:36:32Z","abstract_excerpt":"Belief propagation approaches, such as Max-Sum and its variants, are a kind of important methods to solve large-scale Distributed Constraint Optimization Problems (DCOPs). However, for problems with n-ary constraints, these algorithms face a huge challenge since their computational complexity scales exponentially with the number of variables a function holds. In this paper, we present a generic and easy-to-use method based on a branch-and-bound technique to solve the issue, called Function Decomposing and State Pruning (FDSP). We theoretically prove that FDSP can provide monotonically non-incr"},"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":"1906.06863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-06-17T06:36:32Z","cross_cats_sorted":[],"title_canon_sha256":"be0e4f0d3f5d004e6296e994948b32f6a57a0ab9c98eac3533fc46a775f5fe58","abstract_canon_sha256":"a80334163afeef45ae413125f291d0c120dfca3807a011401a3a0f6e7582d01a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.682349Z","signature_b64":"jkm3euOpURQE/OyNMuvgSXfci/tkHuHMf2sLYKXKAnSbhpzo1eYuAEpUQc0fxke60JmM/3ixnZIyqiam4BV+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","last_reissued_at":"2026-05-17T23:43:08.681888Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.681888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Dingding Chen, Xingqiong Jiang, Yanchen Deng, Zhongshi He, Ziyu Chen","submitted_at":"2019-06-17T06:36:32Z","abstract_excerpt":"Belief propagation approaches, such as Max-Sum and its variants, are a kind of important methods to solve large-scale Distributed Constraint Optimization Problems (DCOPs). However, for problems with n-ary constraints, these algorithms face a huge challenge since their computational complexity scales exponentially with the number of variables a function holds. In this paper, we present a generic and easy-to-use method based on a branch-and-bound technique to solve the issue, called Function Decomposing and State Pruning (FDSP). We theoretically prove that FDSP can provide monotonically non-incr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06863","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":"1906.06863","created_at":"2026-05-17T23:43:08.681964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06863v2","created_at":"2026-05-17T23:43:08.681964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06863","created_at":"2026-05-17T23:43:08.681964+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EBYAI2FGN2J","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EBYAI2FGN2J2RKU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EBYAI2F","created_at":"2026-05-18T12:33:12.712433+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/7EBYAI2FGN2J2RKUI3LYX4YPHG","json":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG.json","graph_json":"https://pith.science/api/pith-number/7EBYAI2FGN2J2RKUI3LYX4YPHG/graph.json","events_json":"https://pith.science/api/pith-number/7EBYAI2FGN2J2RKUI3LYX4YPHG/events.json","paper":"https://pith.science/paper/7EBYAI2F"},"agent_actions":{"view_html":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG","download_json":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG.json","view_paper":"https://pith.science/paper/7EBYAI2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06863&json=true","fetch_graph":"https://pith.science/api/pith-number/7EBYAI2FGN2J2RKUI3LYX4YPHG/graph.json","fetch_events":"https://pith.science/api/pith-number/7EBYAI2FGN2J2RKUI3LYX4YPHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/action/storage_attestation","attest_author":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/action/author_attestation","sign_citation":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/action/citation_signature","submit_replication":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/action/replication_record"}},"created_at":"2026-05-17T23:43:08.681964+00:00","updated_at":"2026-05-17T23:43:08.681964+00:00"}