{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:R6JC6L4QK7FHGC42TEQWGN6ZRI","short_pith_number":"pith:R6JC6L4Q","schema_version":"1.0","canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","source":{"kind":"arxiv","id":"1108.1359","version":2},"attestation_state":"computed","paper":{"title":"Bounding invariants of fat points using a coding theory construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Adam Van Tuyl, Stefan O. Tohaneanu","submitted_at":"2011-08-05T16:05:18Z","abstract_excerpt":"Let $Z \\subseteq \\proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal free resolution of $I_Z$, the defining ideal of $Z$. We investigate this relation in the case that the support of $Z$ is a complete intersection; when $Z$ is reduced and a complete intersection we give lower bounds for $d(Z)$ that improve upon known bounds."},"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":"1108.1359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-08-05T16:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"f6f8fc16b9db20947c1edbfe65d6d44fd3af73ae22cacdbd4af6d99fc89bf892","abstract_canon_sha256":"d81e1a84a43776dd3cdd463763c919dd212cc6b0ba47be731965023ac76f7010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:01.448437Z","signature_b64":"5IQ3SHXUhLTKKLVMHRJAY/aN3ouw4KpOJG7DvPInqy60Re0j4uccP5w4+h3UsL7G3jXFo3rmw5pOZaKh1+kTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","last_reissued_at":"2026-05-18T03:59:01.447952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:01.447952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding invariants of fat points using a coding theory construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Adam Van Tuyl, Stefan O. Tohaneanu","submitted_at":"2011-08-05T16:05:18Z","abstract_excerpt":"Let $Z \\subseteq \\proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal free resolution of $I_Z$, the defining ideal of $Z$. We investigate this relation in the case that the support of $Z$ is a complete intersection; when $Z$ is reduced and a complete intersection we give lower bounds for $d(Z)$ that improve upon known bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1359","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":"1108.1359","created_at":"2026-05-18T03:59:01.448026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1359v2","created_at":"2026-05-18T03:59:01.448026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1359","created_at":"2026-05-18T03:59:01.448026+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6JC6L4QK7FH","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6JC6L4QK7FHGC42","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6JC6L4Q","created_at":"2026-05-18T12:26:41.206345+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/R6JC6L4QK7FHGC42TEQWGN6ZRI","json":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI.json","graph_json":"https://pith.science/api/pith-number/R6JC6L4QK7FHGC42TEQWGN6ZRI/graph.json","events_json":"https://pith.science/api/pith-number/R6JC6L4QK7FHGC42TEQWGN6ZRI/events.json","paper":"https://pith.science/paper/R6JC6L4Q"},"agent_actions":{"view_html":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI","download_json":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI.json","view_paper":"https://pith.science/paper/R6JC6L4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1359&json=true","fetch_graph":"https://pith.science/api/pith-number/R6JC6L4QK7FHGC42TEQWGN6ZRI/graph.json","fetch_events":"https://pith.science/api/pith-number/R6JC6L4QK7FHGC42TEQWGN6ZRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/action/storage_attestation","attest_author":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/action/author_attestation","sign_citation":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/action/citation_signature","submit_replication":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/action/replication_record"}},"created_at":"2026-05-18T03:59:01.448026+00:00","updated_at":"2026-05-18T03:59:01.448026+00:00"}