{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6SLIU65YJV2JKH2Y5JR755YPPA","short_pith_number":"pith:6SLIU65Y","schema_version":"1.0","canonical_sha256":"f4968a7bb84d74951f58ea63fef70f7807afb5d817addd14401a5d01f73ab4be","source":{"kind":"arxiv","id":"1202.6303","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm to Compute l(1/2, f x \\chi_q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Pankaj Vishe","submitted_at":"2012-02-28T17:45:11Z","abstract_excerpt":"Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\\times\\chi_q)$ up to any specified precision. In the case when $q$ is smooth or highly composite integer, the time complexity of the algorithm is given by $O(1+|q|^{5/6+o(1)})$."},"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":"1202.6303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-02-28T17:45:11Z","cross_cats_sorted":[],"title_canon_sha256":"cf118881ed9c8d23c400e4a94d0155e1701c4d9cf3f39e878da3f4f0865fb71e","abstract_canon_sha256":"f83c87508e27d4cbc3d267409d4bf6a98d2c8a377bd8405dfcfc7b069e3a576c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:13.736491Z","signature_b64":"Rr6e2RxzsBgwBo+P/GSNhs+fa5csAC4MsQgkFwpQ+APtTb9GxOJtXDgja95YyvCm5ghq6W8pQ3tTl9T2GHUVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4968a7bb84d74951f58ea63fef70f7807afb5d817addd14401a5d01f73ab4be","last_reissued_at":"2026-05-18T04:01:13.735860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:13.735860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm to Compute l(1/2, f x \\chi_q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Pankaj Vishe","submitted_at":"2012-02-28T17:45:11Z","abstract_excerpt":"Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\\times\\chi_q)$ up to any specified precision. In the case when $q$ is smooth or highly composite integer, the time complexity of the algorithm is given by $O(1+|q|^{5/6+o(1)})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6303","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":""},"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":"1202.6303","created_at":"2026-05-18T04:01:13.735964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6303v1","created_at":"2026-05-18T04:01:13.735964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6303","created_at":"2026-05-18T04:01:13.735964+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SLIU65YJV2J","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SLIU65YJV2JKH2Y","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SLIU65Y","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/6SLIU65YJV2JKH2Y5JR755YPPA","json":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA.json","graph_json":"https://pith.science/api/pith-number/6SLIU65YJV2JKH2Y5JR755YPPA/graph.json","events_json":"https://pith.science/api/pith-number/6SLIU65YJV2JKH2Y5JR755YPPA/events.json","paper":"https://pith.science/paper/6SLIU65Y"},"agent_actions":{"view_html":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA","download_json":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA.json","view_paper":"https://pith.science/paper/6SLIU65Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6303&json=true","fetch_graph":"https://pith.science/api/pith-number/6SLIU65YJV2JKH2Y5JR755YPPA/graph.json","fetch_events":"https://pith.science/api/pith-number/6SLIU65YJV2JKH2Y5JR755YPPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA/action/storage_attestation","attest_author":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA/action/author_attestation","sign_citation":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA/action/citation_signature","submit_replication":"https://pith.science/pith/6SLIU65YJV2JKH2Y5JR755YPPA/action/replication_record"}},"created_at":"2026-05-18T04:01:13.735964+00:00","updated_at":"2026-05-18T04:01:13.735964+00:00"}