{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YVQHM3J3WMBKK3MGMZV5V3HYAH","short_pith_number":"pith:YVQHM3J3","schema_version":"1.0","canonical_sha256":"c560766d3bb302a56d86666bdaecf801efd1647836080ac586e6748346df1f7e","source":{"kind":"arxiv","id":"1205.0456","version":1},"attestation_state":"computed","paper":{"title":"An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AG","math.CO"],"primary_cat":"cs.SC","authors_text":"Paolo Lella","submitted_at":"2012-05-02T15:11:48Z","abstract_excerpt":"Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fixed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view i"},"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":"1205.0456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-05-02T15:11:48Z","cross_cats_sorted":["math.AC","math.AG","math.CO"],"title_canon_sha256":"abffc23f69d24eb2762a162c0abe312aefe3d6cfedef6a3515f4acd691a24b5c","abstract_canon_sha256":"54f11e3cf9e6514e8050013ee58e3d0aab9e026b0eaae13c86594093511619f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:34.491904Z","signature_b64":"urQ5vBKfTSiLKhneNBbuhJEISN7wcNnr6Pl5Nw1/FBsJxfnOXm2OvDVg04mP5QpUt4IzPt/ipSJgsxmFTb49DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c560766d3bb302a56d86666bdaecf801efd1647836080ac586e6748346df1f7e","last_reissued_at":"2026-05-18T03:56:34.491329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:34.491329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AG","math.CO"],"primary_cat":"cs.SC","authors_text":"Paolo Lella","submitted_at":"2012-05-02T15:11:48Z","abstract_excerpt":"Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fixed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0456","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":"1205.0456","created_at":"2026-05-18T03:56:34.491414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0456v1","created_at":"2026-05-18T03:56:34.491414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0456","created_at":"2026-05-18T03:56:34.491414+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVQHM3J3WMBK","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVQHM3J3WMBKK3MG","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVQHM3J3","created_at":"2026-05-18T12:27:30.460161+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/YVQHM3J3WMBKK3MGMZV5V3HYAH","json":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH.json","graph_json":"https://pith.science/api/pith-number/YVQHM3J3WMBKK3MGMZV5V3HYAH/graph.json","events_json":"https://pith.science/api/pith-number/YVQHM3J3WMBKK3MGMZV5V3HYAH/events.json","paper":"https://pith.science/paper/YVQHM3J3"},"agent_actions":{"view_html":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH","download_json":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH.json","view_paper":"https://pith.science/paper/YVQHM3J3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0456&json=true","fetch_graph":"https://pith.science/api/pith-number/YVQHM3J3WMBKK3MGMZV5V3HYAH/graph.json","fetch_events":"https://pith.science/api/pith-number/YVQHM3J3WMBKK3MGMZV5V3HYAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH/action/storage_attestation","attest_author":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH/action/author_attestation","sign_citation":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH/action/citation_signature","submit_replication":"https://pith.science/pith/YVQHM3J3WMBKK3MGMZV5V3HYAH/action/replication_record"}},"created_at":"2026-05-18T03:56:34.491414+00:00","updated_at":"2026-05-18T03:56:34.491414+00:00"}