{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y27ZJJ7FM5EW6LLNGZRKYK2ZIB","short_pith_number":"pith:Y27ZJJ7F","schema_version":"1.0","canonical_sha256":"c6bf94a7e567496f2d6d3662ac2b5940448e1a13e90e9717161fa9dc6cc06a16","source":{"kind":"arxiv","id":"1907.06569","version":2},"attestation_state":"computed","paper":{"title":"Connected Components in the Hilbert Scheme of hypersurfaces in Grassmannians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"See-Hak Seong","submitted_at":"2019-07-15T16:21:26Z","abstract_excerpt":"We show that when $d \\geq 3$, the Hilbert scheme $Hilb_{dT+1-\\binom{d-1}{2}}(G(k,n))$ has 2 components, even though elements in both components have the same cohomology class. Moreover, we show that the Hilbert scheme associated to the Hilbert polynomial $\\binom{T+n}{n}-\\binom{T+n-d}{n}$ in Grassmannian has at most 2 connected components."},"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":"1907.06569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-15T16:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"f3d1b3f9eb1cee5cb2485c60a755c757d47dd2c4193f3dca04f3d7530d384f2c","abstract_canon_sha256":"8d97ede382937a053d4364fb81296d6110f448e80500f1401c1439bf63d047cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:29.520536Z","signature_b64":"tC/3cD1y0lnHw3YIU3Tzl94Ir0NuzFLKls5yC1cdtoT2K8T48Yb/dTQ3Ukaz7B+KU+z/AEpElcRigP8rv4u6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6bf94a7e567496f2d6d3662ac2b5940448e1a13e90e9717161fa9dc6cc06a16","last_reissued_at":"2026-05-17T23:40:29.519854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:29.519854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected Components in the Hilbert Scheme of hypersurfaces in Grassmannians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"See-Hak Seong","submitted_at":"2019-07-15T16:21:26Z","abstract_excerpt":"We show that when $d \\geq 3$, the Hilbert scheme $Hilb_{dT+1-\\binom{d-1}{2}}(G(k,n))$ has 2 components, even though elements in both components have the same cohomology class. Moreover, we show that the Hilbert scheme associated to the Hilbert polynomial $\\binom{T+n}{n}-\\binom{T+n-d}{n}$ in Grassmannian has at most 2 connected components."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06569","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06569","created_at":"2026-05-17T23:40:29.519952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06569v2","created_at":"2026-05-17T23:40:29.519952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06569","created_at":"2026-05-17T23:40:29.519952+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y27ZJJ7FM5EW","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y27ZJJ7FM5EW6LLN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y27ZJJ7F","created_at":"2026-05-18T12:33:33.725879+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/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB","json":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB.json","graph_json":"https://pith.science/api/pith-number/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/graph.json","events_json":"https://pith.science/api/pith-number/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/events.json","paper":"https://pith.science/paper/Y27ZJJ7F"},"agent_actions":{"view_html":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB","download_json":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB.json","view_paper":"https://pith.science/paper/Y27ZJJ7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06569&json=true","fetch_graph":"https://pith.science/api/pith-number/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/graph.json","fetch_events":"https://pith.science/api/pith-number/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/action/storage_attestation","attest_author":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/action/author_attestation","sign_citation":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/action/citation_signature","submit_replication":"https://pith.science/pith/Y27ZJJ7FM5EW6LLNGZRKYK2ZIB/action/replication_record"}},"created_at":"2026-05-17T23:40:29.519952+00:00","updated_at":"2026-05-17T23:40:29.519952+00:00"}