{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DLOPHZKPXFN77I6J7AJT7SHTA2","short_pith_number":"pith:DLOPHZKP","schema_version":"1.0","canonical_sha256":"1adcf3e54fb95bffa3c9f8133fc8f3069a3af25ecccc7bfe36fe607ca0397dd6","source":{"kind":"arxiv","id":"1908.04251","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for the Multiplication Table Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carl Pomerance, David Purdum, Jonathan Webster, Richard Brent","submitted_at":"2019-08-12T16:59:11Z","abstract_excerpt":"Let $M(n)$ denote the number of distinct entries in the $n \\times n$ multiplication table. The function $M(n)$ has been studied by Erd\\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \\to \\infty$ is not known precisely. Thus, there is some interest in algorithms for computing $M(n)$ either exactly or approximately. We compare several algorithms for computing $M(n)$ exactly, and give a new algorithm that has a subquadratic running time. We also present two Monte Carlo algorithms for approximate computation of $M(n)$. We give the results of exact computations for "},"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":"1908.04251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-12T16:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"c2a795fd7665b4d4fcb4b5bafdd7f863bcd23797cce878b2efad5bf48535c62f","abstract_canon_sha256":"4c5e57856734528d3e82c6d6d074c1185d8ea724f6487282505fe776e7d3490a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:35.732474Z","signature_b64":"SDWgUG1ztZZpMbKfizNw5OK6dDD4/NOw+CWBBYIL6ssHotpSE3/8NJ2FsjM2PMmdKHFEXXP/41+VI1ZAkcy8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1adcf3e54fb95bffa3c9f8133fc8f3069a3af25ecccc7bfe36fe607ca0397dd6","last_reissued_at":"2026-07-05T03:23:35.732083Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:35.732083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for the Multiplication Table Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carl Pomerance, David Purdum, Jonathan Webster, Richard Brent","submitted_at":"2019-08-12T16:59:11Z","abstract_excerpt":"Let $M(n)$ denote the number of distinct entries in the $n \\times n$ multiplication table. The function $M(n)$ has been studied by Erd\\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \\to \\infty$ is not known precisely. Thus, there is some interest in algorithms for computing $M(n)$ either exactly or approximately. We compare several algorithms for computing $M(n)$ exactly, and give a new algorithm that has a subquadratic running time. We also present two Monte Carlo algorithms for approximate computation of $M(n)$. We give the results of exact computations for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04251","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04251/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":"1908.04251","created_at":"2026-07-05T03:23:35.732138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04251v2","created_at":"2026-07-05T03:23:35.732138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04251","created_at":"2026-07-05T03:23:35.732138+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLOPHZKPXFN7","created_at":"2026-07-05T03:23:35.732138+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLOPHZKPXFN77I6J","created_at":"2026-07-05T03:23:35.732138+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLOPHZKP","created_at":"2026-07-05T03:23:35.732138+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/DLOPHZKPXFN77I6J7AJT7SHTA2","json":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2.json","graph_json":"https://pith.science/api/pith-number/DLOPHZKPXFN77I6J7AJT7SHTA2/graph.json","events_json":"https://pith.science/api/pith-number/DLOPHZKPXFN77I6J7AJT7SHTA2/events.json","paper":"https://pith.science/paper/DLOPHZKP"},"agent_actions":{"view_html":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2","download_json":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2.json","view_paper":"https://pith.science/paper/DLOPHZKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04251&json=true","fetch_graph":"https://pith.science/api/pith-number/DLOPHZKPXFN77I6J7AJT7SHTA2/graph.json","fetch_events":"https://pith.science/api/pith-number/DLOPHZKPXFN77I6J7AJT7SHTA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2/action/storage_attestation","attest_author":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2/action/author_attestation","sign_citation":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2/action/citation_signature","submit_replication":"https://pith.science/pith/DLOPHZKPXFN77I6J7AJT7SHTA2/action/replication_record"}},"created_at":"2026-07-05T03:23:35.732138+00:00","updated_at":"2026-07-05T03:23:35.732138+00:00"}