{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:GXC4VRPPM6LVJ2J2GLQGTALCV6","short_pith_number":"pith:GXC4VRPP","canonical_record":{"source":{"id":"cs/0210020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2002-10-21T18:32:39Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"a6f7cf5c97e6f9ed557aaf9ace0fb18ee766d8b43ca45fa5d84f990a38998560","abstract_canon_sha256":"645b003bf42be1631fde1ded97d5b10122cc6b1e384338f73d4d5072d6dafa21"},"schema_version":"1.0"},"canonical_sha256":"35c5cac5ef679754e93a32e0698162afaadc44e27b97f0ebc018c09a958a9eec","source":{"kind":"arxiv","id":"cs/0210020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0210020","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0210020v1","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0210020","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_12","alias_value":"GXC4VRPPM6LV","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_16","alias_value":"GXC4VRPPM6LVJ2J2","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_8","alias_value":"GXC4VRPP","created_at":"2026-07-04T14:24:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:GXC4VRPPM6LVJ2J2GLQGTALCV6","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0210020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2002-10-21T18:32:39Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"a6f7cf5c97e6f9ed557aaf9ace0fb18ee766d8b43ca45fa5d84f990a38998560","abstract_canon_sha256":"645b003bf42be1631fde1ded97d5b10122cc6b1e384338f73d4d5072d6dafa21"},"schema_version":"1.0"},"canonical_sha256":"35c5cac5ef679754e93a32e0698162afaadc44e27b97f0ebc018c09a958a9eec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:21.611714Z","signature_b64":"uXo1vj3rM2ApzqWhlhgU0B0O0VkvkQv6eK5PSmroAj0uhX5hYB7ssW6Lsk0Av47p/i1ieVvOS6W2vKud5WMVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c5cac5ef679754e93a32e0698162afaadc44e27b97f0ebc018c09a958a9eec","last_reissued_at":"2026-07-04T14:24:21.611322Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:21.611322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0210020","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-07-04T14:24:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHmKu/kauQiorsTaEKTd/+5p62a33QNcF5G70Z0EIx2FeqvHHeNFvFQIJRhEklu3bUFxouTRpWQUIo+D+D/OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:45:12.024723Z"},"content_sha256":"9745994aaa7da762d944fa0e2716264e2bebb0f221d54ca7ea41a3ae80777820","schema_version":"1.0","event_id":"sha256:9745994aaa7da762d944fa0e2716264e2bebb0f221d54ca7ea41a3ae80777820"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:GXC4VRPPM6LVJ2J2GLQGTALCV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tetris is Hard, Even to Approximate","license":"","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.CC","authors_text":"David Liben-Nowell, Erik D. Demaine, Susan Hohenberger","submitted_at":"2002-10-21T18:32:39Z","abstract_excerpt":"In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared rows, maximize the number of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize the number of pieces placed before the game en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0210020","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0210020/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"},"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-07-04T14:24:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaKh26b4GFCU0H4C03xZKvdQ+/GlSX80VXz248/SAKoHgKpLo1WrUQBogais8E/S3NfTq/eU1lHZEa+eWpgoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:45:12.025291Z"},"content_sha256":"2995cad985dae190673f5b406d8134d0f75a373db8ec98563d25f4b65260095b","schema_version":"1.0","event_id":"sha256:2995cad985dae190673f5b406d8134d0f75a373db8ec98563d25f4b65260095b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/bundle.json","state_url":"https://pith.science/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/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-16T10:45:12Z","links":{"resolver":"https://pith.science/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6","bundle":"https://pith.science/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/bundle.json","state":"https://pith.science/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXC4VRPPM6LVJ2J2GLQGTALCV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:GXC4VRPPM6LVJ2J2GLQGTALCV6","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":"645b003bf42be1631fde1ded97d5b10122cc6b1e384338f73d4d5072d6dafa21","cross_cats_sorted":["cs.CG","cs.DM"],"license":"","primary_cat":"cs.CC","submitted_at":"2002-10-21T18:32:39Z","title_canon_sha256":"a6f7cf5c97e6f9ed557aaf9ace0fb18ee766d8b43ca45fa5d84f990a38998560"},"schema_version":"1.0","source":{"id":"cs/0210020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0210020","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0210020v1","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0210020","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_12","alias_value":"GXC4VRPPM6LV","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_16","alias_value":"GXC4VRPPM6LVJ2J2","created_at":"2026-07-04T14:24:21Z"},{"alias_kind":"pith_short_8","alias_value":"GXC4VRPP","created_at":"2026-07-04T14:24:21Z"}],"graph_snapshots":[{"event_id":"sha256:2995cad985dae190673f5b406d8134d0f75a373db8ec98563d25f4b65260095b","target":"graph","created_at":"2026-07-04T14:24:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0210020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared rows, maximize the number of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize the number of pieces placed before the game en","authors_text":"David Liben-Nowell, Erik D. Demaine, Susan Hohenberger","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2002-10-21T18:32:39Z","title":"Tetris is Hard, Even to Approximate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0210020","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:9745994aaa7da762d944fa0e2716264e2bebb0f221d54ca7ea41a3ae80777820","target":"record","created_at":"2026-07-04T14:24:21Z","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":"645b003bf42be1631fde1ded97d5b10122cc6b1e384338f73d4d5072d6dafa21","cross_cats_sorted":["cs.CG","cs.DM"],"license":"","primary_cat":"cs.CC","submitted_at":"2002-10-21T18:32:39Z","title_canon_sha256":"a6f7cf5c97e6f9ed557aaf9ace0fb18ee766d8b43ca45fa5d84f990a38998560"},"schema_version":"1.0","source":{"id":"cs/0210020","kind":"arxiv","version":1}},"canonical_sha256":"35c5cac5ef679754e93a32e0698162afaadc44e27b97f0ebc018c09a958a9eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35c5cac5ef679754e93a32e0698162afaadc44e27b97f0ebc018c09a958a9eec","first_computed_at":"2026-07-04T14:24:21.611322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:21.611322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXo1vj3rM2ApzqWhlhgU0B0O0VkvkQv6eK5PSmroAj0uhX5hYB7ssW6Lsk0Av47p/i1ieVvOS6W2vKud5WMVBA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:21.611714Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0210020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9745994aaa7da762d944fa0e2716264e2bebb0f221d54ca7ea41a3ae80777820","sha256:2995cad985dae190673f5b406d8134d0f75a373db8ec98563d25f4b65260095b"],"state_sha256":"84ef5b5f654e9dd3c0637fdccbffb3c5e5bc5685110402accf7572a3da21ac93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QJuiO31G9J/ZyokpEi/z8IJn8vejiacKWCx9Tq1g2SYsJ+BZQf3kqtygOsUM8x7+2GJXrbM+ocK+tnShg72CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:45:12.028953Z","bundle_sha256":"e4b8ce9b76266a40e663af64e03577c886d832f76c706f05191703314b588e0d"}}