{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AL422BRU6P54WHMF54JXVDE2HD","short_pith_number":"pith:AL422BRU","schema_version":"1.0","canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","source":{"kind":"arxiv","id":"1706.09949","version":1},"attestation_state":"computed","paper":{"title":"Efficient, High-Quality Stack Rearrangement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jingjin Yu, Kostas E. Bekris, Nicholas M. Stiffler, Shuai D. Han","submitted_at":"2017-06-29T20:49:56Z","abstract_excerpt":"This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a particular stack, and a setting in which each robot has a distinct position within a stack. In both cases, the goal is to minimize the number of stack removals that need to be performed. Stack rearrangement is shown to be intimately connected to pebble motion problems, a useful abstraction in multi-robot path planning. Through this connection, feasibility of stack re"},"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":"1706.09949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-29T20:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"f191ba7a967ffc2574f52a15068e4a215291f16d86c7c568468fa576b15846fb","abstract_canon_sha256":"0b4434556e4d6828d2ef5edcb68e9031024f32f81f8704d6cf8186b9979bfc7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:11.879784Z","signature_b64":"f8nKu0dvJt+c1j5iDKB23ZXhpNl4csjEKZD5/rcU+VQLHxGhaumaLF7i8J25tcnoxv2kp+19h39GYcF3/6NCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","last_reissued_at":"2026-05-18T00:41:11.879303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:11.879303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient, High-Quality Stack Rearrangement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jingjin Yu, Kostas E. Bekris, Nicholas M. Stiffler, Shuai D. Han","submitted_at":"2017-06-29T20:49:56Z","abstract_excerpt":"This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a particular stack, and a setting in which each robot has a distinct position within a stack. In both cases, the goal is to minimize the number of stack removals that need to be performed. Stack rearrangement is shown to be intimately connected to pebble motion problems, a useful abstraction in multi-robot path planning. Through this connection, feasibility of stack re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09949","kind":"arxiv","version":1},"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":"1706.09949","created_at":"2026-05-18T00:41:11.879390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09949v1","created_at":"2026-05-18T00:41:11.879390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09949","created_at":"2026-05-18T00:41:11.879390+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL422BRU6P54","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL422BRU6P54WHMF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL422BRU","created_at":"2026-05-18T12:31:05.417338+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/AL422BRU6P54WHMF54JXVDE2HD","json":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD.json","graph_json":"https://pith.science/api/pith-number/AL422BRU6P54WHMF54JXVDE2HD/graph.json","events_json":"https://pith.science/api/pith-number/AL422BRU6P54WHMF54JXVDE2HD/events.json","paper":"https://pith.science/paper/AL422BRU"},"agent_actions":{"view_html":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD","download_json":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD.json","view_paper":"https://pith.science/paper/AL422BRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09949&json=true","fetch_graph":"https://pith.science/api/pith-number/AL422BRU6P54WHMF54JXVDE2HD/graph.json","fetch_events":"https://pith.science/api/pith-number/AL422BRU6P54WHMF54JXVDE2HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/action/storage_attestation","attest_author":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/action/author_attestation","sign_citation":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/action/citation_signature","submit_replication":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/action/replication_record"}},"created_at":"2026-05-18T00:41:11.879390+00:00","updated_at":"2026-05-18T00:41:11.879390+00:00"}