{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AZUASGLX6CCMXDKI7LL53XHEUG","short_pith_number":"pith:AZUASGLX","canonical_record":{"source":{"id":"1501.07423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-29T11:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"3492be6f411119d2c8b670ec9a888ca9463d3131e9e5d6544090f97ce2d2682a","abstract_canon_sha256":"d63c5b4dd46fe4528804d9786c09168b6bb7ee162b8aab05b9b7d0d4730b42af"},"schema_version":"1.0"},"canonical_sha256":"0668091977f084cb8d48fad7dddce4a19e3327080f145052428efa13765e9202","source":{"kind":"arxiv","id":"1501.07423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07423","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07423v1","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07423","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"AZUASGLX6CCM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZUASGLX6CCMXDKI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZUASGLX","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AZUASGLX6CCMXDKI7LL53XHEUG","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-29T11:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"3492be6f411119d2c8b670ec9a888ca9463d3131e9e5d6544090f97ce2d2682a","abstract_canon_sha256":"d63c5b4dd46fe4528804d9786c09168b6bb7ee162b8aab05b9b7d0d4730b42af"},"schema_version":"1.0"},"canonical_sha256":"0668091977f084cb8d48fad7dddce4a19e3327080f145052428efa13765e9202","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:21.961193Z","signature_b64":"rIYvN8nQS1fVD1jlajwpeIZeuoZCNPAzX+6po75CZIH/aPPvEjH/BoM3R4liz4n7j/6hzDkgWQO44vUxVRVzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0668091977f084cb8d48fad7dddce4a19e3327080f145052428efa13765e9202","last_reissued_at":"2026-05-18T02:28:21.960507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:21.960507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07423","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-05-18T02:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30LwM7Bsk9D19Tjzqy/zZ9TtvjFD0v2flzKbs9VarYTqUk3wXQrHPx0bD6HHntEEb37M48H7FHspDWyxfijhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:08:47.785109Z"},"content_sha256":"c07e2c7b99205a9ed4853913591ad690a1d153004f39a4067115c47362aaf8f1","schema_version":"1.0","event_id":"sha256:c07e2c7b99205a9ed4853913591ad690a1d153004f39a4067115c47362aaf8f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AZUASGLX6CCMXDKI7LL53XHEUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Flexible Coupling Approach to Multi-Agent Planning under Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alejandro Torre\\~no, Eva Onaindia, \\'Oscar Sapena","submitted_at":"2015-01-29T11:56:41Z","abstract_excerpt":"Multi-agent planning (MAP) approaches are typically oriented at solving loosely-coupled problems, being ineffective to deal with more complex, strongly-related problems. In most cases, agents work under complete information, building complete knowledge bases. The present article introduces a general-purpose MAP framework designed to tackle problems of any coupling levels under incomplete information. Agents in our MAP model are partially unaware of the information managed by the rest of agents and share only the critical information that affects other agents, thus maintaining a distributed vis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07423","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":""},"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-18T02:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eH8ltjsJI4tUof2xVnE0lakia7e9RDNUxHgfvcxpvU5Kr0GOPBAazWv4GB8mpqJ4u/dCaVaePghTHgsTS4jxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:08:47.785469Z"},"content_sha256":"68a4859644ee37b8348466f46ece3f2fe5c02c12b80deba2738d9e386e4501bb","schema_version":"1.0","event_id":"sha256:68a4859644ee37b8348466f46ece3f2fe5c02c12b80deba2738d9e386e4501bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZUASGLX6CCMXDKI7LL53XHEUG/bundle.json","state_url":"https://pith.science/pith/AZUASGLX6CCMXDKI7LL53XHEUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZUASGLX6CCMXDKI7LL53XHEUG/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-26T09:08:47Z","links":{"resolver":"https://pith.science/pith/AZUASGLX6CCMXDKI7LL53XHEUG","bundle":"https://pith.science/pith/AZUASGLX6CCMXDKI7LL53XHEUG/bundle.json","state":"https://pith.science/pith/AZUASGLX6CCMXDKI7LL53XHEUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZUASGLX6CCMXDKI7LL53XHEUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AZUASGLX6CCMXDKI7LL53XHEUG","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":"d63c5b4dd46fe4528804d9786c09168b6bb7ee162b8aab05b9b7d0d4730b42af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-29T11:56:41Z","title_canon_sha256":"3492be6f411119d2c8b670ec9a888ca9463d3131e9e5d6544090f97ce2d2682a"},"schema_version":"1.0","source":{"id":"1501.07423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07423","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07423v1","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07423","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"AZUASGLX6CCM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AZUASGLX6CCMXDKI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AZUASGLX","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:68a4859644ee37b8348466f46ece3f2fe5c02c12b80deba2738d9e386e4501bb","target":"graph","created_at":"2026-05-18T02:28:21Z","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":"Multi-agent planning (MAP) approaches are typically oriented at solving loosely-coupled problems, being ineffective to deal with more complex, strongly-related problems. In most cases, agents work under complete information, building complete knowledge bases. The present article introduces a general-purpose MAP framework designed to tackle problems of any coupling levels under incomplete information. Agents in our MAP model are partially unaware of the information managed by the rest of agents and share only the critical information that affects other agents, thus maintaining a distributed vis","authors_text":"Alejandro Torre\\~no, Eva Onaindia, \\'Oscar Sapena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-29T11:56:41Z","title":"A Flexible Coupling Approach to Multi-Agent Planning under Incomplete Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07423","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:c07e2c7b99205a9ed4853913591ad690a1d153004f39a4067115c47362aaf8f1","target":"record","created_at":"2026-05-18T02:28:21Z","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":"d63c5b4dd46fe4528804d9786c09168b6bb7ee162b8aab05b9b7d0d4730b42af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-29T11:56:41Z","title_canon_sha256":"3492be6f411119d2c8b670ec9a888ca9463d3131e9e5d6544090f97ce2d2682a"},"schema_version":"1.0","source":{"id":"1501.07423","kind":"arxiv","version":1}},"canonical_sha256":"0668091977f084cb8d48fad7dddce4a19e3327080f145052428efa13765e9202","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0668091977f084cb8d48fad7dddce4a19e3327080f145052428efa13765e9202","first_computed_at":"2026-05-18T02:28:21.960507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:21.960507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rIYvN8nQS1fVD1jlajwpeIZeuoZCNPAzX+6po75CZIH/aPPvEjH/BoM3R4liz4n7j/6hzDkgWQO44vUxVRVzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:21.961193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c07e2c7b99205a9ed4853913591ad690a1d153004f39a4067115c47362aaf8f1","sha256:68a4859644ee37b8348466f46ece3f2fe5c02c12b80deba2738d9e386e4501bb"],"state_sha256":"38526f13fff91da03ea2dbe68e8e4e278e8684ab25d5e9c994aa2dae9fb06462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpTzuL59gNH5AjNIxiqyQAp9P4PtjS17q34eSxgME/FUIFCOfxrTXAbRdqS/faLySRMuUl9/nrChkDJEjPnFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:08:47.787487Z","bundle_sha256":"c9b1ce3d2a4a80777a737de700d87ea97e2340c8f748ad028ac37f3c91519bb5"}}