{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:G3WZX7JS3GTQWESHBTWDI4UPED","short_pith_number":"pith:G3WZX7JS","schema_version":"1.0","canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","source":{"kind":"arxiv","id":"0911.1388","version":2},"attestation_state":"computed","paper":{"title":"Binary Non-tiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Don Coppersmith, Victor S. Miller","submitted_at":"2009-11-07T03:25:40Z","abstract_excerpt":"A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint translates of V. In other words, V is a tile if and only if there is a subset A of GF(2)^n such that V+A = GF(2)^n uniquely (i.e., v + a = v' + a' implies that v=v' and a=a' where v,v' in V and a,a' in A). In some problems in coding theory and hashing we are given a putative tile V, and wish to know whether or not it is a tile. In this paper we give two computational criteria for certifying that V is not a tile. The first involves impossibility of a bin-packing problem, and the second involves infeasibility of a linear progr"},"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.1388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-11-07T03:25:40Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"7d9888d375c5f55c043d9c42e915a22ce80fb4e4d322954eab33d7a41dbf5b78","abstract_canon_sha256":"18bf1e24612da1d7127837b826845b0cb34bad96a6999a304b211d3779db6b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.310088Z","signature_b64":"Oq9MsUHoCv5rQxz6Omz2pBQdiL/6TchJ9y2i6jRjHfeN4eTGhll0EWdNp+LPnc1qD+y396dXeWV8JaVhNhA3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","last_reissued_at":"2026-05-18T04:16:32.309676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.309676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Non-tiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Don Coppersmith, Victor S. Miller","submitted_at":"2009-11-07T03:25:40Z","abstract_excerpt":"A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint translates of V. In other words, V is a tile if and only if there is a subset A of GF(2)^n such that V+A = GF(2)^n uniquely (i.e., v + a = v' + a' implies that v=v' and a=a' where v,v' in V and a,a' in A). In some problems in coding theory and hashing we are given a putative tile V, and wish to know whether or not it is a tile. In this paper we give two computational criteria for certifying that V is not a tile. The first involves impossibility of a bin-packing problem, and the second involves infeasibility of a linear progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1388","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.1388","created_at":"2026-05-18T04:16:32.309739+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.1388v2","created_at":"2026-05-18T04:16:32.309739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1388","created_at":"2026-05-18T04:16:32.309739+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3WZX7JS3GTQ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3WZX7JS3GTQWESH","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3WZX7JS","created_at":"2026-05-18T12:25:59.703012+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/G3WZX7JS3GTQWESHBTWDI4UPED","json":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED.json","graph_json":"https://pith.science/api/pith-number/G3WZX7JS3GTQWESHBTWDI4UPED/graph.json","events_json":"https://pith.science/api/pith-number/G3WZX7JS3GTQWESHBTWDI4UPED/events.json","paper":"https://pith.science/paper/G3WZX7JS"},"agent_actions":{"view_html":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED","download_json":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED.json","view_paper":"https://pith.science/paper/G3WZX7JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.1388&json=true","fetch_graph":"https://pith.science/api/pith-number/G3WZX7JS3GTQWESHBTWDI4UPED/graph.json","fetch_events":"https://pith.science/api/pith-number/G3WZX7JS3GTQWESHBTWDI4UPED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/action/storage_attestation","attest_author":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/action/author_attestation","sign_citation":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/action/citation_signature","submit_replication":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/action/replication_record"}},"created_at":"2026-05-18T04:16:32.309739+00:00","updated_at":"2026-05-18T04:16:32.309739+00:00"}