{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6ERWRCEONUFJ4HOZZUCTYF74O6","short_pith_number":"pith:6ERWRCEO","schema_version":"1.0","canonical_sha256":"f12368888e6d0a9e1dd9cd053c17fc77b7ca30f872b6c962dd20a3256e75e193","source":{"kind":"arxiv","id":"1203.0596","version":3},"attestation_state":"computed","paper":{"title":"Pretentious multiplicative functions and the prime number theorem for arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dimitris Koukoulopoulos","submitted_at":"2012-03-03T01:26:10Z","abstract_excerpt":"Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions."},"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":"1203.0596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-03-03T01:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"d65e95bde8fdd6c6972c25eb2e5338daa88ff10ca9839a795d7866d1fd4d4d15","abstract_canon_sha256":"fe78c79b9f40c8c80f36cf738f54dc62c9918e0093a62793227f391339623215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:36.285102Z","signature_b64":"HX2Y4YQMMkZ3wUGH3xQk/+PC2J7Mqcm3iIwwJyVK/ms1hqiLbF4KyCYjVEPqCGgwa5gpluaSkzsBnVBx7PSXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12368888e6d0a9e1dd9cd053c17fc77b7ca30f872b6c962dd20a3256e75e193","last_reissued_at":"2026-05-17T23:53:36.284541Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:36.284541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pretentious multiplicative functions and the prime number theorem for arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dimitris Koukoulopoulos","submitted_at":"2012-03-03T01:26:10Z","abstract_excerpt":"Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0596","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.0596","created_at":"2026-05-17T23:53:36.284634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0596v3","created_at":"2026-05-17T23:53:36.284634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0596","created_at":"2026-05-17T23:53:36.284634+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ERWRCEONUFJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ERWRCEONUFJ4HOZ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ERWRCEO","created_at":"2026-05-18T12:26:56.085431+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/6ERWRCEONUFJ4HOZZUCTYF74O6","json":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6.json","graph_json":"https://pith.science/api/pith-number/6ERWRCEONUFJ4HOZZUCTYF74O6/graph.json","events_json":"https://pith.science/api/pith-number/6ERWRCEONUFJ4HOZZUCTYF74O6/events.json","paper":"https://pith.science/paper/6ERWRCEO"},"agent_actions":{"view_html":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6","download_json":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6.json","view_paper":"https://pith.science/paper/6ERWRCEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0596&json=true","fetch_graph":"https://pith.science/api/pith-number/6ERWRCEONUFJ4HOZZUCTYF74O6/graph.json","fetch_events":"https://pith.science/api/pith-number/6ERWRCEONUFJ4HOZZUCTYF74O6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6/action/storage_attestation","attest_author":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6/action/author_attestation","sign_citation":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6/action/citation_signature","submit_replication":"https://pith.science/pith/6ERWRCEONUFJ4HOZZUCTYF74O6/action/replication_record"}},"created_at":"2026-05-17T23:53:36.284634+00:00","updated_at":"2026-05-17T23:53:36.284634+00:00"}