{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2T4CQSBKDAQ2KNDGOBRX34PZC3","short_pith_number":"pith:2T4CQSBK","schema_version":"1.0","canonical_sha256":"d4f828482a1821a5346670637df1f916d34d20e6385b0b3d44082ccc2e6c223f","source":{"kind":"arxiv","id":"0912.1915","version":3},"attestation_state":"computed","paper":{"title":"Combinatorial bounds on Hilbert functions of fat points in projective space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.AG","authors_text":"Brian Harbourne, Susan Cooper, Zach Teitler","submitted_at":"2009-12-10T05:00:59Z","abstract_excerpt":"We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defi"},"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":"0912.1915","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-12-10T05:00:59Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"17d5abcf3c448c3bfa0e5e58f1ee729563e4823690d0e4c6d8f232fb4ce7f34e","abstract_canon_sha256":"9a9baf4aed0bb21c1d25e9d89f5180da63fa1d659fd23d0ecd428240849b8e6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:29.483188Z","signature_b64":"+sLvzhfEgVPBmZ8sUHjZj/JBSC8XwugQ1LNnrZnGA4RBFQwtvUg1y7HDZ6cDAX7wDm6XtWSujyjuQ/WW5iwPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f828482a1821a5346670637df1f916d34d20e6385b0b3d44082ccc2e6c223f","last_reissued_at":"2026-05-18T04:33:29.482716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:29.482716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial bounds on Hilbert functions of fat points in projective space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.AG","authors_text":"Brian Harbourne, Susan Cooper, Zach Teitler","submitted_at":"2009-12-10T05:00:59Z","abstract_excerpt":"We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1915","kind":"arxiv","version":3},"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":"0912.1915","created_at":"2026-05-18T04:33:29.482788+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1915v3","created_at":"2026-05-18T04:33:29.482788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1915","created_at":"2026-05-18T04:33:29.482788+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T4CQSBKDAQ2","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T4CQSBKDAQ2KNDG","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T4CQSBK","created_at":"2026-05-18T12:25:58.018023+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/2T4CQSBKDAQ2KNDGOBRX34PZC3","json":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3.json","graph_json":"https://pith.science/api/pith-number/2T4CQSBKDAQ2KNDGOBRX34PZC3/graph.json","events_json":"https://pith.science/api/pith-number/2T4CQSBKDAQ2KNDGOBRX34PZC3/events.json","paper":"https://pith.science/paper/2T4CQSBK"},"agent_actions":{"view_html":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3","download_json":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3.json","view_paper":"https://pith.science/paper/2T4CQSBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1915&json=true","fetch_graph":"https://pith.science/api/pith-number/2T4CQSBKDAQ2KNDGOBRX34PZC3/graph.json","fetch_events":"https://pith.science/api/pith-number/2T4CQSBKDAQ2KNDGOBRX34PZC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3/action/storage_attestation","attest_author":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3/action/author_attestation","sign_citation":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3/action/citation_signature","submit_replication":"https://pith.science/pith/2T4CQSBKDAQ2KNDGOBRX34PZC3/action/replication_record"}},"created_at":"2026-05-18T04:33:29.482788+00:00","updated_at":"2026-05-18T04:33:29.482788+00:00"}