{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G5N7WNHBTTEIHDCVMVIMNBNYDL","short_pith_number":"pith:G5N7WNHB","schema_version":"1.0","canonical_sha256":"375bfb34e19cc8838c556550c685b81ae241b9b729746d66ab91a31216e61d6f","source":{"kind":"arxiv","id":"1810.08460","version":1},"attestation_state":"computed","paper":{"title":"Planification par fusions incr\\'ementales de graphes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Damien Pellier, lias. Belaidi","submitted_at":"2018-10-19T12:21:47Z","abstract_excerpt":"In this paper, we introduce a generic and fresh model for distributed planning called \"Distributed Planning Through Graph Merging\" ({\\sf DPGM}). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume that no agent can reach the global goal alone. Therefore the agents must cooperate, {\\it i.e.,} take in into account potential positive interactions between their activities to reach their common s"},"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":"1810.08460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-19T12:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1d9ddb6a497784ec07494580e2c34cc3525acf6017d09a19999c701f7cc7683","abstract_canon_sha256":"f478c94e7d88ec1c5eb2f2dfc2877390cb717413507ee753e096af33bade7cab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.009874Z","signature_b64":"PEVM5ASo/cmOZZp8WPsQnsqeEow51gLDakB/XxkTnjPSr12eZgZ0vX2M3ntX/g45BIpO+SpCrSbXghWgNpvGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"375bfb34e19cc8838c556550c685b81ae241b9b729746d66ab91a31216e61d6f","last_reissued_at":"2026-05-18T00:02:48.009453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.009453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planification par fusions incr\\'ementales de graphes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Damien Pellier, lias. Belaidi","submitted_at":"2018-10-19T12:21:47Z","abstract_excerpt":"In this paper, we introduce a generic and fresh model for distributed planning called \"Distributed Planning Through Graph Merging\" ({\\sf DPGM}). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume that no agent can reach the global goal alone. Therefore the agents must cooperate, {\\it i.e.,} take in into account potential positive interactions between their activities to reach their common s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08460","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.08460","created_at":"2026-05-18T00:02:48.009520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08460v1","created_at":"2026-05-18T00:02:48.009520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08460","created_at":"2026-05-18T00:02:48.009520+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5N7WNHBTTEI","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5N7WNHBTTEIHDCV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5N7WNHB","created_at":"2026-05-18T12:32:25.280505+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/G5N7WNHBTTEIHDCVMVIMNBNYDL","json":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL.json","graph_json":"https://pith.science/api/pith-number/G5N7WNHBTTEIHDCVMVIMNBNYDL/graph.json","events_json":"https://pith.science/api/pith-number/G5N7WNHBTTEIHDCVMVIMNBNYDL/events.json","paper":"https://pith.science/paper/G5N7WNHB"},"agent_actions":{"view_html":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL","download_json":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL.json","view_paper":"https://pith.science/paper/G5N7WNHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08460&json=true","fetch_graph":"https://pith.science/api/pith-number/G5N7WNHBTTEIHDCVMVIMNBNYDL/graph.json","fetch_events":"https://pith.science/api/pith-number/G5N7WNHBTTEIHDCVMVIMNBNYDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL/action/storage_attestation","attest_author":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL/action/author_attestation","sign_citation":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL/action/citation_signature","submit_replication":"https://pith.science/pith/G5N7WNHBTTEIHDCVMVIMNBNYDL/action/replication_record"}},"created_at":"2026-05-18T00:02:48.009520+00:00","updated_at":"2026-05-18T00:02:48.009520+00:00"}