{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LSHJNYVKBD6C5QJZGQRQV6PQJI","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":"bc405624cc2d5cafb139aa44d441f2a04fcf6aebd99bfc32c6cbb71248969ca0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-04T19:40:54Z","title_canon_sha256":"25fb51dfae8c2e5f5f5133eb138c0aa76a6dad457667dea33c112cd9957c2b6b"},"schema_version":"1.0","source":{"id":"1212.0836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0836","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0836v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0836","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"LSHJNYVKBD6C","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LSHJNYVKBD6C5QJZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LSHJNYVK","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:a5d09fcef9d0e13a60cd54041de3f2e7aa440391609f4b4229baaa982669e349","target":"graph","created_at":"2026-05-18T03:39:15Z","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":"We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort $n$ elements to $0.561 \\log_2 n + O(1)$. This is the first significant improvement since the previous lower bound, $1/2 \\log_2 n + O(1)$, was established by Knuth in 1972.","authors_text":"Luke Schaeffer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-04T19:40:54Z","title":"An Improved Lower Bound for Stack Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0836","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:5f1371de271f90c200d72550b3a15c233a20a1c351d30870842d9af50497e89e","target":"record","created_at":"2026-05-18T03:39:15Z","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":"bc405624cc2d5cafb139aa44d441f2a04fcf6aebd99bfc32c6cbb71248969ca0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-04T19:40:54Z","title_canon_sha256":"25fb51dfae8c2e5f5f5133eb138c0aa76a6dad457667dea33c112cd9957c2b6b"},"schema_version":"1.0","source":{"id":"1212.0836","kind":"arxiv","version":1}},"canonical_sha256":"5c8e96e2aa08fc2ec13934230af9f04a146f31777be25c31930a3fb5603dfb81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c8e96e2aa08fc2ec13934230af9f04a146f31777be25c31930a3fb5603dfb81","first_computed_at":"2026-05-18T03:39:15.100308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:15.100308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gHNYuYP8v69qdp6SDuSF/IPN5tfee8ayFgCXZFD6Dbt/yJ82hK/rPR5VnFwYuFRDsVVmB+YGrGz46qR7PAmIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:15.100900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f1371de271f90c200d72550b3a15c233a20a1c351d30870842d9af50497e89e","sha256:a5d09fcef9d0e13a60cd54041de3f2e7aa440391609f4b4229baaa982669e349"],"state_sha256":"8d949e0ef3c0328e89b6e59fad0af296c2a6eb50e9168930cfede83879b8f08d"}