{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OZO535HGOEAY6IE5N7J3OKGHPF","short_pith_number":"pith:OZO535HG","canonical_record":{"source":{"id":"1905.11828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"d7d486783f5cf21739eefe0ccf4ebbe5508d3e105b1d7d1455aa204b1ded7ae1","abstract_canon_sha256":"42f85303e8fbdfbe545c052da6de79a2444765e1a4296620ce8e0361204e6870"},"schema_version":"1.0"},"canonical_sha256":"765dddf4e671018f209d6fd3b728c77965e8381ec05cf9e5e91e31958bbf4fe2","source":{"kind":"arxiv","id":"1905.11828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11828","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11828v2","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11828","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"OZO535HGOEAY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OZO535HGOEAY6IE5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OZO535HG","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OZO535HGOEAY6IE5N7J3OKGHPF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"d7d486783f5cf21739eefe0ccf4ebbe5508d3e105b1d7d1455aa204b1ded7ae1","abstract_canon_sha256":"42f85303e8fbdfbe545c052da6de79a2444765e1a4296620ce8e0361204e6870"},"schema_version":"1.0"},"canonical_sha256":"765dddf4e671018f209d6fd3b728c77965e8381ec05cf9e5e91e31958bbf4fe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:18.425142Z","signature_b64":"qtpvdSyAuiNVuySqja4sFrMSrGph3xzWfkv81Bh4VfTPsZrbeUeTxrmsx4GGfQgyUDwauHKrg5yXBjRgKDRADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"765dddf4e671018f209d6fd3b728c77965e8381ec05cf9e5e91e31958bbf4fe2","last_reissued_at":"2026-05-17T23:44:18.424524Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:18.424524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11828","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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beDEiauvYF5Z9bn5Na6Eb2BBQF+9RvVWZazdNaDkKkNDmSkIbJfIBzwambiVoH0eBdrhsehex7/cmUyWl8u+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:15:22.844618Z"},"content_sha256":"1e7a3b367cdd794db8b7c74691421fb4076b964788e7219f02005e283ea218e6","schema_version":"1.0","event_id":"sha256:1e7a3b367cdd794db8b7c74691421fb4076b964788e7219f02005e283ea218e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OZO535HGOEAY6IE5N7J3OKGHPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Dingding Chen, Wenxin Zhang, Xingqiong Jiang, Yanchen Deng, Ziyu Chen","submitted_at":"2019-05-28T14:07:01Z","abstract_excerpt":"Asymmetric distributed constraint optimization problems (ADCOPs) are an emerging model for coordinating agents with personal preferences. However, the existing inference-based complete algorithms which use local eliminations cannot be applied to ADCOPs, as the parent agents are required to transfer their private functions to their children. Rather than disclosing private functions explicitly to facilitate local eliminations, we solve the problem by enforcing delayed eliminations and propose AsymDPOP, the first inference-based complete algorithm for ADCOPs. To solve the severe scalability probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11828","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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQThxl3O9ZO1xZKneW0fP7a5JF1BxWtQsxMSC4W8e1mN6Q8Zh3yHM72m1BEZDTq/L8u3lPm5sMu5Vc/0dXtiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:15:22.844954Z"},"content_sha256":"7de0b411e76c1df5eede3c0f4c6b5d99561cef5aff18b6211b2fa5791702c4f6","schema_version":"1.0","event_id":"sha256:7de0b411e76c1df5eede3c0f4c6b5d99561cef5aff18b6211b2fa5791702c4f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZO535HGOEAY6IE5N7J3OKGHPF/bundle.json","state_url":"https://pith.science/pith/OZO535HGOEAY6IE5N7J3OKGHPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZO535HGOEAY6IE5N7J3OKGHPF/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-03T22:15:22Z","links":{"resolver":"https://pith.science/pith/OZO535HGOEAY6IE5N7J3OKGHPF","bundle":"https://pith.science/pith/OZO535HGOEAY6IE5N7J3OKGHPF/bundle.json","state":"https://pith.science/pith/OZO535HGOEAY6IE5N7J3OKGHPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZO535HGOEAY6IE5N7J3OKGHPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OZO535HGOEAY6IE5N7J3OKGHPF","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":"42f85303e8fbdfbe545c052da6de79a2444765e1a4296620ce8e0361204e6870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:07:01Z","title_canon_sha256":"d7d486783f5cf21739eefe0ccf4ebbe5508d3e105b1d7d1455aa204b1ded7ae1"},"schema_version":"1.0","source":{"id":"1905.11828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11828","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11828v2","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11828","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"OZO535HGOEAY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OZO535HGOEAY6IE5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OZO535HG","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7de0b411e76c1df5eede3c0f4c6b5d99561cef5aff18b6211b2fa5791702c4f6","target":"graph","created_at":"2026-05-17T23:44: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":"Asymmetric distributed constraint optimization problems (ADCOPs) are an emerging model for coordinating agents with personal preferences. However, the existing inference-based complete algorithms which use local eliminations cannot be applied to ADCOPs, as the parent agents are required to transfer their private functions to their children. Rather than disclosing private functions explicitly to facilitate local eliminations, we solve the problem by enforcing delayed eliminations and propose AsymDPOP, the first inference-based complete algorithm for ADCOPs. To solve the severe scalability probl","authors_text":"Dingding Chen, Wenxin Zhang, Xingqiong Jiang, Yanchen Deng, Ziyu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:07:01Z","title":"AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11828","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:1e7a3b367cdd794db8b7c74691421fb4076b964788e7219f02005e283ea218e6","target":"record","created_at":"2026-05-17T23:44: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":"42f85303e8fbdfbe545c052da6de79a2444765e1a4296620ce8e0361204e6870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:07:01Z","title_canon_sha256":"d7d486783f5cf21739eefe0ccf4ebbe5508d3e105b1d7d1455aa204b1ded7ae1"},"schema_version":"1.0","source":{"id":"1905.11828","kind":"arxiv","version":2}},"canonical_sha256":"765dddf4e671018f209d6fd3b728c77965e8381ec05cf9e5e91e31958bbf4fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"765dddf4e671018f209d6fd3b728c77965e8381ec05cf9e5e91e31958bbf4fe2","first_computed_at":"2026-05-17T23:44:18.424524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:18.424524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtpvdSyAuiNVuySqja4sFrMSrGph3xzWfkv81Bh4VfTPsZrbeUeTxrmsx4GGfQgyUDwauHKrg5yXBjRgKDRADw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:18.425142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e7a3b367cdd794db8b7c74691421fb4076b964788e7219f02005e283ea218e6","sha256:7de0b411e76c1df5eede3c0f4c6b5d99561cef5aff18b6211b2fa5791702c4f6"],"state_sha256":"01dde1810d6ca83c605fd8cdb7a28286ff6ddb49128ac1a0af7f393a9611413c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HmqVyroP6h59M4PxnNIuv8mX0t3u5B9i+FcfKq2GKAheW0Nv4U3T2niEweFNy1fQ0xhC8ZrhJFcy6R2OXiiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:15:22.846842Z","bundle_sha256":"8c7444b38c34a2e6e551924d85f5068b3a61eaaa6ead0bfc27754b19d8ece1f2"}}