{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:S6KPXQ5HGPSVHM733K2BOHSIJ4","short_pith_number":"pith:S6KPXQ5H","canonical_record":{"source":{"id":"1102.3236","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-16T04:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"e36d7066ff51bd85915a25dd4cc6dbbbd8afb6e7ecd76f4168d4287d8f612038","abstract_canon_sha256":"1d6cb8879ebcfe2dd6326e3c69e2a8d7377db85e8adf62585322a85d556af7f3"},"schema_version":"1.0"},"canonical_sha256":"9794fbc3a733e553b3fbdab4171e484f3d822f04d904936dbb49a18e45ab5a80","source":{"kind":"arxiv","id":"1102.3236","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3236","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3236v3","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3236","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"S6KPXQ5HGPSV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S6KPXQ5HGPSVHM73","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S6KPXQ5H","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:S6KPXQ5HGPSVHM733K2BOHSIJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3236","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-16T04:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"e36d7066ff51bd85915a25dd4cc6dbbbd8afb6e7ecd76f4168d4287d8f612038","abstract_canon_sha256":"1d6cb8879ebcfe2dd6326e3c69e2a8d7377db85e8adf62585322a85d556af7f3"},"schema_version":"1.0"},"canonical_sha256":"9794fbc3a733e553b3fbdab4171e484f3d822f04d904936dbb49a18e45ab5a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:44.782461Z","signature_b64":"zP2saUztyse0K0MWytnrj41Aq7yoXAbo2tcp54Wlot+6OmeAL0g8ENlzdt5TQGNKvazIYB4ZtzczFxoYMPsiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9794fbc3a733e553b3fbdab4171e484f3d822f04d904936dbb49a18e45ab5a80","last_reissued_at":"2026-05-18T00:42:44.781852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:44.781852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3236","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIP7jvbkOAjPPYxCDrg1XBv1GCwkU8mlqB+ZEvYGexrEVsIwvteWJ/LiG1dRmHqKHedkQHMeDnJcn4sxi9b9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:00:01.516179Z"},"content_sha256":"16084343962bd7b44aaaf4841055a5b0592436756824ade8b2e7fa738e33c015","schema_version":"1.0","event_id":"sha256:16084343962bd7b44aaaf4841055a5b0592436756824ade8b2e7fa738e33c015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:S6KPXQ5HGPSVHM733K2BOHSIJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of integers in a generalized multiplication table","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dimitris Koukoulopoulos","submitted_at":"2011-02-16T04:39:56Z","abstract_excerpt":"Motivated by the Erdos multiplication table problem we study the following question: Given numbers N_1,...,N_{k+1}, how many distinct products of the form n_1...n_{k+1} with n_i<N_i for all i are there? Call A_{k+1}(N_1,...,N_{k+1}) the quantity in question. Ford established the order of magnitude of A_2(N_1,N_2) and the author of A_{k+1}(N,...,N) for all k>1. In the present paper we generalize these results by establishing the order of magnitude of A_{k+1}(N_1,...,N_{k+1}) for arbitrary choices of N_1,...,N_{k+1} when k is 2,3,4 or 5. Moreover, we obtain a partial answer to our question when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3236","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvQTUTl2Jjz7/TnGYGCwaX/I3zb72/EJbn1vXF5VMWwWtvZaFTRwxS8qQ1bjB059qYpsfn9XrDRMKTxR0NUdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:00:01.516548Z"},"content_sha256":"d6cbb344de998d13fa26c26674286d2289a4a7bb3d32710f3ad0cc9e8513fc6a","schema_version":"1.0","event_id":"sha256:d6cbb344de998d13fa26c26674286d2289a4a7bb3d32710f3ad0cc9e8513fc6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/bundle.json","state_url":"https://pith.science/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T13:00:01Z","links":{"resolver":"https://pith.science/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4","bundle":"https://pith.science/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/bundle.json","state":"https://pith.science/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6KPXQ5HGPSVHM733K2BOHSIJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:S6KPXQ5HGPSVHM733K2BOHSIJ4","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":"1d6cb8879ebcfe2dd6326e3c69e2a8d7377db85e8adf62585322a85d556af7f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-16T04:39:56Z","title_canon_sha256":"e36d7066ff51bd85915a25dd4cc6dbbbd8afb6e7ecd76f4168d4287d8f612038"},"schema_version":"1.0","source":{"id":"1102.3236","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3236","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3236v3","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3236","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"S6KPXQ5HGPSV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"S6KPXQ5HGPSVHM73","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"S6KPXQ5H","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:d6cbb344de998d13fa26c26674286d2289a4a7bb3d32710f3ad0cc9e8513fc6a","target":"graph","created_at":"2026-05-18T00:42:44Z","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"},"paper":{"abstract_excerpt":"Motivated by the Erdos multiplication table problem we study the following question: Given numbers N_1,...,N_{k+1}, how many distinct products of the form n_1...n_{k+1} with n_i<N_i for all i are there? Call A_{k+1}(N_1,...,N_{k+1}) the quantity in question. Ford established the order of magnitude of A_2(N_1,N_2) and the author of A_{k+1}(N,...,N) for all k>1. In the present paper we generalize these results by establishing the order of magnitude of A_{k+1}(N_1,...,N_{k+1}) for arbitrary choices of N_1,...,N_{k+1} when k is 2,3,4 or 5. Moreover, we obtain a partial answer to our question when ","authors_text":"Dimitris Koukoulopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-16T04:39:56Z","title":"On the number of integers in a generalized multiplication table"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3236","kind":"arxiv","version":3},"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:16084343962bd7b44aaaf4841055a5b0592436756824ade8b2e7fa738e33c015","target":"record","created_at":"2026-05-18T00:42:44Z","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":"1d6cb8879ebcfe2dd6326e3c69e2a8d7377db85e8adf62585322a85d556af7f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-16T04:39:56Z","title_canon_sha256":"e36d7066ff51bd85915a25dd4cc6dbbbd8afb6e7ecd76f4168d4287d8f612038"},"schema_version":"1.0","source":{"id":"1102.3236","kind":"arxiv","version":3}},"canonical_sha256":"9794fbc3a733e553b3fbdab4171e484f3d822f04d904936dbb49a18e45ab5a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9794fbc3a733e553b3fbdab4171e484f3d822f04d904936dbb49a18e45ab5a80","first_computed_at":"2026-05-18T00:42:44.781852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:44.781852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zP2saUztyse0K0MWytnrj41Aq7yoXAbo2tcp54Wlot+6OmeAL0g8ENlzdt5TQGNKvazIYB4ZtzczFxoYMPsiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:44.782461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3236","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16084343962bd7b44aaaf4841055a5b0592436756824ade8b2e7fa738e33c015","sha256:d6cbb344de998d13fa26c26674286d2289a4a7bb3d32710f3ad0cc9e8513fc6a"],"state_sha256":"73e44ad65b49ad5f417cd9a6033fb4dcd9c633a2d5e5769d52c903fad52e1385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zrkf+MTWUooZWGQdSr67ndPUS8Qved9bVPEO1tHp0siQxWU2thnFkEEK9g35LvRjjfWWiTrq/uH2bk3FTnFPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:00:01.518630Z","bundle_sha256":"c8adab9bf17a214f40027ea2a2448f0661dd3a4a8401ea4416cfcabeac4c5a3c"}}