{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DPDTLWKQWLH4SIO5ETL4GFPN6W","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":"967d67c13ade56db832a6990102c91efc7e03718394bdc85a35c63ea0cd9708b","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-06-16T00:45:07Z","title_canon_sha256":"9282cc5d2c97615334cc3878c1da19d0074fbe2e9b4c3811af77b36fddaab901"},"schema_version":"1.0","source":{"id":"2006.08845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08845","created_at":"2026-07-05T01:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08845v1","created_at":"2026-07-05T01:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08845","created_at":"2026-07-05T01:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"DPDTLWKQWLH4","created_at":"2026-07-05T01:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"DPDTLWKQWLH4SIO5","created_at":"2026-07-05T01:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"DPDTLWKQ","created_at":"2026-07-05T01:10:43Z"}],"graph_snapshots":[{"event_id":"sha256:1b6581b1891f35e03de538c5122c60d4a36d612a8d71741d69bf5d2a20e37f4f","target":"graph","created_at":"2026-07-05T01:10:43Z","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/2006.08845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of sequential task assignment and collision-free routing for large teams of robots in applications with inter-task precedence constraints (e.g., task $A$ and task $B$ must both be completed before task $C$ may begin). Such problems commonly occur in assembly planning for robotic manufacturing applications, in which sub-assemblies must be completed before they can be combined to form the final product. We propose a hierarchical algorithm for computing makespan-optimal solutions to the problem. The algorithm is evaluated on a set of randomly generated problem instances where","authors_text":"Kyle Brown, Mac Schwager, Martin A. Sehr, Mykel J. Kochenderfer, Oriana Peltzer","cross_cats":["cs.AI","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-06-16T00:45:07Z","title":"Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08845","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:7c796f5c48973d6d63e4af4fd114caee43d04fb7f132f6c4eca7ecaf19b10fc1","target":"record","created_at":"2026-07-05T01:10:43Z","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":"967d67c13ade56db832a6990102c91efc7e03718394bdc85a35c63ea0cd9708b","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-06-16T00:45:07Z","title_canon_sha256":"9282cc5d2c97615334cc3878c1da19d0074fbe2e9b4c3811af77b36fddaab901"},"schema_version":"1.0","source":{"id":"2006.08845","kind":"arxiv","version":1}},"canonical_sha256":"1bc735d950b2cfc921dd24d7c315edf59ab4f615d2714c00e7a8e60322560696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc735d950b2cfc921dd24d7c315edf59ab4f615d2714c00e7a8e60322560696","first_computed_at":"2026-07-05T01:10:43.548881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:43.548881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Antyjt4q2gUGbCoCWwR38QOg1x/ohMZyE4vp9sP64L3oYRJL+b9QFEm9tDAoBoeyLUXPg4GDzRXqLbZVg6YTAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:43.549342Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c796f5c48973d6d63e4af4fd114caee43d04fb7f132f6c4eca7ecaf19b10fc1","sha256:1b6581b1891f35e03de538c5122c60d4a36d612a8d71741d69bf5d2a20e37f4f"],"state_sha256":"0f5a487d38ea4fcf7a143b63704ec05cd7541cc172d22064f597227ccbabfe0b"}