{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5CSXMHQSO3PVXDF4FQGV45KVAT","short_pith_number":"pith:5CSXMHQS","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"},"canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","source":{"kind":"arxiv","id":"1202.4384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4384","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4384v1","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4384","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"5CSXMHQSO3PV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5CSXMHQSO3PVXDF4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5CSXMHQS","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5CSXMHQSO3PVXDF4FQGV45KVAT","target":"record","payload":{"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"},"canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","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"},"source_kind":"arxiv","source_id":"1202.4384","source_version":1,"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-18T04:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe9N+v1be1mJRfr8Z2fzaLxa2DDJBupjQO1KGvUr5lnLdOiIwLoX0g6v13uww5l8si+3wD81GMyssI9Ke0LRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:30:41.448591Z"},"content_sha256":"fe0c6301428c606d68c70bcdd8fed3987ebd78c52ba44658152595b438177ac1","schema_version":"1.0","event_id":"sha256:fe0c6301428c606d68c70bcdd8fed3987ebd78c52ba44658152595b438177ac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5CSXMHQSO3PVXDF4FQGV45KVAT","target":"graph","payload":{"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"},"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-18T04:01:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkItan6+BikaZxQ2Lh4dMmPkFZZYJEvbv9EpgE85wKXJfW6uqByL4KnE7vUpcq2t/jwBGLXFhMOtAG8qMlCqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:30:41.449236Z"},"content_sha256":"4e19c3cd03b8c70b7f638a919518b99b34815f50c9dff7afb621d29536beaebd","schema_version":"1.0","event_id":"sha256:4e19c3cd03b8c70b7f638a919518b99b34815f50c9dff7afb621d29536beaebd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/bundle.json","state_url":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/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:30:41Z","links":{"resolver":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT","bundle":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/bundle.json","state":"https://pith.science/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CSXMHQSO3PVXDF4FQGV45KVAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5CSXMHQSO3PVXDF4FQGV45KVAT","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":"aff815142916aea76ad7bbaee526e8164b9163a248e5b98d2941e486365337b1","cross_cats_sorted":["cs.MS","cs.SC","math.AC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-02-20T17:05:30Z","title_canon_sha256":"ec46752e17a14044da1b7efbe968cf44a52bd704a283fbd2a2e67ec6327fdd9c"},"schema_version":"1.0","source":{"id":"1202.4384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4384","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4384v1","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4384","created_at":"2026-05-18T04:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"5CSXMHQSO3PV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5CSXMHQSO3PVXDF4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5CSXMHQS","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:4e19c3cd03b8c70b7f638a919518b99b34815f50c9dff7afb621d29536beaebd","target":"graph","created_at":"2026-05-18T04:01:51Z","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":"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","authors_text":"Paolo Lella","cross_cats":["cs.MS","cs.SC","math.AC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-02-20T17:05:30Z","title":"Computable Hilbert Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4384","kind":"arxiv","version":1},"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:fe0c6301428c606d68c70bcdd8fed3987ebd78c52ba44658152595b438177ac1","target":"record","created_at":"2026-05-18T04:01:51Z","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":"aff815142916aea76ad7bbaee526e8164b9163a248e5b98d2941e486365337b1","cross_cats_sorted":["cs.MS","cs.SC","math.AC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-02-20T17:05:30Z","title_canon_sha256":"ec46752e17a14044da1b7efbe968cf44a52bd704a283fbd2a2e67ec6327fdd9c"},"schema_version":"1.0","source":{"id":"1202.4384","kind":"arxiv","version":1}},"canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8a5761e1276df5b8cbc2c0d5e755504dc2096768c874b1bdf8cbfaf243671e5","first_computed_at":"2026-05-18T04:01:51.623767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:51.623767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ju4gV+Wg+ViXZjnKivcvAZGTLyZNXd2SPBOf0dDR2T/4KYQLlM719UommjM5foev3vXjnDL2ivtB3XImHMR7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:51.624285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe0c6301428c606d68c70bcdd8fed3987ebd78c52ba44658152595b438177ac1","sha256:4e19c3cd03b8c70b7f638a919518b99b34815f50c9dff7afb621d29536beaebd"],"state_sha256":"4caf81f4eca6f0a6d594625f3623bdf163096cef158d6165738b88fabb05350b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MArVzYnVje+NZXfvgaltRpGNaEYQUDBgVKex+PFqkAODhdohfig1SPldrJXd1E/SPbn72dDM0ZUT1KYbWklhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:30:41.452623Z","bundle_sha256":"df05c0248ea4b8329774997bddac9bd1c0ecfdbcfaf187d34674f0955891d9d2"}}