{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YTGXP7QOG4OTO5UXAIGFXRGTQ2","short_pith_number":"pith:YTGXP7QO","schema_version":"1.0","canonical_sha256":"c4cd77fe0e371d377697020c5bc4d3868e009fbff7550f2519fadb10217f718e","source":{"kind":"arxiv","id":"2601.09447","version":2},"attestation_state":"computed","paper":{"title":"Exact number of flips required to sort a burnt stack of pancakes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gerold J\\\"ager, Nacim Oijid","submitted_at":"2026-01-14T12:49:26Z","abstract_excerpt":"In this work, we consider the burnt pancake problem, which is a well-studied problem going back to a work of Gates and Papadimitriou from 1979.The problem is to sort a stack of~$n$ one-sided burnt pancakes of different sizes, by a sequence of flips of the top pancakes, such that at the end of the flipping sequence the pancakes have increasing size and the burnt sides of all pancakes are face-down. The pancakes are denoted by $ 1,2,\\dots,n$, and a number is multiplied by $-1$, if the corresponding pancake has burnt side face-up.\n  Let $T(n)$ be the minimum number of flips to sort a special stac"},"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":"2601.09447","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-14T12:49:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be23c34f3a0c2e051dfc5541cda4df0bae96c6bfb4e7171696f8a1f1b6bdca37","abstract_canon_sha256":"4bd42dda51d7a430ec0da302243d333450f60f8637fadad2a323fc2125f2c9f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:35.286262Z","signature_b64":"WDWJuB2+2dE7yQr/BnhAUE/VYCu8I/uw1U8GHZ3nyODpht7v1khsN6jrsUSPCYNmWZXEW8qBIvFKhB4PBQLODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cd77fe0e371d377697020c5bc4d3868e009fbff7550f2519fadb10217f718e","last_reissued_at":"2026-05-28T01:04:35.285821Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:35.285821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact number of flips required to sort a burnt stack of pancakes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gerold J\\\"ager, Nacim Oijid","submitted_at":"2026-01-14T12:49:26Z","abstract_excerpt":"In this work, we consider the burnt pancake problem, which is a well-studied problem going back to a work of Gates and Papadimitriou from 1979.The problem is to sort a stack of~$n$ one-sided burnt pancakes of different sizes, by a sequence of flips of the top pancakes, such that at the end of the flipping sequence the pancakes have increasing size and the burnt sides of all pancakes are face-down. The pancakes are denoted by $ 1,2,\\dots,n$, and a number is multiplied by $-1$, if the corresponding pancake has burnt side face-up.\n  Let $T(n)$ be the minimum number of flips to sort a special stac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.09447","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/2601.09447/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":"2601.09447","created_at":"2026-05-28T01:04:35.285878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.09447v2","created_at":"2026-05-28T01:04:35.285878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.09447","created_at":"2026-05-28T01:04:35.285878+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTGXP7QOG4OT","created_at":"2026-05-28T01:04:35.285878+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTGXP7QOG4OTO5UX","created_at":"2026-05-28T01:04:35.285878+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTGXP7QO","created_at":"2026-05-28T01:04:35.285878+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/YTGXP7QOG4OTO5UXAIGFXRGTQ2","json":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2.json","graph_json":"https://pith.science/api/pith-number/YTGXP7QOG4OTO5UXAIGFXRGTQ2/graph.json","events_json":"https://pith.science/api/pith-number/YTGXP7QOG4OTO5UXAIGFXRGTQ2/events.json","paper":"https://pith.science/paper/YTGXP7QO"},"agent_actions":{"view_html":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2","download_json":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2.json","view_paper":"https://pith.science/paper/YTGXP7QO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.09447&json=true","fetch_graph":"https://pith.science/api/pith-number/YTGXP7QOG4OTO5UXAIGFXRGTQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/YTGXP7QOG4OTO5UXAIGFXRGTQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2/action/storage_attestation","attest_author":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2/action/author_attestation","sign_citation":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2/action/citation_signature","submit_replication":"https://pith.science/pith/YTGXP7QOG4OTO5UXAIGFXRGTQ2/action/replication_record"}},"created_at":"2026-05-28T01:04:35.285878+00:00","updated_at":"2026-05-28T01:04:35.285878+00:00"}