{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:R6JC6L4QK7FHGC42TEQWGN6ZRI","short_pith_number":"pith:R6JC6L4Q","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"},"canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","source":{"kind":"arxiv","id":"1108.1359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1359","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1359v2","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1359","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"R6JC6L4QK7FH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6JC6L4QK7FHGC42","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6JC6L4Q","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:R6JC6L4QK7FHGC42TEQWGN6ZRI","target":"record","payload":{"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"},"canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","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"},"source_kind":"arxiv","source_id":"1108.1359","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-18T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akD0jVVNlPA1PCB/VGx6FODB589VGZaNv1FmkssNQ5IojMSo0OOWhijqWCjnhwUQqGKRCTmDrZYy83kN9fiHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:36:56.982045Z"},"content_sha256":"54fc86a7db0d9eb0c8934066a1531396c2e8fe1f521c1df70ca60bdf9d961569","schema_version":"1.0","event_id":"sha256:54fc86a7db0d9eb0c8934066a1531396c2e8fe1f521c1df70ca60bdf9d961569"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:R6JC6L4QK7FHGC42TEQWGN6ZRI","target":"graph","payload":{"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"},"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-18T03:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQjfS14ssoqwtyurFnddF75KwdPRcRYp8GHa8Y+dne8Pf9FMiOgoTk9dcPE9x/kHOeGlfnNPgpZEjF5PJPVFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:36:56.982396Z"},"content_sha256":"4e690fe96273f6fd35e5fa8132a1f1d64543fea978117c44a217a968a3826b45","schema_version":"1.0","event_id":"sha256:4e690fe96273f6fd35e5fa8132a1f1d64543fea978117c44a217a968a3826b45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/bundle.json","state_url":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/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-05-28T14:36:56Z","links":{"resolver":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI","bundle":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/bundle.json","state":"https://pith.science/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6JC6L4QK7FHGC42TEQWGN6ZRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:R6JC6L4QK7FHGC42TEQWGN6ZRI","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":"d81e1a84a43776dd3cdd463763c919dd212cc6b0ba47be731965023ac76f7010","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-08-05T16:05:18Z","title_canon_sha256":"f6f8fc16b9db20947c1edbfe65d6d44fd3af73ae22cacdbd4af6d99fc89bf892"},"schema_version":"1.0","source":{"id":"1108.1359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1359","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1359v2","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1359","created_at":"2026-05-18T03:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"R6JC6L4QK7FH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6JC6L4QK7FHGC42","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6JC6L4Q","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:4e690fe96273f6fd35e5fa8132a1f1d64543fea978117c44a217a968a3826b45","target":"graph","created_at":"2026-05-18T03:59:01Z","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":"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.","authors_text":"Adam Van Tuyl, Stefan O. Tohaneanu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-08-05T16:05:18Z","title":"Bounding invariants of fat points using a coding theory construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1359","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:54fc86a7db0d9eb0c8934066a1531396c2e8fe1f521c1df70ca60bdf9d961569","target":"record","created_at":"2026-05-18T03:59:01Z","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":"d81e1a84a43776dd3cdd463763c919dd212cc6b0ba47be731965023ac76f7010","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-08-05T16:05:18Z","title_canon_sha256":"f6f8fc16b9db20947c1edbfe65d6d44fd3af73ae22cacdbd4af6d99fc89bf892"},"schema_version":"1.0","source":{"id":"1108.1359","kind":"arxiv","version":2}},"canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f922f2f9057ca730b9a99216337d98a1a9b27fae7f9bcc0378c4286cecbecef","first_computed_at":"2026-05-18T03:59:01.447952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:01.447952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5IQ3SHXUhLTKKLVMHRJAY/aN3ouw4KpOJG7DvPInqy60Re0j4uccP5w4+h3UsL7G3jXFo3rmw5pOZaKh1+kTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:01.448437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54fc86a7db0d9eb0c8934066a1531396c2e8fe1f521c1df70ca60bdf9d961569","sha256:4e690fe96273f6fd35e5fa8132a1f1d64543fea978117c44a217a968a3826b45"],"state_sha256":"6d275edb9cd1c5e547746b12c003a5306ccea26fafc54c1bc9eded8b1e45f2e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNa6ELYAg7dVss92C8WNAxcmAnX+ZykSVe3zoS7gFt1CrIgABNlbRpN62o7VUBIcFZRWbMJIsrmgxmKsh66FCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:36:56.984250Z","bundle_sha256":"c7aff8fdcda9f0a5e24aa2436487fa80ce81e49472c01f6ff9c6f21e278c166b"}}