{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JU7FC32XUT5UMTRSKHXSDQNVND","short_pith_number":"pith:JU7FC32X","canonical_record":{"source":{"id":"2507.17054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T22:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"985d6e7fcce3d3ba2f085ae39f7b0ab2a772df3e97b4b8a5b6d75ca0ad7fcee5","abstract_canon_sha256":"4118cf9d9060551dd5b9af8a1cc426b34a70fed2977affb7a29ff78bb964015f"},"schema_version":"1.0"},"canonical_sha256":"4d3e516f57a4fb464e3251ef21c1b568c8c8bc6dd66239bcdcf35440ac3f659e","source":{"kind":"arxiv","id":"2507.17054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17054","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17054v1","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17054","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"JU7FC32XUT5U","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_16","alias_value":"JU7FC32XUT5UMTRS","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_8","alias_value":"JU7FC32X","created_at":"2026-07-05T11:42:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JU7FC32XUT5UMTRSKHXSDQNVND","target":"record","payload":{"canonical_record":{"source":{"id":"2507.17054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T22:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"985d6e7fcce3d3ba2f085ae39f7b0ab2a772df3e97b4b8a5b6d75ca0ad7fcee5","abstract_canon_sha256":"4118cf9d9060551dd5b9af8a1cc426b34a70fed2977affb7a29ff78bb964015f"},"schema_version":"1.0"},"canonical_sha256":"4d3e516f57a4fb464e3251ef21c1b568c8c8bc6dd66239bcdcf35440ac3f659e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:00.754650Z","signature_b64":"mPjKjMq4oI6awhna7XE8eiv1fwZQP7Trrr5gSy172HQZLPyos7pnaP7IuamUDzfdc4pyiTqSsHwUZTeG8/uOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d3e516f57a4fb464e3251ef21c1b568c8c8bc6dd66239bcdcf35440ac3f659e","last_reissued_at":"2026-07-05T11:42:00.754158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:00.754158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.17054","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-05T11:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8MS5QyYP4GOZp5DrMqhrVWTkJ885ouxHTF3ic9jcS9vZpPimZ7I7+5L+hSLKVW3y4c5g8KFCCXClzXqAQyQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:22:45.544995Z"},"content_sha256":"574ebf80be2542d633275de36d3e7b98525ec7c5b8abf5e2d2f562d2913fb830","schema_version":"1.0","event_id":"sha256:574ebf80be2542d633275de36d3e7b98525ec7c5b8abf5e2d2f562d2913fb830"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JU7FC32XUT5UMTRSKHXSDQNVND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiaoyang Li, Shao-Hung Chan, Sven Koenig, Thomy Phan","submitted_at":"2025-07-22T22:25:29Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths, one for each agent in a shared environment. Its objective is to minimize the sum of path costs (SOC), where the path cost of each agent is defined as the travel time from its start location to its target location. Explicit Estimation Conflict-Based Search (EECBS) is the leading algorithm for bounded-suboptimal MAPF, with the SOC of the solution being at most a user-specified factor $w$ away from optimal. EECBS maintains sets of paths and a lower bound $LB$ on the optimal SOC. Then, it iteratively selects a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17054","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/2507.17054/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-05T11:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhC6QUziSqm6xkaG/0leFeXxJPV/Y0EKI2VwvzVgyUO55q1yUNvbHgik8xQpISTDXc7E+E6/VEOTDK3HcJHYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:22:45.545492Z"},"content_sha256":"32a6a7e4c7184a5503c3ce1ac6397d10ff4f94740bf01f460cdd73c25070edd1","schema_version":"1.0","event_id":"sha256:32a6a7e4c7184a5503c3ce1ac6397d10ff4f94740bf01f460cdd73c25070edd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JU7FC32XUT5UMTRSKHXSDQNVND/bundle.json","state_url":"https://pith.science/pith/JU7FC32XUT5UMTRSKHXSDQNVND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JU7FC32XUT5UMTRSKHXSDQNVND/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-08-22T00:22:45Z","links":{"resolver":"https://pith.science/pith/JU7FC32XUT5UMTRSKHXSDQNVND","bundle":"https://pith.science/pith/JU7FC32XUT5UMTRSKHXSDQNVND/bundle.json","state":"https://pith.science/pith/JU7FC32XUT5UMTRSKHXSDQNVND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JU7FC32XUT5UMTRSKHXSDQNVND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JU7FC32XUT5UMTRSKHXSDQNVND","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":"4118cf9d9060551dd5b9af8a1cc426b34a70fed2977affb7a29ff78bb964015f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T22:25:29Z","title_canon_sha256":"985d6e7fcce3d3ba2f085ae39f7b0ab2a772df3e97b4b8a5b6d75ca0ad7fcee5"},"schema_version":"1.0","source":{"id":"2507.17054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17054","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17054v1","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17054","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"JU7FC32XUT5U","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_16","alias_value":"JU7FC32XUT5UMTRS","created_at":"2026-07-05T11:42:00Z"},{"alias_kind":"pith_short_8","alias_value":"JU7FC32X","created_at":"2026-07-05T11:42:00Z"}],"graph_snapshots":[{"event_id":"sha256:32a6a7e4c7184a5503c3ce1ac6397d10ff4f94740bf01f460cdd73c25070edd1","target":"graph","created_at":"2026-07-05T11:42:00Z","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/2507.17054/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths, one for each agent in a shared environment. Its objective is to minimize the sum of path costs (SOC), where the path cost of each agent is defined as the travel time from its start location to its target location. Explicit Estimation Conflict-Based Search (EECBS) is the leading algorithm for bounded-suboptimal MAPF, with the SOC of the solution being at most a user-specified factor $w$ away from optimal. EECBS maintains sets of paths and a lower bound $LB$ on the optimal SOC. Then, it iteratively selects a","authors_text":"Jiaoyang Li, Shao-Hung Chan, Sven Koenig, Thomy Phan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T22:25:29Z","title":"New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17054","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:574ebf80be2542d633275de36d3e7b98525ec7c5b8abf5e2d2f562d2913fb830","target":"record","created_at":"2026-07-05T11:42:00Z","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":"4118cf9d9060551dd5b9af8a1cc426b34a70fed2977affb7a29ff78bb964015f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T22:25:29Z","title_canon_sha256":"985d6e7fcce3d3ba2f085ae39f7b0ab2a772df3e97b4b8a5b6d75ca0ad7fcee5"},"schema_version":"1.0","source":{"id":"2507.17054","kind":"arxiv","version":1}},"canonical_sha256":"4d3e516f57a4fb464e3251ef21c1b568c8c8bc6dd66239bcdcf35440ac3f659e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d3e516f57a4fb464e3251ef21c1b568c8c8bc6dd66239bcdcf35440ac3f659e","first_computed_at":"2026-07-05T11:42:00.754158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:42:00.754158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mPjKjMq4oI6awhna7XE8eiv1fwZQP7Trrr5gSy172HQZLPyos7pnaP7IuamUDzfdc4pyiTqSsHwUZTeG8/uOAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:42:00.754650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.17054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:574ebf80be2542d633275de36d3e7b98525ec7c5b8abf5e2d2f562d2913fb830","sha256:32a6a7e4c7184a5503c3ce1ac6397d10ff4f94740bf01f460cdd73c25070edd1"],"state_sha256":"9ae41353dc131d5e7860adbdef5b6196e2930ee1c91298fc70cc7fd4043054c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua6IbmfMu1ASAxSebz7NI+dq5QYqY1slJrhHt2uJg3nKdBolXLOxUHyjWqehTrsXbVMNl4hmKy7GZFabSIZZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T00:22:45.550268Z","bundle_sha256":"d72b6f29162faffde489267c4cf7a3fe6f63c3b5ed525e6baea0f43cc3e9a3f3"}}