{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YPCNU42PYGCBCHPPRHOFP32UGC","short_pith_number":"pith:YPCNU42P","schema_version":"1.0","canonical_sha256":"c3c4da734fc184111def89dc57ef5430bf22108b21ea3f01a380823659460caf","source":{"kind":"arxiv","id":"2502.09299","version":2},"attestation_state":"computed","paper":{"title":"Efficient Reconfiguration of Tile Arrangements by a Single Active Robot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.RO"],"primary_cat":"cs.CG","authors_text":"Aaron T. Becker, Arne Schmidt, Christian Rieck, Christian Scheffer, Harm Kube, Jonas Friemel, Peter Kramer, Ramin Kosfeld, S\\'andor P. Fekete","submitted_at":"2025-02-13T13:13:44Z","abstract_excerpt":"We consider the problem of reconfiguring a two-dimensional connected grid arrangement of passive building blocks from a start configuration to a goal configuration, using a single active robot that can move on the tiles, remove individual tiles from a given location and physically move them to a new position by walking on the remaining configuration. The objective is to determine a schedule that minimizes the overall makespan, while keeping the tile configuration connected.\n  We provide both negative and positive results. (1) We generalize the problem by introducing weighted movement costs, wh"},"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":"2502.09299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-02-13T13:13:44Z","cross_cats_sorted":["cs.DS","cs.RO"],"title_canon_sha256":"583418c8f60e7d95ab90453391a0542edea9120f40850928290bbe3a0f9c670c","abstract_canon_sha256":"e56447ea3df55bbe9890a606a8ecd3d8e72902a1a885c9036d355637ff91e394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:14.216490Z","signature_b64":"RlN0uA89bSKvUHbLbZqfccXLraSJ3tnX9Zv5asnnI8huBgqhbxh5MQBrHvNhfmH6ySnvRetQUsaiOjO3mbGDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c4da734fc184111def89dc57ef5430bf22108b21ea3f01a380823659460caf","last_reissued_at":"2026-07-05T11:28:14.215996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:14.215996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Reconfiguration of Tile Arrangements by a Single Active Robot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.RO"],"primary_cat":"cs.CG","authors_text":"Aaron T. Becker, Arne Schmidt, Christian Rieck, Christian Scheffer, Harm Kube, Jonas Friemel, Peter Kramer, Ramin Kosfeld, S\\'andor P. Fekete","submitted_at":"2025-02-13T13:13:44Z","abstract_excerpt":"We consider the problem of reconfiguring a two-dimensional connected grid arrangement of passive building blocks from a start configuration to a goal configuration, using a single active robot that can move on the tiles, remove individual tiles from a given location and physically move them to a new position by walking on the remaining configuration. The objective is to determine a schedule that minimizes the overall makespan, while keeping the tile configuration connected.\n  We provide both negative and positive results. (1) We generalize the problem by introducing weighted movement costs, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09299","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/2502.09299/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":"2502.09299","created_at":"2026-07-05T11:28:14.216049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09299v2","created_at":"2026-07-05T11:28:14.216049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09299","created_at":"2026-07-05T11:28:14.216049+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPCNU42PYGCB","created_at":"2026-07-05T11:28:14.216049+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPCNU42PYGCBCHPP","created_at":"2026-07-05T11:28:14.216049+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPCNU42P","created_at":"2026-07-05T11:28:14.216049+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/YPCNU42PYGCBCHPPRHOFP32UGC","json":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC.json","graph_json":"https://pith.science/api/pith-number/YPCNU42PYGCBCHPPRHOFP32UGC/graph.json","events_json":"https://pith.science/api/pith-number/YPCNU42PYGCBCHPPRHOFP32UGC/events.json","paper":"https://pith.science/paper/YPCNU42P"},"agent_actions":{"view_html":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC","download_json":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC.json","view_paper":"https://pith.science/paper/YPCNU42P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09299&json=true","fetch_graph":"https://pith.science/api/pith-number/YPCNU42PYGCBCHPPRHOFP32UGC/graph.json","fetch_events":"https://pith.science/api/pith-number/YPCNU42PYGCBCHPPRHOFP32UGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC/action/storage_attestation","attest_author":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC/action/author_attestation","sign_citation":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC/action/citation_signature","submit_replication":"https://pith.science/pith/YPCNU42PYGCBCHPPRHOFP32UGC/action/replication_record"}},"created_at":"2026-07-05T11:28:14.216049+00:00","updated_at":"2026-07-05T11:28:14.216049+00:00"}