{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:G3WZX7JS3GTQWESHBTWDI4UPED","short_pith_number":"pith:G3WZX7JS","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"},"canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","source":{"kind":"arxiv","id":"0911.1388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1388","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1388v2","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1388","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"G3WZX7JS3GTQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"G3WZX7JS3GTQWESH","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"G3WZX7JS","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:G3WZX7JS3GTQWESHBTWDI4UPED","target":"record","payload":{"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"},"canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","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"},"source_kind":"arxiv","source_id":"0911.1388","source_version":2,"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nA8f/kaG0P3LKP0uUvY82FpSuet3w92MnX+XgOZOMVQ8uE4Y1IeA99b+yHS80d2PQEhUeyRxnIdoZyBti8h2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:01:17.751139Z"},"content_sha256":"60b75668a0122ceba92c137341f1054c4c768e9357b099a456d18470d693309e","schema_version":"1.0","event_id":"sha256:60b75668a0122ceba92c137341f1054c4c768e9357b099a456d18470d693309e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:G3WZX7JS3GTQWESHBTWDI4UPED","target":"graph","payload":{"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"},"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXTTjCpGFj9O1/6p1HO4nAwgREDsSx8d9lw7Sx+vIvpaDbvYP9jOja6tihtjN15/czqmMAFJCmUXnXt7f8tTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:01:17.751763Z"},"content_sha256":"d97b34a983fe4108cd2dd2cf6277a831cb26a2b1dd48a8fc9dc8b85f9f303311","schema_version":"1.0","event_id":"sha256:d97b34a983fe4108cd2dd2cf6277a831cb26a2b1dd48a8fc9dc8b85f9f303311"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/bundle.json","state_url":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3WZX7JS3GTQWESHBTWDI4UPED/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-07-03T16:01:17Z","links":{"resolver":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED","bundle":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/bundle.json","state":"https://pith.science/pith/G3WZX7JS3GTQWESHBTWDI4UPED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3WZX7JS3GTQWESHBTWDI4UPED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:G3WZX7JS3GTQWESHBTWDI4UPED","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":"18bf1e24612da1d7127837b826845b0cb34bad96a6999a304b211d3779db6b78","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-11-07T03:25:40Z","title_canon_sha256":"7d9888d375c5f55c043d9c42e915a22ce80fb4e4d322954eab33d7a41dbf5b78"},"schema_version":"1.0","source":{"id":"0911.1388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1388","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1388v2","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1388","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"G3WZX7JS3GTQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"G3WZX7JS3GTQWESH","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"G3WZX7JS","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:d97b34a983fe4108cd2dd2cf6277a831cb26a2b1dd48a8fc9dc8b85f9f303311","target":"graph","created_at":"2026-05-18T04:16:32Z","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":"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","authors_text":"Don Coppersmith, Victor S. Miller","cross_cats":["cs.IT","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-11-07T03:25:40Z","title":"Binary Non-tiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1388","kind":"arxiv","version":2},"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:60b75668a0122ceba92c137341f1054c4c768e9357b099a456d18470d693309e","target":"record","created_at":"2026-05-18T04:16:32Z","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":"18bf1e24612da1d7127837b826845b0cb34bad96a6999a304b211d3779db6b78","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-11-07T03:25:40Z","title_canon_sha256":"7d9888d375c5f55c043d9c42e915a22ce80fb4e4d322954eab33d7a41dbf5b78"},"schema_version":"1.0","source":{"id":"0911.1388","kind":"arxiv","version":2}},"canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ed9bfd32d9a70b12470cec34728f20eb760ddc74dab6350709eb8a7dc5ab7b","first_computed_at":"2026-05-18T04:16:32.309676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:32.309676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oq9MsUHoCv5rQxz6Omz2pBQdiL/6TchJ9y2i6jRjHfeN4eTGhll0EWdNp+LPnc1qD+y396dXeWV8JaVhNhA3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:32.310088Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.1388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60b75668a0122ceba92c137341f1054c4c768e9357b099a456d18470d693309e","sha256:d97b34a983fe4108cd2dd2cf6277a831cb26a2b1dd48a8fc9dc8b85f9f303311"],"state_sha256":"f04384ad82809345d3a2af4799a0bef2373bece008f72eeedcc883316b6f0f8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJdw5wxV5RRlOmjTEG08N3Ob4MhDxCwph124xz2IBlLmflHygA3cCS45YftsZ7kyKtt9zQvNaTVg3ZyqY+yGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T16:01:17.754488Z","bundle_sha256":"d16e869e99ba1cf75cd127b2b4c49b0b62d25c1301f24e0140692c74f696bfb0"}}