{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DLOPHZKPXFN77I6J7AJT7SHTA2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4c5e57856734528d3e82c6d6d074c1185d8ea724f6487282505fe776e7d3490a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-12T16:59:11Z","title_canon_sha256":"c2a795fd7665b4d4fcb4b5bafdd7f863bcd23797cce878b2efad5bf48535c62f"},"schema_version":"1.0","source":{"id":"1908.04251","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04251","created_at":"2026-07-05T03:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04251v2","created_at":"2026-07-05T03:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04251","created_at":"2026-07-05T03:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"DLOPHZKPXFN7","created_at":"2026-07-05T03:23:35Z"},{"alias_kind":"pith_short_16","alias_value":"DLOPHZKPXFN77I6J","created_at":"2026-07-05T03:23:35Z"},{"alias_kind":"pith_short_8","alias_value":"DLOPHZKP","created_at":"2026-07-05T03:23:35Z"}],"graph_snapshots":[{"event_id":"sha256:c14cd0fe3311d04cb0f87e4f7075d9bba6b0c6819ed877781a9f77edd192a711","target":"graph","created_at":"2026-07-05T03:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04251/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Carl Pomerance, David Purdum, Jonathan Webster, Richard Brent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-12T16:59:11Z","title":"Algorithms for the Multiplication Table Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04251","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c4afaa21fd7dda73ebaf0c2870d326b11a96f93b377e26c695ee19a01875f94c","target":"record","created_at":"2026-07-05T03:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4c5e57856734528d3e82c6d6d074c1185d8ea724f6487282505fe776e7d3490a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-12T16:59:11Z","title_canon_sha256":"c2a795fd7665b4d4fcb4b5bafdd7f863bcd23797cce878b2efad5bf48535c62f"},"schema_version":"1.0","source":{"id":"1908.04251","kind":"arxiv","version":2}},"canonical_sha256":"1adcf3e54fb95bffa3c9f8133fc8f3069a3af25ecccc7bfe36fe607ca0397dd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1adcf3e54fb95bffa3c9f8133fc8f3069a3af25ecccc7bfe36fe607ca0397dd6","first_computed_at":"2026-07-05T03:23:35.732083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:35.732083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDWgUG1ztZZpMbKfizNw5OK6dDD4/NOw+CWBBYIL6ssHotpSE3/8NJ2FsjM2PMmdKHFEXXP/41+VI1ZAkcy8BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:35.732474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04251","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4afaa21fd7dda73ebaf0c2870d326b11a96f93b377e26c695ee19a01875f94c","sha256:c14cd0fe3311d04cb0f87e4f7075d9bba6b0c6819ed877781a9f77edd192a711"],"state_sha256":"6bf0e8ca9b7123d2f7f8d86679f119627c7548e4c0cdeb186f078ed5b083122e"}