{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7KZZ7R4LNSDHWSB7AK3A7ESFH7","short_pith_number":"pith:7KZZ7R4L","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"},"canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","source":{"kind":"arxiv","id":"2605.27833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27833","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27833v1","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27833","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"7KZZ7R4LNSDH","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"7KZZ7R4LNSDHWSB7","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"7KZZ7R4L","created_at":"2026-05-28T01:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7KZZ7R4LNSDHWSB7AK3A7ESFH7","target":"record","payload":{"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"},"canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","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"},"source_kind":"arxiv","source_id":"2605.27833","source_version":1,"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-28T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoVXnYm0gwcPDDJbuwcFuJKJxb4QWlnH9qGD5TtHyFlzHzRR2C9EP9aoVqZ0Ax+YSVDEzGW/zzdGjNE09PBMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:31:24.904609Z"},"content_sha256":"349c56da36f574681bd27781b59de9328b0a5f5b889b7b046ede35f2f3cccdee","schema_version":"1.0","event_id":"sha256:349c56da36f574681bd27781b59de9328b0a5f5b889b7b046ede35f2f3cccdee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7KZZ7R4LNSDHWSB7AK3A7ESFH7","target":"graph","payload":{"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"},"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-28T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNZ/cqcIgci9VZ1rANr7+QNpAy1Pr2MgX9QOiBU+Rb5d3bObPdUwD0F1guQ1AzVcD2+JqW6IA0E85wEtQH6dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:31:24.905738Z"},"content_sha256":"a09eb082a14785d4b3463dc637560f2fcf77d71e18afdf58ecd4fb5ab79e272a","schema_version":"1.0","event_id":"sha256:a09eb082a14785d4b3463dc637560f2fcf77d71e18afdf58ecd4fb5ab79e272a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/bundle.json","state_url":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/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-08-11T14:31:24Z","links":{"resolver":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7","bundle":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/bundle.json","state":"https://pith.science/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KZZ7R4LNSDHWSB7AK3A7ESFH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7KZZ7R4LNSDHWSB7AK3A7ESFH7","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":"657413cc46bf595148534c33fc12e56a018ca7ff92b45ec647cf4bbdf501b6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-27T01:44:41Z","title_canon_sha256":"01e0f56eda92d58b8e88d02eb8cc2c5785f3fc27520f9213d873fa6f89d5d978"},"schema_version":"1.0","source":{"id":"2605.27833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27833","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27833v1","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27833","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"7KZZ7R4LNSDH","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"7KZZ7R4LNSDHWSB7","created_at":"2026-05-28T01:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"7KZZ7R4L","created_at":"2026-05-28T01:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:a09eb082a14785d4b3463dc637560f2fcf77d71e18afdf58ecd4fb5ab79e272a","target":"graph","created_at":"2026-05-28T01:04:49Z","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/2605.27833/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Joni Ter\\\"av\\\"ainen, Kaisa Matom\\\"aki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-27T01:44:41Z","title":"Linnik's problem for multiplicative functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27833","kind":"arxiv","version":1},"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:349c56da36f574681bd27781b59de9328b0a5f5b889b7b046ede35f2f3cccdee","target":"record","created_at":"2026-05-28T01:04:49Z","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":"657413cc46bf595148534c33fc12e56a018ca7ff92b45ec647cf4bbdf501b6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-27T01:44:41Z","title_canon_sha256":"01e0f56eda92d58b8e88d02eb8cc2c5785f3fc27520f9213d873fa6f89d5d978"},"schema_version":"1.0","source":{"id":"2605.27833","kind":"arxiv","version":1}},"canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fab39fc78b6c867b483f02b60f92453ff06baa3dc19b676cd464c86dc0bda719","first_computed_at":"2026-05-28T01:04:49.927266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:49.927266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T5+u3qsdtI1hvdkY6SPT0zp/2790tQj0CQYIo9AeWWRZpL47qpgyfmnpCuFF+cK8oZJUOV8X6iWoyEp+J0MZDQ==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:49.927658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349c56da36f574681bd27781b59de9328b0a5f5b889b7b046ede35f2f3cccdee","sha256:a09eb082a14785d4b3463dc637560f2fcf77d71e18afdf58ecd4fb5ab79e272a"],"state_sha256":"1e9502c267e39848c2e42ccc16e028acc067ebff57eb2d48ab935bdf7fe41469"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hi9/01Dkmni7v3pXwsFfRYFUr/S4nI3miml/JAfJrqGY+ckLERSe6luexMxvD2F7zHfY3N4tePL6jLVcKLZlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T14:31:24.913291Z","bundle_sha256":"106b2e809f6f9ca14a8190eda3c3978df20f9ce616c69e5bd11a21008ab73679"}}