{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TJUHJH74BHWSHOCRWTOGQYJYSL","short_pith_number":"pith:TJUHJH74","schema_version":"1.0","canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","source":{"kind":"arxiv","id":"1907.10230","version":1},"attestation_state":"computed","paper":{"title":"An FPT algorithm for orthogonal buttons and scissors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-07-24T04:21:12Z","abstract_excerpt":"We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an $n\\times m$ grid by a series of horizontal and vertical cuts. We show that the corresponding parameterized problem has an algorithm with time complexity $2^{O(k^2 \\log k)} (n+m)^{O(1)}$, where $k$ is an upper bound on the number of cuts."},"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":"1907.10230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-24T04:21:12Z","cross_cats_sorted":[],"title_canon_sha256":"8b935df520e0e86b120f6bd10d4b81741193b3b6ee8d211a8be771a165ef4beb","abstract_canon_sha256":"79a03dae994507079ec7943a6330c0677e1826d1b584f2b2b4a22e45d0d13ffb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.552424Z","signature_b64":"xJKZkpqeX7OgNXzn4bk51DAdSmRF1mCgmjwJPvYoLAKBKGxgyE/QzRqIlvqv/64xxi74wCmq6u0PWWquWWGjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","last_reissued_at":"2026-05-17T23:39:38.551733Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.551733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An FPT algorithm for orthogonal buttons and scissors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-07-24T04:21:12Z","abstract_excerpt":"We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an $n\\times m$ grid by a series of horizontal and vertical cuts. We show that the corresponding parameterized problem has an algorithm with time complexity $2^{O(k^2 \\log k)} (n+m)^{O(1)}$, where $k$ is an upper bound on the number of cuts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10230","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":"1907.10230","created_at":"2026-05-17T23:39:38.551830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10230v1","created_at":"2026-05-17T23:39:38.551830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10230","created_at":"2026-05-17T23:39:38.551830+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJUHJH74BHWS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJUHJH74BHWSHOCR","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJUHJH74","created_at":"2026-05-18T12:33:27.125529+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/TJUHJH74BHWSHOCRWTOGQYJYSL","json":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL.json","graph_json":"https://pith.science/api/pith-number/TJUHJH74BHWSHOCRWTOGQYJYSL/graph.json","events_json":"https://pith.science/api/pith-number/TJUHJH74BHWSHOCRWTOGQYJYSL/events.json","paper":"https://pith.science/paper/TJUHJH74"},"agent_actions":{"view_html":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL","download_json":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL.json","view_paper":"https://pith.science/paper/TJUHJH74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10230&json=true","fetch_graph":"https://pith.science/api/pith-number/TJUHJH74BHWSHOCRWTOGQYJYSL/graph.json","fetch_events":"https://pith.science/api/pith-number/TJUHJH74BHWSHOCRWTOGQYJYSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/action/storage_attestation","attest_author":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/action/author_attestation","sign_citation":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/action/citation_signature","submit_replication":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/action/replication_record"}},"created_at":"2026-05-17T23:39:38.551830+00:00","updated_at":"2026-05-17T23:39:38.551830+00:00"}