{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QQ3WWFMQPP5OURGVGHJ6JHWWH4","short_pith_number":"pith:QQ3WWFMQ","schema_version":"1.0","canonical_sha256":"84376b15907bfaea44d531d3e49ed63f220f4fb7de9a3d731b2526ec2f0ed0d7","source":{"kind":"arxiv","id":"1707.02076","version":1},"attestation_state":"computed","paper":{"title":"Computing all border bases for ideals of points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Amir Hashemi, Martin Kreuzer, Samira Pourkhajouei","submitted_at":"2017-07-07T08:37:17Z","abstract_excerpt":"In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches are discussed: based on the Buchberger-M\\\"oller Algorithm, we first propose a new algorithm to compute all possible order ideals and the corresponding border bases for an ideal of points. The second approach involves adapting the Farr-Gao Algorithm for finding all sets connected to 1, as well as the corresponding border bases, for an ideal of points. It sho"},"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":"1707.02076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-07-07T08:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"b2fb97c19d2662f742648f3e00ad7d31d3278c89d3d7ba0e8a7b1f45bc62c18e","abstract_canon_sha256":"7308bcf660938f5a2ecfcd36b15ba0be2c301d23944941b85e00e8318ce786cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:43.052624Z","signature_b64":"hTFz5JP4MsVC6T+gD7ES54XFW9aZN1lV4PFqdbhIruvduU9+51k3xFLElMcNW86fxPtyjECAn34a26E/4re2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84376b15907bfaea44d531d3e49ed63f220f4fb7de9a3d731b2526ec2f0ed0d7","last_reissued_at":"2026-05-18T00:40:43.051911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:43.051911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing all border bases for ideals of points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Amir Hashemi, Martin Kreuzer, Samira Pourkhajouei","submitted_at":"2017-07-07T08:37:17Z","abstract_excerpt":"In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches are discussed: based on the Buchberger-M\\\"oller Algorithm, we first propose a new algorithm to compute all possible order ideals and the corresponding border bases for an ideal of points. The second approach involves adapting the Farr-Gao Algorithm for finding all sets connected to 1, as well as the corresponding border bases, for an ideal of points. It sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02076","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":"1707.02076","created_at":"2026-05-18T00:40:43.052021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02076v1","created_at":"2026-05-18T00:40:43.052021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02076","created_at":"2026-05-18T00:40:43.052021+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ3WWFMQPP5O","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ3WWFMQPP5OURGV","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ3WWFMQ","created_at":"2026-05-18T12:31:39.905425+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/QQ3WWFMQPP5OURGVGHJ6JHWWH4","json":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4.json","graph_json":"https://pith.science/api/pith-number/QQ3WWFMQPP5OURGVGHJ6JHWWH4/graph.json","events_json":"https://pith.science/api/pith-number/QQ3WWFMQPP5OURGVGHJ6JHWWH4/events.json","paper":"https://pith.science/paper/QQ3WWFMQ"},"agent_actions":{"view_html":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4","download_json":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4.json","view_paper":"https://pith.science/paper/QQ3WWFMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02076&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ3WWFMQPP5OURGVGHJ6JHWWH4/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ3WWFMQPP5OURGVGHJ6JHWWH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4/action/storage_attestation","attest_author":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4/action/author_attestation","sign_citation":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4/action/citation_signature","submit_replication":"https://pith.science/pith/QQ3WWFMQPP5OURGVGHJ6JHWWH4/action/replication_record"}},"created_at":"2026-05-18T00:40:43.052021+00:00","updated_at":"2026-05-18T00:40:43.052021+00:00"}