{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WOF6SVJGERKZQVQWHQAKCKNRGM","short_pith_number":"pith:WOF6SVJG","schema_version":"1.0","canonical_sha256":"b38be9552624559856163c00a129b13332d4df503aa9883f3d19662db11372e0","source":{"kind":"arxiv","id":"0911.2567","version":2},"attestation_state":"computed","paper":{"title":"Tile Packing Tomography is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Antoni Lozano, Christoph Durr, Flavio Guinez, Marek Chrobak, Nguyen Kim Thang","submitted_at":"2009-11-13T08:54:27Z","abstract_excerpt":"Discrete tomography deals with reconstructing finite spatial objects from lower dimensional projections and has applications for example in timetable design. In this paper we consider the problem of reconstructing a tile packing from its row and column projections. It consists of disjoint copies of a fixed tile, all contained in some rectangular grid. The projections tell how many cells are covered by a tile in each row and column. How difficult is it to construct a tile packing satisfying given projections? It was known to be solvable by a greedy algorithm for bars (tiles of width or height 1"},"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":"0911.2567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-11-13T08:54:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cb5759233b00fb5ca3f6850d80afe4ac86eeac5398dba1ba0746cafad849bb4c","abstract_canon_sha256":"e1a165de1635c82714c40fb8754cfc734e90d4999f6a5c191c04acf6e3f4dac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.599480Z","signature_b64":"0WSljNv3vuc7PJUnXFaeUgW8uDFLAxLodwACjy3j1FDXYevUbLOJEZc21UKy54hXKgWIJ2X6HGNv/PS9+W2RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b38be9552624559856163c00a129b13332d4df503aa9883f3d19662db11372e0","last_reissued_at":"2026-05-18T04:32:54.598985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.598985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tile Packing Tomography is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Antoni Lozano, Christoph Durr, Flavio Guinez, Marek Chrobak, Nguyen Kim Thang","submitted_at":"2009-11-13T08:54:27Z","abstract_excerpt":"Discrete tomography deals with reconstructing finite spatial objects from lower dimensional projections and has applications for example in timetable design. In this paper we consider the problem of reconstructing a tile packing from its row and column projections. It consists of disjoint copies of a fixed tile, all contained in some rectangular grid. The projections tell how many cells are covered by a tile in each row and column. How difficult is it to construct a tile packing satisfying given projections? It was known to be solvable by a greedy algorithm for bars (tiles of width or height 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2567","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":""},"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":"0911.2567","created_at":"2026-05-18T04:32:54.599064+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.2567v2","created_at":"2026-05-18T04:32:54.599064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2567","created_at":"2026-05-18T04:32:54.599064+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOF6SVJGERKZ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOF6SVJGERKZQVQW","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOF6SVJG","created_at":"2026-05-18T12:26:02.257875+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/WOF6SVJGERKZQVQWHQAKCKNRGM","json":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM.json","graph_json":"https://pith.science/api/pith-number/WOF6SVJGERKZQVQWHQAKCKNRGM/graph.json","events_json":"https://pith.science/api/pith-number/WOF6SVJGERKZQVQWHQAKCKNRGM/events.json","paper":"https://pith.science/paper/WOF6SVJG"},"agent_actions":{"view_html":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM","download_json":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM.json","view_paper":"https://pith.science/paper/WOF6SVJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.2567&json=true","fetch_graph":"https://pith.science/api/pith-number/WOF6SVJGERKZQVQWHQAKCKNRGM/graph.json","fetch_events":"https://pith.science/api/pith-number/WOF6SVJGERKZQVQWHQAKCKNRGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM/action/storage_attestation","attest_author":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM/action/author_attestation","sign_citation":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM/action/citation_signature","submit_replication":"https://pith.science/pith/WOF6SVJGERKZQVQWHQAKCKNRGM/action/replication_record"}},"created_at":"2026-05-18T04:32:54.599064+00:00","updated_at":"2026-05-18T04:32:54.599064+00:00"}