{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BK46FHBYB7XYYF7NWAGGQSLXFW","short_pith_number":"pith:BK46FHBY","canonical_record":{"source":{"id":"2212.03461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-07T05:03:04Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"5752008650b35dbee61f3b7eb6d9cf5ed53a0af030f18f62d80f5c3499fc16aa","abstract_canon_sha256":"4253825f6811335335754624fe596b00d15827271d9f8ce3760233356e9b1698"},"schema_version":"1.0"},"canonical_sha256":"0ab9e29c380fef8c17edb00c6849772db1917ae9149589e76668e50c5ec2d82a","source":{"kind":"arxiv","id":"2212.03461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03461","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03461v1","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03461","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"BK46FHBYB7XY","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_16","alias_value":"BK46FHBYB7XYYF7N","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_8","alias_value":"BK46FHBY","created_at":"2026-07-05T05:23:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BK46FHBYB7XYYF7NWAGGQSLXFW","target":"record","payload":{"canonical_record":{"source":{"id":"2212.03461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-07T05:03:04Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"5752008650b35dbee61f3b7eb6d9cf5ed53a0af030f18f62d80f5c3499fc16aa","abstract_canon_sha256":"4253825f6811335335754624fe596b00d15827271d9f8ce3760233356e9b1698"},"schema_version":"1.0"},"canonical_sha256":"0ab9e29c380fef8c17edb00c6849772db1917ae9149589e76668e50c5ec2d82a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:16.588145Z","signature_b64":"AblBmIHCoZcmljBp26Mow+KGHOyxGrTAvgoBWOIy3VMDb3BebJcrn8zPC24ihi5TwnLegJrG/FSelLfdQH2kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ab9e29c380fef8c17edb00c6849772db1917ae9149589e76668e50c5ec2d82a","last_reissued_at":"2026-07-05T05:23:16.587705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:16.587705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.03461","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-07-05T05:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rdskSoJdHvruA2y8NdPdE1G4QykQWk/6t39Qo6ZMp6qScrBTz//rsGoaypbIODkDk0XCpN2yRL7RUcL/he2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:08:54.529288Z"},"content_sha256":"243c8b8c6a443c896606bcb2075a2a5798c99108a179fbf9a36998a4f8e8beca","schema_version":"1.0","event_id":"sha256:243c8b8c6a443c896606bcb2075a2a5798c99108a179fbf9a36998a4f8e8beca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BK46FHBYB7XYYF7NWAGGQSLXFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Interaction Graph Construction for Dynamic DCOPs in Cooperative Multi-agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Brighter Agyemang, Fenghui Ren, Jun Yan","submitted_at":"2022-12-07T05:03:04Z","abstract_excerpt":"DCOP algorithms usually rely on interaction graphs to operate. In open and dynamic environments, such methods need to address how this interaction graph is generated and maintained among agents. Existing methods require reconstructing the entire graph upon detecting changes in the environment or assuming that new agents know potential neighbors to facilitate connection. We propose a novel distributed interaction graph construction algorithm to address this problem. The proposed method does not assume a predefined constraint graph and stabilizes after disruptive changes in the environment. We e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03461","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.03461/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awU0aD31VsRqPn/J+NffxeGFSseQ0klWR4jpvxp5R+4cDa4Rzwj59CPnYVCWIOFCLMESGEYjMj8iE9Ri7RaoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:08:54.529724Z"},"content_sha256":"45b8ffc1f9916216b919c436337a09f5151f0b0363da89c34ebf29d348830a36","schema_version":"1.0","event_id":"sha256:45b8ffc1f9916216b919c436337a09f5151f0b0363da89c34ebf29d348830a36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/bundle.json","state_url":"https://pith.science/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/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-07-07T05:08:54Z","links":{"resolver":"https://pith.science/pith/BK46FHBYB7XYYF7NWAGGQSLXFW","bundle":"https://pith.science/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/bundle.json","state":"https://pith.science/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BK46FHBYB7XYYF7NWAGGQSLXFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BK46FHBYB7XYYF7NWAGGQSLXFW","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":"4253825f6811335335754624fe596b00d15827271d9f8ce3760233356e9b1698","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-07T05:03:04Z","title_canon_sha256":"5752008650b35dbee61f3b7eb6d9cf5ed53a0af030f18f62d80f5c3499fc16aa"},"schema_version":"1.0","source":{"id":"2212.03461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03461","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03461v1","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03461","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"BK46FHBYB7XY","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_16","alias_value":"BK46FHBYB7XYYF7N","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_8","alias_value":"BK46FHBY","created_at":"2026-07-05T05:23:16Z"}],"graph_snapshots":[{"event_id":"sha256:45b8ffc1f9916216b919c436337a09f5151f0b0363da89c34ebf29d348830a36","target":"graph","created_at":"2026-07-05T05:23:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.03461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"DCOP algorithms usually rely on interaction graphs to operate. In open and dynamic environments, such methods need to address how this interaction graph is generated and maintained among agents. Existing methods require reconstructing the entire graph upon detecting changes in the environment or assuming that new agents know potential neighbors to facilitate connection. We propose a novel distributed interaction graph construction algorithm to address this problem. The proposed method does not assume a predefined constraint graph and stabilizes after disruptive changes in the environment. We e","authors_text":"Brighter Agyemang, Fenghui Ren, Jun Yan","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-07T05:03:04Z","title":"Distributed Interaction Graph Construction for Dynamic DCOPs in Cooperative Multi-agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03461","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:243c8b8c6a443c896606bcb2075a2a5798c99108a179fbf9a36998a4f8e8beca","target":"record","created_at":"2026-07-05T05:23:16Z","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":"4253825f6811335335754624fe596b00d15827271d9f8ce3760233356e9b1698","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-07T05:03:04Z","title_canon_sha256":"5752008650b35dbee61f3b7eb6d9cf5ed53a0af030f18f62d80f5c3499fc16aa"},"schema_version":"1.0","source":{"id":"2212.03461","kind":"arxiv","version":1}},"canonical_sha256":"0ab9e29c380fef8c17edb00c6849772db1917ae9149589e76668e50c5ec2d82a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ab9e29c380fef8c17edb00c6849772db1917ae9149589e76668e50c5ec2d82a","first_computed_at":"2026-07-05T05:23:16.587705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:16.587705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AblBmIHCoZcmljBp26Mow+KGHOyxGrTAvgoBWOIy3VMDb3BebJcrn8zPC24ihi5TwnLegJrG/FSelLfdQH2kDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:16.588145Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:243c8b8c6a443c896606bcb2075a2a5798c99108a179fbf9a36998a4f8e8beca","sha256:45b8ffc1f9916216b919c436337a09f5151f0b0363da89c34ebf29d348830a36"],"state_sha256":"3139217ca19b2fdb92eee891a3998e737a1849fbdeff41c60f3df05a5c35875f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Efi0iMFyU2icbmShKuz3V3/o5XXoXdfctYLrOeNQf2kkv8eYXUuXtI3OzmPIwbOuUKS1stWarUK7p3dr6eTrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:08:54.532209Z","bundle_sha256":"54a97e801d56d127241dddf8eb5405528a80cbbe610f5ef592f38291c58d7e7c"}}