{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TJUHJH74BHWSHOCRWTOGQYJYSL","short_pith_number":"pith:TJUHJH74","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"},"canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","source":{"kind":"arxiv","id":"1907.10230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10230","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10230v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10230","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"TJUHJH74BHWS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TJUHJH74BHWSHOCR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TJUHJH74","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TJUHJH74BHWSHOCRWTOGQYJYSL","target":"record","payload":{"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"},"canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","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"},"source_kind":"arxiv","source_id":"1907.10230","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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObX97BLQZXCWYJx0WP6/tlKMB0txk2fGHxWcTT+eMOa+PQpDbmHpIcLTuztIduJuCJdEgCso5EYIcjvJ4b/0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:09:28.226470Z"},"content_sha256":"cf3aa0a21b6da1ba29ece7ebfbcdc70e80da48ca69bce9cddda5de0a9f23dca4","schema_version":"1.0","event_id":"sha256:cf3aa0a21b6da1ba29ece7ebfbcdc70e80da48ca69bce9cddda5de0a9f23dca4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TJUHJH74BHWSHOCRWTOGQYJYSL","target":"graph","payload":{"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"},"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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAiXS1Hdu0u/GUQh43ispUZ5iAEZJ/Fs3tpEQ2mWs4uOKWixLIWK57MnXIQhDsQmomeahVBzBZhInFLjtZP/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:09:28.227147Z"},"content_sha256":"03bf93ee93fa16a7eb2cc67fdb12755b6a46489698ea6d0a4b02da8b71c184b3","schema_version":"1.0","event_id":"sha256:03bf93ee93fa16a7eb2cc67fdb12755b6a46489698ea6d0a4b02da8b71c184b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/bundle.json","state_url":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/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-06-09T19:09:28Z","links":{"resolver":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL","bundle":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/bundle.json","state":"https://pith.science/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJUHJH74BHWSHOCRWTOGQYJYSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TJUHJH74BHWSHOCRWTOGQYJYSL","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":"79a03dae994507079ec7943a6330c0677e1826d1b584f2b2b4a22e45d0d13ffb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-24T04:21:12Z","title_canon_sha256":"8b935df520e0e86b120f6bd10d4b81741193b3b6ee8d211a8be771a165ef4beb"},"schema_version":"1.0","source":{"id":"1907.10230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10230","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10230v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10230","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"TJUHJH74BHWS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TJUHJH74BHWSHOCR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TJUHJH74","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:03bf93ee93fa16a7eb2cc67fdb12755b6a46489698ea6d0a4b02da8b71c184b3","target":"graph","created_at":"2026-05-17T23:39:38Z","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 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.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-24T04:21:12Z","title":"An FPT algorithm for orthogonal buttons and scissors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10230","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:cf3aa0a21b6da1ba29ece7ebfbcdc70e80da48ca69bce9cddda5de0a9f23dca4","target":"record","created_at":"2026-05-17T23:39:38Z","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":"79a03dae994507079ec7943a6330c0677e1826d1b584f2b2b4a22e45d0d13ffb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-24T04:21:12Z","title_canon_sha256":"8b935df520e0e86b120f6bd10d4b81741193b3b6ee8d211a8be771a165ef4beb"},"schema_version":"1.0","source":{"id":"1907.10230","kind":"arxiv","version":1}},"canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a68749ffc09ed23b851b4dc68613892e1c67f4935482799c5cfb76030d9555a","first_computed_at":"2026-05-17T23:39:38.551733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:38.551733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJKZkpqeX7OgNXzn4bk51DAdSmRF1mCgmjwJPvYoLAKBKGxgyE/QzRqIlvqv/64xxi74wCmq6u0PWWquWWGjAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:38.552424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3aa0a21b6da1ba29ece7ebfbcdc70e80da48ca69bce9cddda5de0a9f23dca4","sha256:03bf93ee93fa16a7eb2cc67fdb12755b6a46489698ea6d0a4b02da8b71c184b3"],"state_sha256":"6ac9dd0841f82c1dd076626f048eadf8be7dd352f5af94a4b08d7dcd612a3f31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5qdoGI6V24rzVV33v7Er/nVPHs1RXs/Y0doV6L3Eqh1hL8979Wj5scJxiNcMtZVQrKINRr/+n2cwZxQLtccBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:09:28.230969Z","bundle_sha256":"7e6336ace30ec3fdd04a2a433d73eeeddac7fadf0a26a36c08f92a7995d6092d"}}