{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5CSXMHQSO3PVXDF4FQGV45KVAT","short_pith_number":"pith:5CSXMHQS","schema_version":"1.0","canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","source":{"kind":"arxiv","id":"1202.4384","version":1},"attestation_state":"computed","paper":{"title":"Computable Hilbert Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SC","math.AC","math.CO"],"primary_cat":"math.AG","authors_text":"Paolo Lella","submitted_at":"2012-02-20T17:05:30Z","abstract_excerpt":"In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subscheme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert poly"},"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":"1202.4384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-02-20T17:05:30Z","cross_cats_sorted":["cs.MS","cs.SC","math.AC","math.CO"],"title_canon_sha256":"ec46752e17a14044da1b7efbe968cf44a52bd704a283fbd2a2e67ec6327fdd9c","abstract_canon_sha256":"aff815142916aea76ad7bbaee526e8164b9163a248e5b98d2941e486365337b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:51.624285Z","signature_b64":"ju4gV+Wg+ViXZjnKivcvAZGTLyZNXd2SPBOf0dDR2T/4KYQLlM719UommjM5foev3vXjnDL2ivtB3XImHMR7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","last_reissued_at":"2026-05-18T04:01:51.623767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:51.623767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable Hilbert Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SC","math.AC","math.CO"],"primary_cat":"math.AG","authors_text":"Paolo Lella","submitted_at":"2012-02-20T17:05:30Z","abstract_excerpt":"In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subscheme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4384","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":"1202.4384","created_at":"2026-05-18T04:01:51.623839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4384v1","created_at":"2026-05-18T04:01:51.623839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4384","created_at":"2026-05-18T04:01:51.623839+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CSXMHQSO3PV","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CSXMHQSO3PVXDF4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CSXMHQS","created_at":"2026-05-18T12:26:53.410803+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/5CSXMHQSO3PVXDF4FQGV45KVAT","json":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT.json","graph_json":"https://pith.science/api/pith-number/5CSXMHQSO3PVXDF4FQGV45KVAT/graph.json","events_json":"https://pith.science/api/pith-number/5CSXMHQSO3PVXDF4FQGV45KVAT/events.json","paper":"https://pith.science/paper/5CSXMHQS"},"agent_actions":{"view_html":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT","download_json":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT.json","view_paper":"https://pith.science/paper/5CSXMHQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4384&json=true","fetch_graph":"https://pith.science/api/pith-number/5CSXMHQSO3PVXDF4FQGV45KVAT/graph.json","fetch_events":"https://pith.science/api/pith-number/5CSXMHQSO3PVXDF4FQGV45KVAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/action/storage_attestation","attest_author":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/action/author_attestation","sign_citation":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/action/citation_signature","submit_replication":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/action/replication_record"}},"created_at":"2026-05-18T04:01:51.623839+00:00","updated_at":"2026-05-18T04:01:51.623839+00:00"}