{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FARATIT5G4CNRVEX5DFZQ6U7OM","short_pith_number":"pith:FARATIT5","schema_version":"1.0","canonical_sha256":"282209a27d3704d8d497e8cb987a9f73336b4a6467ed615a5f77997b3e861a57","source":{"kind":"arxiv","id":"2101.05700","version":2},"attestation_state":"computed","paper":{"title":"Spillover Algorithm: A Decentralized Coordination Approach for Multi-Robot Production Planning in Open Shared Factories","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.MA"],"primary_cat":"cs.RO","authors_text":"Alberto Fern\\'andez, Eva Onaindia, Marin Lujak","submitted_at":"2021-01-14T16:23:45Z","abstract_excerpt":"Open and shared manufacturing factories typically dispose of a limited number of robots that should be properly allocated to tasks in time and space for an effective and efficient system performance. In particular, we deal with the dynamic capacitated production planning problem with sequence independent setup costs where quantities of products to manufacture and location of robots need to be determined at consecutive periods within a given time horizon and products can be anticipated or backordered related to the demand period. We consider a decentralized multi-agent variant of this problem i"},"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":"2101.05700","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-01-14T16:23:45Z","cross_cats_sorted":["cs.AI","cs.DM","cs.MA"],"title_canon_sha256":"64d1528f687d0253dd42088b019e27e5937f02bcb72118bb682de8e03c79f8c2","abstract_canon_sha256":"f1ae456d2f9d908dd471608905f1f48676fdfc3b964c9a095004258020361937"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:16.363467Z","signature_b64":"CQlie9aE5LDsDNP0j88SJnBLE2f49vcB8atHJ1f9oEjjv5U60noXaq+mpGkQKMVW3szEf7eFF7JHVa1aQTZuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"282209a27d3704d8d497e8cb987a9f73336b4a6467ed615a5f77997b3e861a57","last_reissued_at":"2026-07-05T02:09:16.362982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:16.362982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spillover Algorithm: A Decentralized Coordination Approach for Multi-Robot Production Planning in Open Shared Factories","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DM","cs.MA"],"primary_cat":"cs.RO","authors_text":"Alberto Fern\\'andez, Eva Onaindia, Marin Lujak","submitted_at":"2021-01-14T16:23:45Z","abstract_excerpt":"Open and shared manufacturing factories typically dispose of a limited number of robots that should be properly allocated to tasks in time and space for an effective and efficient system performance. In particular, we deal with the dynamic capacitated production planning problem with sequence independent setup costs where quantities of products to manufacture and location of robots need to be determined at consecutive periods within a given time horizon and products can be anticipated or backordered related to the demand period. We consider a decentralized multi-agent variant of this problem i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05700","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.05700/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2101.05700","created_at":"2026-07-05T02:09:16.363039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05700v2","created_at":"2026-07-05T02:09:16.363039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05700","created_at":"2026-07-05T02:09:16.363039+00:00"},{"alias_kind":"pith_short_12","alias_value":"FARATIT5G4CN","created_at":"2026-07-05T02:09:16.363039+00:00"},{"alias_kind":"pith_short_16","alias_value":"FARATIT5G4CNRVEX","created_at":"2026-07-05T02:09:16.363039+00:00"},{"alias_kind":"pith_short_8","alias_value":"FARATIT5","created_at":"2026-07-05T02:09:16.363039+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/FARATIT5G4CNRVEX5DFZQ6U7OM","json":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM.json","graph_json":"https://pith.science/api/pith-number/FARATIT5G4CNRVEX5DFZQ6U7OM/graph.json","events_json":"https://pith.science/api/pith-number/FARATIT5G4CNRVEX5DFZQ6U7OM/events.json","paper":"https://pith.science/paper/FARATIT5"},"agent_actions":{"view_html":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM","download_json":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM.json","view_paper":"https://pith.science/paper/FARATIT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05700&json=true","fetch_graph":"https://pith.science/api/pith-number/FARATIT5G4CNRVEX5DFZQ6U7OM/graph.json","fetch_events":"https://pith.science/api/pith-number/FARATIT5G4CNRVEX5DFZQ6U7OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM/action/storage_attestation","attest_author":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM/action/author_attestation","sign_citation":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM/action/citation_signature","submit_replication":"https://pith.science/pith/FARATIT5G4CNRVEX5DFZQ6U7OM/action/replication_record"}},"created_at":"2026-07-05T02:09:16.363039+00:00","updated_at":"2026-07-05T02:09:16.363039+00:00"}