{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7EBYAI2FGN2J2RKUI3LYX4YPHG","short_pith_number":"pith:7EBYAI2F","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"},"canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","source":{"kind":"arxiv","id":"1906.06863","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06863","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06863v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06863","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"7EBYAI2FGN2J","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7EBYAI2FGN2J2RKU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7EBYAI2F","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7EBYAI2FGN2J2RKUI3LYX4YPHG","target":"record","payload":{"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"},"canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","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"},"source_kind":"arxiv","source_id":"1906.06863","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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GP7PFtWgfcX0k8YTbLI41AKURJ1jLntk184lcNrfywd97Z0evu6/hEzr6PAp/mbcAZb1TT8RF+UoFnv0O51CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:40:12.126867Z"},"content_sha256":"16d37146caaf9c200358b359b177ea7f9a91c780ec52596e97ba7d3fc9f0c585","schema_version":"1.0","event_id":"sha256:16d37146caaf9c200358b359b177ea7f9a91c780ec52596e97ba7d3fc9f0c585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7EBYAI2FGN2J2RKUI3LYX4YPHG","target":"graph","payload":{"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"},"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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neB32B8BmBojSyNPcTKlKxfZYpXakhay4719R0H0zucjyyS8HWTRM2yQQiYKJIrxejuXGCpcUN7UIMQlXCjmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:40:12.127356Z"},"content_sha256":"5304234b8177cf6e3a546e15d7781dbabb93c9643a78643048311b72bbb014dc","schema_version":"1.0","event_id":"sha256:5304234b8177cf6e3a546e15d7781dbabb93c9643a78643048311b72bbb014dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/bundle.json","state_url":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/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-05-31T12:40:12Z","links":{"resolver":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG","bundle":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/bundle.json","state":"https://pith.science/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EBYAI2FGN2J2RKUI3LYX4YPHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7EBYAI2FGN2J2RKUI3LYX4YPHG","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":"a80334163afeef45ae413125f291d0c120dfca3807a011401a3a0f6e7582d01a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-06-17T06:36:32Z","title_canon_sha256":"be0e4f0d3f5d004e6296e994948b32f6a57a0ab9c98eac3533fc46a775f5fe58"},"schema_version":"1.0","source":{"id":"1906.06863","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06863","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06863v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06863","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"7EBYAI2FGN2J","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7EBYAI2FGN2J2RKU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7EBYAI2F","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5304234b8177cf6e3a546e15d7781dbabb93c9643a78643048311b72bbb014dc","target":"graph","created_at":"2026-05-17T23:43:08Z","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":"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","authors_text":"Dingding Chen, Xingqiong Jiang, Yanchen Deng, Zhongshi He, Ziyu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-06-17T06:36:32Z","title":"A Generic Approach for Accelerating Belief Propagation based DCOP Algorithms via A Branch-and-Bound Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06863","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:16d37146caaf9c200358b359b177ea7f9a91c780ec52596e97ba7d3fc9f0c585","target":"record","created_at":"2026-05-17T23:43:08Z","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":"a80334163afeef45ae413125f291d0c120dfca3807a011401a3a0f6e7582d01a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-06-17T06:36:32Z","title_canon_sha256":"be0e4f0d3f5d004e6296e994948b32f6a57a0ab9c98eac3533fc46a775f5fe58"},"schema_version":"1.0","source":{"id":"1906.06863","kind":"arxiv","version":2}},"canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f90380234533749d455446d78bf30f3999db62593da5f9e59e28bd1a49e45e3c","first_computed_at":"2026-05-17T23:43:08.681888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.681888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkm3euOpURQE/OyNMuvgSXfci/tkHuHMf2sLYKXKAnSbhpzo1eYuAEpUQc0fxke60JmM/3ixnZIyqiam4BV+Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.682349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06863","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16d37146caaf9c200358b359b177ea7f9a91c780ec52596e97ba7d3fc9f0c585","sha256:5304234b8177cf6e3a546e15d7781dbabb93c9643a78643048311b72bbb014dc"],"state_sha256":"504e890ab4d906817908b9561d11a105bf6916a66bd77b60006d63d0e62ba855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjN2i2Qp+zMXZbAtPp4Jhd33o7oTEiDLWw6AB/9AI5NR1laswBmpcvthdcIw00UnuA6biA9Gzyv3aYuP+vl7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:40:12.129759Z","bundle_sha256":"df30c49efe2a3da0b2b6f75d0ca05b6a65c167c56716168505cb4045f1c88b78"}}