{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ERZSMT7M5DVBFTBYDCN54HZDEO","short_pith_number":"pith:ERZSMT7M","schema_version":"1.0","canonical_sha256":"2473264fece8ea12cc38189bde1f2323a0732db2abe4143a2959f5080fdde2c9","source":{"kind":"arxiv","id":"2310.13016","version":1},"attestation_state":"computed","paper":{"title":"Solving the multiplication problem of a large language model system using a graph-based method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.OH","authors_text":"Abdul Hafeez-Baig, Mehmet Baygin, Prabal Datta Barua, Ru-San Tan, Sengul Dogan, Subrata Chakraborty, Turker Tuncer, U. Rajendra Acharya","submitted_at":"2023-10-18T08:02:00Z","abstract_excerpt":"The generative pre-trained transformer (GPT)-based chatbot software ChatGPT possesses excellent natural language processing capabilities but is inadequate for solving arithmetic problems, especially multiplication. Its GPT structure uses a computational graph for multiplication, which has limited accuracy beyond simple multiplication operations. We developed a graph-based multiplication algorithm that emulated human-like numerical operations by incorporating a 10k operator, where k represents the maximum power to base 10 of the larger of two input numbers. Our proposed algorithm attained 100% "},"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":"2310.13016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2023-10-18T08:02:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"54f5ac89235fa44425f5ecf0dcbf3f2ea09b95651f99f778d0e1fd69c861f2c6","abstract_canon_sha256":"3b6904c76b571ac2b68787c5899c899987bd35fe1394eb385d5aa00b215c2ea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:55.796592Z","signature_b64":"tuziFaycEsOzanWI6394RQAZ9sW6BzXWsE1jQndrq3989NRo543QTqj4kGXe7q+beBjCr79wYkYqmUHkGL2UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2473264fece8ea12cc38189bde1f2323a0732db2abe4143a2959f5080fdde2c9","last_reissued_at":"2026-07-05T07:02:55.796089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:55.796089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the multiplication problem of a large language model system using a graph-based method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.OH","authors_text":"Abdul Hafeez-Baig, Mehmet Baygin, Prabal Datta Barua, Ru-San Tan, Sengul Dogan, Subrata Chakraborty, Turker Tuncer, U. Rajendra Acharya","submitted_at":"2023-10-18T08:02:00Z","abstract_excerpt":"The generative pre-trained transformer (GPT)-based chatbot software ChatGPT possesses excellent natural language processing capabilities but is inadequate for solving arithmetic problems, especially multiplication. Its GPT structure uses a computational graph for multiplication, which has limited accuracy beyond simple multiplication operations. We developed a graph-based multiplication algorithm that emulated human-like numerical operations by incorporating a 10k operator, where k represents the maximum power to base 10 of the larger of two input numbers. Our proposed algorithm attained 100% "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13016","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.13016/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.13016","created_at":"2026-07-05T07:02:55.796150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.13016v1","created_at":"2026-07-05T07:02:55.796150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13016","created_at":"2026-07-05T07:02:55.796150+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERZSMT7M5DVB","created_at":"2026-07-05T07:02:55.796150+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERZSMT7M5DVBFTBY","created_at":"2026-07-05T07:02:55.796150+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERZSMT7M","created_at":"2026-07-05T07:02:55.796150+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.29069","citing_title":"On the Mirage of Long-Range Dependency, with an Application to Integer Multiplication","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO","json":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO.json","graph_json":"https://pith.science/api/pith-number/ERZSMT7M5DVBFTBYDCN54HZDEO/graph.json","events_json":"https://pith.science/api/pith-number/ERZSMT7M5DVBFTBYDCN54HZDEO/events.json","paper":"https://pith.science/paper/ERZSMT7M"},"agent_actions":{"view_html":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO","download_json":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO.json","view_paper":"https://pith.science/paper/ERZSMT7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.13016&json=true","fetch_graph":"https://pith.science/api/pith-number/ERZSMT7M5DVBFTBYDCN54HZDEO/graph.json","fetch_events":"https://pith.science/api/pith-number/ERZSMT7M5DVBFTBYDCN54HZDEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO/action/storage_attestation","attest_author":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO/action/author_attestation","sign_citation":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO/action/citation_signature","submit_replication":"https://pith.science/pith/ERZSMT7M5DVBFTBYDCN54HZDEO/action/replication_record"}},"created_at":"2026-07-05T07:02:55.796150+00:00","updated_at":"2026-07-05T07:02:55.796150+00:00"}