{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A55RONWBXUQ4WWSWFQX2JST4LG","short_pith_number":"pith:A55RONWB","schema_version":"1.0","canonical_sha256":"077b1736c1bd21cb5a562c2fa4ca7c59987d7e1180e738fdff2db97dd9cd7cca","source":{"kind":"arxiv","id":"1507.03217","version":1},"attestation_state":"computed","paper":{"title":"An algorithm for computing Grobner basis and the complexity evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Chong-Il Byon, Hyon-Song Paek, Nam-Chol Kim, Yong-Jin Kim","submitted_at":"2015-07-12T11:12:42Z","abstract_excerpt":"In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others."},"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":"1507.03217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-07-12T11:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"680e16f08401625c77663a1f1bb510b40a346d748de260c3db64ae74e9a90333","abstract_canon_sha256":"bd7e8620c5cb7296abbca450d8dfd5ce94baf1f8e61e29add57d061e1b54579a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:59.370927Z","signature_b64":"UvsNWGDUm1zWRER5ztgsvMkd3+WoFw1pjLZ4krRvrvFrXfZTxyKKbO6QVsL6Blvutak3123i8FLVE0pEMxTJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077b1736c1bd21cb5a562c2fa4ca7c59987d7e1180e738fdff2db97dd9cd7cca","last_reissued_at":"2026-05-18T01:36:59.370393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:59.370393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for computing Grobner basis and the complexity evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Chong-Il Byon, Hyon-Song Paek, Nam-Chol Kim, Yong-Jin Kim","submitted_at":"2015-07-12T11:12:42Z","abstract_excerpt":"In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03217","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":"1507.03217","created_at":"2026-05-18T01:36:59.370488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03217v1","created_at":"2026-05-18T01:36:59.370488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03217","created_at":"2026-05-18T01:36:59.370488+00:00"},{"alias_kind":"pith_short_12","alias_value":"A55RONWBXUQ4","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A55RONWBXUQ4WWSW","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A55RONWB","created_at":"2026-05-18T12:29:10.953037+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/A55RONWBXUQ4WWSWFQX2JST4LG","json":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG.json","graph_json":"https://pith.science/api/pith-number/A55RONWBXUQ4WWSWFQX2JST4LG/graph.json","events_json":"https://pith.science/api/pith-number/A55RONWBXUQ4WWSWFQX2JST4LG/events.json","paper":"https://pith.science/paper/A55RONWB"},"agent_actions":{"view_html":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG","download_json":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG.json","view_paper":"https://pith.science/paper/A55RONWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03217&json=true","fetch_graph":"https://pith.science/api/pith-number/A55RONWBXUQ4WWSWFQX2JST4LG/graph.json","fetch_events":"https://pith.science/api/pith-number/A55RONWBXUQ4WWSWFQX2JST4LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG/action/storage_attestation","attest_author":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG/action/author_attestation","sign_citation":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG/action/citation_signature","submit_replication":"https://pith.science/pith/A55RONWBXUQ4WWSWFQX2JST4LG/action/replication_record"}},"created_at":"2026-05-18T01:36:59.370488+00:00","updated_at":"2026-05-18T01:36:59.370488+00:00"}