{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AL422BRU6P54WHMF54JXVDE2HD","short_pith_number":"pith:AL422BRU","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"},"canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","source":{"kind":"arxiv","id":"1706.09949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09949","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09949v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09949","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"AL422BRU6P54","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AL422BRU6P54WHMF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AL422BRU","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AL422BRU6P54WHMF54JXVDE2HD","target":"record","payload":{"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"},"canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","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"},"source_kind":"arxiv","source_id":"1706.09949","source_version":1,"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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMVbM3IFlC+86eKsPUZz1Y/owktVfmA964HDYTxpxNznj0582PiJdoNiPji7J/czfpd5+zPnog0g1jbsEHXGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:29:14.385072Z"},"content_sha256":"12474b962486ae8c19ef60d1a4f2fcab99a525b4e1afa2132b17ee8c4b329245","schema_version":"1.0","event_id":"sha256:12474b962486ae8c19ef60d1a4f2fcab99a525b4e1afa2132b17ee8c4b329245"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AL422BRU6P54WHMF54JXVDE2HD","target":"graph","payload":{"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"},"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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9jBT4DdHWU4t09t4n5A90lW8Cfk6xYi8Dw+QmklS4tITpbuws1RhsGewYXgVCxrWhjTWFUFDv0My8UL/1MuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:29:14.385367Z"},"content_sha256":"2fec57859fb1f404a637aba3f4534cba8f9bf6b536d8ac72580b84b9d391114b","schema_version":"1.0","event_id":"sha256:2fec57859fb1f404a637aba3f4534cba8f9bf6b536d8ac72580b84b9d391114b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/bundle.json","state_url":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AL422BRU6P54WHMF54JXVDE2HD/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-08-23T08:29:14Z","links":{"resolver":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD","bundle":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/bundle.json","state":"https://pith.science/pith/AL422BRU6P54WHMF54JXVDE2HD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AL422BRU6P54WHMF54JXVDE2HD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AL422BRU6P54WHMF54JXVDE2HD","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":"0b4434556e4d6828d2ef5edcb68e9031024f32f81f8704d6cf8186b9979bfc7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-29T20:49:56Z","title_canon_sha256":"f191ba7a967ffc2574f52a15068e4a215291f16d86c7c568468fa576b15846fb"},"schema_version":"1.0","source":{"id":"1706.09949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09949","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09949v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09949","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"AL422BRU6P54","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AL422BRU6P54WHMF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AL422BRU","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:2fec57859fb1f404a637aba3f4534cba8f9bf6b536d8ac72580b84b9d391114b","target":"graph","created_at":"2026-05-18T00:41:11Z","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":"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","authors_text":"Jingjin Yu, Kostas E. Bekris, Nicholas M. Stiffler, Shuai D. Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-29T20:49:56Z","title":"Efficient, High-Quality Stack Rearrangement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09949","kind":"arxiv","version":1},"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:12474b962486ae8c19ef60d1a4f2fcab99a525b4e1afa2132b17ee8c4b329245","target":"record","created_at":"2026-05-18T00:41:11Z","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":"0b4434556e4d6828d2ef5edcb68e9031024f32f81f8704d6cf8186b9979bfc7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-29T20:49:56Z","title_canon_sha256":"f191ba7a967ffc2574f52a15068e4a215291f16d86c7c568468fa576b15846fb"},"schema_version":"1.0","source":{"id":"1706.09949","kind":"arxiv","version":1}},"canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f9ad0634f3fbcb1d85ef137a8c9a38c2439c1bf029d6675ee445ac77375f60","first_computed_at":"2026-05-18T00:41:11.879303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:11.879303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f8nKu0dvJt+c1j5iDKB23ZXhpNl4csjEKZD5/rcU+VQLHxGhaumaLF7i8J25tcnoxv2kp+19h39GYcF3/6NCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:11.879784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12474b962486ae8c19ef60d1a4f2fcab99a525b4e1afa2132b17ee8c4b329245","sha256:2fec57859fb1f404a637aba3f4534cba8f9bf6b536d8ac72580b84b9d391114b"],"state_sha256":"3425f09477a1522f365e3ffa7fd017aefd463b36433834ac7fb155619941aefb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7cjLOfYKpqnIV9TxfN58Rvr1PsQMdcTtm/sSS59PTFi888z1NzANp/sTbgChEZ0e3++ZtJFau/8UvBajDTUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T08:29:14.388103Z","bundle_sha256":"8805e4a704fe557af69774a3a59bc976afe031c1f8364f900691ecdf8f498aa7"}}