{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KDHFEA4GQVCEKR4VJLR3DHMNGL","short_pith_number":"pith:KDHFEA4G","schema_version":"1.0","canonical_sha256":"50ce52038685444547954ae3b19d8d32ca20f418cfb1c0bbde8c8627565f665a","source":{"kind":"arxiv","id":"2008.10647","version":1},"attestation_state":"computed","paper":{"title":"Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit Continued","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2020-08-24T18:37:24Z","abstract_excerpt":"With the increasing rise of publicly available high level quantum computing languages, the field of Quantum Computing has reached an important milestone of separation of software from hardware. Consequently, the study of Quantum Algorithms is beginning to emerge as university courses and disciplines around the world, spanning physics, math, and computer science departments alike. As a continuation to its predecessor: \"Introduction to Coding Quantum Algorithms: A Tutorial Series Using Qiskit\", this tutorial series aims to help understand several of the most promising quantum algorithms to date,"},"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":"2008.10647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-24T18:37:24Z","cross_cats_sorted":[],"title_canon_sha256":"8a6784794268c1d38e9baf2f12e353a4476c37f3a674812b32f36fa88973ad3f","abstract_canon_sha256":"b4be016df7404eebadb103ed0f6c31a60855af12af36d222ee16ad00b2b0d699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:28.793600Z","signature_b64":"h6M+NS+TMWnYMTwv0MlTu8absNUaJLFMWSxCv4PcAN5g0vOIDHA+TmN4gsqKevbQhLy62Mzo3EKBToEHh3l8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ce52038685444547954ae3b19d8d32ca20f418cfb1c0bbde8c8627565f665a","last_reissued_at":"2026-07-05T01:29:28.793176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:28.793176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit Continued","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2020-08-24T18:37:24Z","abstract_excerpt":"With the increasing rise of publicly available high level quantum computing languages, the field of Quantum Computing has reached an important milestone of separation of software from hardware. Consequently, the study of Quantum Algorithms is beginning to emerge as university courses and disciplines around the world, spanning physics, math, and computer science departments alike. As a continuation to its predecessor: \"Introduction to Coding Quantum Algorithms: A Tutorial Series Using Qiskit\", this tutorial series aims to help understand several of the most promising quantum algorithms to date,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.10647","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/2008.10647/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":"2008.10647","created_at":"2026-07-05T01:29:28.793233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.10647v1","created_at":"2026-07-05T01:29:28.793233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.10647","created_at":"2026-07-05T01:29:28.793233+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDHFEA4GQVCE","created_at":"2026-07-05T01:29:28.793233+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDHFEA4GQVCEKR4V","created_at":"2026-07-05T01:29:28.793233+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDHFEA4G","created_at":"2026-07-05T01:29:28.793233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.11060","citing_title":"PCA and t-SNE analysis in the study of QAOA entangled and non-entangled mixing operators","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL","json":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL.json","graph_json":"https://pith.science/api/pith-number/KDHFEA4GQVCEKR4VJLR3DHMNGL/graph.json","events_json":"https://pith.science/api/pith-number/KDHFEA4GQVCEKR4VJLR3DHMNGL/events.json","paper":"https://pith.science/paper/KDHFEA4G"},"agent_actions":{"view_html":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL","download_json":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL.json","view_paper":"https://pith.science/paper/KDHFEA4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.10647&json=true","fetch_graph":"https://pith.science/api/pith-number/KDHFEA4GQVCEKR4VJLR3DHMNGL/graph.json","fetch_events":"https://pith.science/api/pith-number/KDHFEA4GQVCEKR4VJLR3DHMNGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL/action/storage_attestation","attest_author":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL/action/author_attestation","sign_citation":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL/action/citation_signature","submit_replication":"https://pith.science/pith/KDHFEA4GQVCEKR4VJLR3DHMNGL/action/replication_record"}},"created_at":"2026-07-05T01:29:28.793233+00:00","updated_at":"2026-07-05T01:29:28.793233+00:00"}