{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SCUEI4SMIXHIQ4QMBKBVB4Q4YA","short_pith_number":"pith:SCUEI4SM","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"},"canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","source":{"kind":"arxiv","id":"1902.08905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08905","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08905v2","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08905","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"SCUEI4SMIXHI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCUEI4SMIXHIQ4QM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCUEI4SM","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SCUEI4SMIXHIQ4QMBKBVB4Q4YA","target":"record","payload":{"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"},"canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","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"},"source_kind":"arxiv","source_id":"1902.08905","source_version":2,"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-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykp/Sd1Kw3oZ00c7erBbxxXPmyXI7UUpBy1dbioXAtw154CqKbnTjtrqB3vgRMfC+Zwo+fHLRfo71ujXRfvkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:18:56.372411Z"},"content_sha256":"ca9cd3032d3af60d604d015ad762d05cdd87ec3fe5c67996889944e7fecc8a3f","schema_version":"1.0","event_id":"sha256:ca9cd3032d3af60d604d015ad762d05cdd87ec3fe5c67996889944e7fecc8a3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SCUEI4SMIXHIQ4QMBKBVB4Q4YA","target":"graph","payload":{"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"},"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-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QzZu/pIAImV5rtys1EWyn1lLadlN9FvLwVpdNsV3OpSqEfMOaUYM9QDuI4/Nnk40NPkmT0faYFeJ5ceQzvzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:18:56.372943Z"},"content_sha256":"ec49cb4139dd979ee38a890ae09576c91343e88875e733bd77ae06c338d14ace","schema_version":"1.0","event_id":"sha256:ec49cb4139dd979ee38a890ae09576c91343e88875e733bd77ae06c338d14ace"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/bundle.json","state_url":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/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-01T06:18:56Z","links":{"resolver":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA","bundle":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/bundle.json","state":"https://pith.science/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCUEI4SMIXHIQ4QMBKBVB4Q4YA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SCUEI4SMIXHIQ4QMBKBVB4Q4YA","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":"dae445646d4298f54c558b1a2b25a5dfc4a9b352dc9e960372546dad1f889cff","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-24T07:38:22Z","title_canon_sha256":"dc3d37a48d2107aae82ed7c632fed9599ff2ac4803a5040aa117e6df031f53a0"},"schema_version":"1.0","source":{"id":"1902.08905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08905","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08905v2","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08905","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"SCUEI4SMIXHI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCUEI4SMIXHIQ4QM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCUEI4SM","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ec49cb4139dd979ee38a890ae09576c91343e88875e733bd77ae06c338d14ace","target":"graph","created_at":"2026-05-17T23:42:13Z","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":"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","authors_text":"Ashis G. Banerjee, John Stewart, Nikolay Bykov, Samuel Pedigo, Santosh Devasia, Veniamin Tereshchuk","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-24T07:38:22Z","title":"An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08905","kind":"arxiv","version":2},"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:ca9cd3032d3af60d604d015ad762d05cdd87ec3fe5c67996889944e7fecc8a3f","target":"record","created_at":"2026-05-17T23:42:13Z","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":"dae445646d4298f54c558b1a2b25a5dfc4a9b352dc9e960372546dad1f889cff","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-24T07:38:22Z","title_canon_sha256":"dc3d37a48d2107aae82ed7c632fed9599ff2ac4803a5040aa117e6df031f53a0"},"schema_version":"1.0","source":{"id":"1902.08905","kind":"arxiv","version":2}},"canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90a844724c45ce88720c0a8350f21cc0382ea77ad6adc8b8010d01161f926e00","first_computed_at":"2026-05-17T23:42:13.683041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:13.683041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hxzGJ1hUBcs1DnUKQVUhfWjwqmup301qAvlZIiDmurSic8UX0HOFp03SFTmjDRNx4Pp3VRs2CmPaEJy68vEvBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:13.683793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca9cd3032d3af60d604d015ad762d05cdd87ec3fe5c67996889944e7fecc8a3f","sha256:ec49cb4139dd979ee38a890ae09576c91343e88875e733bd77ae06c338d14ace"],"state_sha256":"3c6eec4eaa7309e89fbe252e4289aa52c6347803ec2a93a0e2dbd0a207d81d42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOwa2OPg7V/rDfwD6QEuPZ9CbcHAdsJxgN5vxNUV8iJCYxZEswl1BUmSvEYeHz6QFTaCjMyaJlV1rspl2ayIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:18:56.376213Z","bundle_sha256":"d2dd78001b915f2680e789372d89ef8d372cd9cd1ec409a7dd96f67068634286"}}