{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7KZZ7R4LNSDHWSB7AK3A7ESFH7","short_pith_number":"pith:7KZZ7R4L","schema_version":"1.0","canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","source":{"kind":"arxiv","id":"2605.27833","version":1},"attestation_state":"computed","paper":{"title":"Linnik's problem for multiplicative functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joni Ter\\\"av\\\"ainen, Kaisa Matom\\\"aki","submitted_at":"2026-05-27T01:44:41Z","abstract_excerpt":"We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\\colon \\mathbb{N}\\to\\mathbb{R}\\setminus\\{0\\}$ be a multiplicative function, and let $a \\pmod q$ be a reduced residue class. We ask how far one must go before finding square-free integers $n_1,n_2\\equiv a \\pmod q$ with $h(n_1)<0<h(n_2)$. We show that one can always find such integers with $n_1,n_2\\le q^{2+o(1)}$, unless the sign of $h$ strongly pretends to be a real Dirichlet character modulo $q$. Thus, apart from this natural character obstruction, sign changes of a multiplica"},"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":"2605.27833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-27T01:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"01e0f56eda92d58b8e88d02eb8cc2c5785f3fc27520f9213d873fa6f89d5d978","abstract_canon_sha256":"657413cc46bf595148534c33fc12e56a018ca7ff92b45ec647cf4bbdf501b6d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:49.927658Z","signature_b64":"T5+u3qsdtI1hvdkY6SPT0zp/2790tQj0CQYIo9AeWWRZpL47qpgyfmnpCuFF+cK8oZJUOV8X6iWoyEp+J0MZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","last_reissued_at":"2026-05-28T01:04:49.927266Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:49.927266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linnik's problem for multiplicative functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joni Ter\\\"av\\\"ainen, Kaisa Matom\\\"aki","submitted_at":"2026-05-27T01:44:41Z","abstract_excerpt":"We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\\colon \\mathbb{N}\\to\\mathbb{R}\\setminus\\{0\\}$ be a multiplicative function, and let $a \\pmod q$ be a reduced residue class. We ask how far one must go before finding square-free integers $n_1,n_2\\equiv a \\pmod q$ with $h(n_1)<0<h(n_2)$. We show that one can always find such integers with $n_1,n_2\\le q^{2+o(1)}$, unless the sign of $h$ strongly pretends to be a real Dirichlet character modulo $q$. Thus, apart from this natural character obstruction, sign changes of a multiplica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27833","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/2605.27833/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":"2605.27833","created_at":"2026-05-28T01:04:49.927341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27833v1","created_at":"2026-05-28T01:04:49.927341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27833","created_at":"2026-05-28T01:04:49.927341+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KZZ7R4LNSDH","created_at":"2026-05-28T01:04:49.927341+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KZZ7R4LNSDHWSB7","created_at":"2026-05-28T01:04:49.927341+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KZZ7R4L","created_at":"2026-05-28T01:04:49.927341+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/7KZZ7R4LNSDHWSB7AK3A7ESFH7","json":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7.json","graph_json":"https://pith.science/api/pith-number/7KZZ7R4LNSDHWSB7AK3A7ESFH7/graph.json","events_json":"https://pith.science/api/pith-number/7KZZ7R4LNSDHWSB7AK3A7ESFH7/events.json","paper":"https://pith.science/paper/7KZZ7R4L"},"agent_actions":{"view_html":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7","download_json":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7.json","view_paper":"https://pith.science/paper/7KZZ7R4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27833&json=true","fetch_graph":"https://pith.science/api/pith-number/7KZZ7R4LNSDHWSB7AK3A7ESFH7/graph.json","fetch_events":"https://pith.science/api/pith-number/7KZZ7R4LNSDHWSB7AK3A7ESFH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/action/storage_attestation","attest_author":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/action/author_attestation","sign_citation":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/action/citation_signature","submit_replication":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/action/replication_record"}},"created_at":"2026-05-28T01:04:49.927341+00:00","updated_at":"2026-05-28T01:04:49.927341+00:00"}