{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SCUEI4SMIXHIQ4QMBKBVB4Q4YA","short_pith_number":"pith:SCUEI4SM","schema_version":"1.0","canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","source":{"kind":"arxiv","id":"1902.08905","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Ashis G. Banerjee, John Stewart, Nikolay Bykov, Samuel Pedigo, Santosh Devasia, Veniamin Tereshchuk","submitted_at":"2019-02-24T07:38:22Z","abstract_excerpt":"Efficient utilization of cooperating robots in the assembly of aircraft structures relies on balancing the workload of the robots and ensuring collision-free scheduling. We cast this problem as that of allocating a large number of repetitive assembly tasks, such as drilling holes and installing fasteners, among multiple robots. Such task allocation is often formulated as a Traveling Salesman Problem (TSP), which is NP-hard, implying that computing an exactly optimal solution is computationally prohibitive for real-world applications. The problem complexity is further exacerbated by intermitten"},"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":"1902.08905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-24T07:38:22Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"dc3d37a48d2107aae82ed7c632fed9599ff2ac4803a5040aa117e6df031f53a0","abstract_canon_sha256":"dae445646d4298f54c558b1a2b25a5dfc4a9b352dc9e960372546dad1f889cff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:13.683793Z","signature_b64":"hxzGJ1hUBcs1DnUKQVUhfWjwqmup301qAvlZIiDmurSic8UX0HOFp03SFTmjDRNx4Pp3VRs2CmPaEJy68vEvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","last_reissued_at":"2026-05-17T23:42:13.683041Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:13.683041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Ashis G. Banerjee, John Stewart, Nikolay Bykov, Samuel Pedigo, Santosh Devasia, Veniamin Tereshchuk","submitted_at":"2019-02-24T07:38:22Z","abstract_excerpt":"Efficient utilization of cooperating robots in the assembly of aircraft structures relies on balancing the workload of the robots and ensuring collision-free scheduling. We cast this problem as that of allocating a large number of repetitive assembly tasks, such as drilling holes and installing fasteners, among multiple robots. Such task allocation is often formulated as a Traveling Salesman Problem (TSP), which is NP-hard, implying that computing an exactly optimal solution is computationally prohibitive for real-world applications. The problem complexity is further exacerbated by intermitten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08905","kind":"arxiv","version":2},"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":"1902.08905","created_at":"2026-05-17T23:42:13.683156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08905v2","created_at":"2026-05-17T23:42:13.683156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08905","created_at":"2026-05-17T23:42:13.683156+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCUEI4SMIXHI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCUEI4SMIXHIQ4QM","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCUEI4SM","created_at":"2026-05-18T12:33:27.125529+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/SCUEI4SMIXHIQ4QMBKBVB4Q4YA","json":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA.json","graph_json":"https://pith.science/api/pith-number/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/graph.json","events_json":"https://pith.science/api/pith-number/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/events.json","paper":"https://pith.science/paper/SCUEI4SM"},"agent_actions":{"view_html":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA","download_json":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA.json","view_paper":"https://pith.science/paper/SCUEI4SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08905&json=true","fetch_graph":"https://pith.science/api/pith-number/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/graph.json","fetch_events":"https://pith.science/api/pith-number/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/action/storage_attestation","attest_author":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/action/author_attestation","sign_citation":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/action/citation_signature","submit_replication":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/action/replication_record"}},"created_at":"2026-05-17T23:42:13.683156+00:00","updated_at":"2026-05-17T23:42:13.683156+00:00"}