{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:L32L7LDBDMHLPYKKFAGLOMPDDF","short_pith_number":"pith:L32L7LDB","schema_version":"1.0","canonical_sha256":"5ef4bfac611b0eb7e14a280cb731e3196fbae3a35acd4a82235c1e1d2230b3d1","source":{"kind":"arxiv","id":"1202.6493","version":1},"attestation_state":"computed","paper":{"title":"Ideals of curves given by points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"B. Trager, E. Fortuna, P. Gianni","submitted_at":"2012-02-29T09:24:28Z","abstract_excerpt":"Let C be an irreducible projective curve of degree d in Pn(K), where K is an algebraically closed field, and let I be the associated homogeneous prime ideal. We wish to compute generators for I, assuming we are given sufficiently many points on the curve C. In particular if I can be generated by polynomials of degree at most m and we are given md + 1 points on C, then we can find a set of generators for I. We will show that a minimal set of generators of I can be constructed in polynomial time. Our constructions are completely independent of any notion of term ordering; this allows us the maxi"},"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.6493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-02-29T09:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"8e0774dddaa5ad1e65cbcfa988938dafba593d6f74f0dedc4135857ffc3d4d6b","abstract_canon_sha256":"22cfb73da6fa6bb4f295ff74cae004dd9b2728b5c853de9b45545b6b050c21b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.385581Z","signature_b64":"TpneUJPWjKEzkcRjIeMdAo7rePT7i5w2pJVH1iEbvk+aGUaFUo5vPHjlmokt1qQPf+uGvPHH/c0RgYqTRt35CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ef4bfac611b0eb7e14a280cb731e3196fbae3a35acd4a82235c1e1d2230b3d1","last_reissued_at":"2026-05-18T04:01:12.384949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.384949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ideals of curves given by points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"B. Trager, E. Fortuna, P. Gianni","submitted_at":"2012-02-29T09:24:28Z","abstract_excerpt":"Let C be an irreducible projective curve of degree d in Pn(K), where K is an algebraically closed field, and let I be the associated homogeneous prime ideal. We wish to compute generators for I, assuming we are given sufficiently many points on the curve C. In particular if I can be generated by polynomials of degree at most m and we are given md + 1 points on C, then we can find a set of generators for I. We will show that a minimal set of generators of I can be constructed in polynomial time. Our constructions are completely independent of any notion of term ordering; this allows us the maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6493","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.6493","created_at":"2026-05-18T04:01:12.385072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6493v1","created_at":"2026-05-18T04:01:12.385072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6493","created_at":"2026-05-18T04:01:12.385072+00:00"},{"alias_kind":"pith_short_12","alias_value":"L32L7LDBDMHL","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"L32L7LDBDMHLPYKK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"L32L7LDB","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08017","citing_title":"Existence and computation of monomial families of near-optimal strategies for recursive games","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF","json":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF.json","graph_json":"https://pith.science/api/pith-number/L32L7LDBDMHLPYKKFAGLOMPDDF/graph.json","events_json":"https://pith.science/api/pith-number/L32L7LDBDMHLPYKKFAGLOMPDDF/events.json","paper":"https://pith.science/paper/L32L7LDB"},"agent_actions":{"view_html":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF","download_json":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF.json","view_paper":"https://pith.science/paper/L32L7LDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6493&json=true","fetch_graph":"https://pith.science/api/pith-number/L32L7LDBDMHLPYKKFAGLOMPDDF/graph.json","fetch_events":"https://pith.science/api/pith-number/L32L7LDBDMHLPYKKFAGLOMPDDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF/action/storage_attestation","attest_author":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF/action/author_attestation","sign_citation":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF/action/citation_signature","submit_replication":"https://pith.science/pith/L32L7LDBDMHLPYKKFAGLOMPDDF/action/replication_record"}},"created_at":"2026-05-18T04:01:12.385072+00:00","updated_at":"2026-05-18T04:01:12.385072+00:00"}