{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E5IULWNJJ5SQJ3LOIQRJKJQBMM","short_pith_number":"pith:E5IULWNJ","schema_version":"1.0","canonical_sha256":"275145d9a94f6504ed6e4422952601630706c026f64e64bcce644ad3155676e0","source":{"kind":"arxiv","id":"1412.3817","version":2},"attestation_state":"computed","paper":{"title":"An efficient quantum algorithm for the Moebius function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter J. Love","submitted_at":"2014-12-11T21:01:30Z","abstract_excerpt":"We give an efficient quantum algorithm for the Moebius function $\\mu(n)$ from the natural numbers to $\\{-1,0,1\\}$. The cost of the algorithm is asymptotically quadratic in $\\log n$ and does not require the computation of the prime factorization of $n$ as an intermediate step."},"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":"1412.3817","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-11T21:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"d4c56a1ff9bb7b74fbd3202a56d9d3a1a461acaeeae4f9fca4d04b5a2d0a2b1b","abstract_canon_sha256":"a8334ac19e39b0c8ba2fb0aba9d2f84371d1b1155c62741df99497315ddeb517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.824453Z","signature_b64":"8oPxH76Wy/gCuRWn0QuZSG4bZh5rBGyrb+59QjzdBft/zS1K3XDCcIrts2Jv1Nyaqo4L+FWWAu8g+27KWj+MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"275145d9a94f6504ed6e4422952601630706c026f64e64bcce644ad3155676e0","last_reissued_at":"2026-05-18T01:18:52.823743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.823743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient quantum algorithm for the Moebius function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter J. Love","submitted_at":"2014-12-11T21:01:30Z","abstract_excerpt":"We give an efficient quantum algorithm for the Moebius function $\\mu(n)$ from the natural numbers to $\\{-1,0,1\\}$. The cost of the algorithm is asymptotically quadratic in $\\log n$ and does not require the computation of the prime factorization of $n$ as an intermediate step."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3817","kind":"arxiv","version":2},"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":"1412.3817","created_at":"2026-05-18T01:18:52.823862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3817v2","created_at":"2026-05-18T01:18:52.823862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3817","created_at":"2026-05-18T01:18:52.823862+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5IULWNJJ5SQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5IULWNJJ5SQJ3LO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5IULWNJ","created_at":"2026-05-18T12:28:25.294606+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/E5IULWNJJ5SQJ3LOIQRJKJQBMM","json":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM.json","graph_json":"https://pith.science/api/pith-number/E5IULWNJJ5SQJ3LOIQRJKJQBMM/graph.json","events_json":"https://pith.science/api/pith-number/E5IULWNJJ5SQJ3LOIQRJKJQBMM/events.json","paper":"https://pith.science/paper/E5IULWNJ"},"agent_actions":{"view_html":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM","download_json":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM.json","view_paper":"https://pith.science/paper/E5IULWNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3817&json=true","fetch_graph":"https://pith.science/api/pith-number/E5IULWNJJ5SQJ3LOIQRJKJQBMM/graph.json","fetch_events":"https://pith.science/api/pith-number/E5IULWNJJ5SQJ3LOIQRJKJQBMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM/action/storage_attestation","attest_author":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM/action/author_attestation","sign_citation":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM/action/citation_signature","submit_replication":"https://pith.science/pith/E5IULWNJJ5SQJ3LOIQRJKJQBMM/action/replication_record"}},"created_at":"2026-05-18T01:18:52.823862+00:00","updated_at":"2026-05-18T01:18:52.823862+00:00"}