{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2TVQMGX2STQEOJLYBH255BWLLG","short_pith_number":"pith:2TVQMGX2","schema_version":"1.0","canonical_sha256":"d4eb061afa94e047257809f5de86cb59972df4a715eb083c5720ed5cfd7da6f4","source":{"kind":"arxiv","id":"1103.1357","version":1},"attestation_state":"computed","paper":{"title":"Achievable Sets in Z^n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.NT","authors_text":"Krishanu Sankar","submitted_at":"2011-03-07T19:54:21Z","abstract_excerpt":"What sets A \\subset Z^n can be written in the form (K-K) \\cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely characterizes achievable sets for n=1, but not much is known for n \\ge 2. We attempt to characterize achievable sets further by showing that with any finite, symmetric set A \\subset Z^n containing zero, we may associate a graph G(A). Then if A is achievable, we show the set associated to some connected component of G(A) is achievable. In two dimensions, we "},"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":"1103.1357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-03-07T19:54:21Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"8097b3ce0fc20f26e4d6fe2da604ab0ff36dd5646856073ca9d682cd09cb14b2","abstract_canon_sha256":"0e3691f9dd9b784626f3e4ca8233d0c86af857105e48c65c9ee9a96e5580e0e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:16.591140Z","signature_b64":"b2K9d+9hLEeMOmCWqsvMUnQ4Mj9SMJuGmgpuAvJ3ZKA9crS/UlfYKP1Bc8X+dTlEuw0qoH02M7sUYvRZguHwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4eb061afa94e047257809f5de86cb59972df4a715eb083c5720ed5cfd7da6f4","last_reissued_at":"2026-05-18T04:27:16.590424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:16.590424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achievable Sets in Z^n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.NT","authors_text":"Krishanu Sankar","submitted_at":"2011-03-07T19:54:21Z","abstract_excerpt":"What sets A \\subset Z^n can be written in the form (K-K) \\cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely characterizes achievable sets for n=1, but not much is known for n \\ge 2. We attempt to characterize achievable sets further by showing that with any finite, symmetric set A \\subset Z^n containing zero, we may associate a graph G(A). Then if A is achievable, we show the set associated to some connected component of G(A) is achievable. In two dimensions, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1357","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.1357","created_at":"2026-05-18T04:27:16.590541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1357v1","created_at":"2026-05-18T04:27:16.590541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1357","created_at":"2026-05-18T04:27:16.590541+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TVQMGX2STQE","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TVQMGX2STQEOJLY","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TVQMGX2","created_at":"2026-05-18T12:26:18.847500+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/2TVQMGX2STQEOJLYBH255BWLLG","json":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG.json","graph_json":"https://pith.science/api/pith-number/2TVQMGX2STQEOJLYBH255BWLLG/graph.json","events_json":"https://pith.science/api/pith-number/2TVQMGX2STQEOJLYBH255BWLLG/events.json","paper":"https://pith.science/paper/2TVQMGX2"},"agent_actions":{"view_html":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG","download_json":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG.json","view_paper":"https://pith.science/paper/2TVQMGX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1357&json=true","fetch_graph":"https://pith.science/api/pith-number/2TVQMGX2STQEOJLYBH255BWLLG/graph.json","fetch_events":"https://pith.science/api/pith-number/2TVQMGX2STQEOJLYBH255BWLLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG/action/storage_attestation","attest_author":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG/action/author_attestation","sign_citation":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG/action/citation_signature","submit_replication":"https://pith.science/pith/2TVQMGX2STQEOJLYBH255BWLLG/action/replication_record"}},"created_at":"2026-05-18T04:27:16.590541+00:00","updated_at":"2026-05-18T04:27:16.590541+00:00"}