{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I7C3RTQCZEXEVALU333HPHCF7H","short_pith_number":"pith:I7C3RTQC","schema_version":"1.0","canonical_sha256":"47c5b8ce02c92e4a8174def6779c45f9df7699b2aa664475a329f08bb5b85724","source":{"kind":"arxiv","id":"1210.6715","version":7},"attestation_state":"computed","paper":{"title":"Suggestion on Quantum Computer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Helio V. Fagundes","submitted_at":"2012-10-25T01:17:09Z","abstract_excerpt":"For quantum computer circuits, it is proposed that they have, besides the presently used compact graphs, an expanded system of subgraphs, in line with the quantum mechanics superposition axiom. The representation of each process by these suggested graphs is equivalent to the algebraic notation of the process."},"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":"1210.6715","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-25T01:17:09Z","cross_cats_sorted":[],"title_canon_sha256":"8efd136f98a16c1b0ea63802e984b0eed7884789715f3bfcbae276e66ec92071","abstract_canon_sha256":"b7805aa31ce3ba8382a1cfae94da7a900819bd7aa6c67b74e4f8c67f19f52222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:47.034896Z","signature_b64":"p4kyJQWCDG1HO1FaBPhZ2WKZXnIFoHFdZiGQdgmSiyPr90g2TT4dnu3+4Yuop5yLo7u2h9GY9tvzSCDl39kGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47c5b8ce02c92e4a8174def6779c45f9df7699b2aa664475a329f08bb5b85724","last_reissued_at":"2026-05-18T03:11:47.034194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:47.034194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Suggestion on Quantum Computer Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Helio V. Fagundes","submitted_at":"2012-10-25T01:17:09Z","abstract_excerpt":"For quantum computer circuits, it is proposed that they have, besides the presently used compact graphs, an expanded system of subgraphs, in line with the quantum mechanics superposition axiom. The representation of each process by these suggested graphs is equivalent to the algebraic notation of the process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6715","kind":"arxiv","version":7},"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":"1210.6715","created_at":"2026-05-18T03:11:47.034290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6715v7","created_at":"2026-05-18T03:11:47.034290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6715","created_at":"2026-05-18T03:11:47.034290+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7C3RTQCZEXE","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7C3RTQCZEXEVALU","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7C3RTQC","created_at":"2026-05-18T12:27:09.501522+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/I7C3RTQCZEXEVALU333HPHCF7H","json":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H.json","graph_json":"https://pith.science/api/pith-number/I7C3RTQCZEXEVALU333HPHCF7H/graph.json","events_json":"https://pith.science/api/pith-number/I7C3RTQCZEXEVALU333HPHCF7H/events.json","paper":"https://pith.science/paper/I7C3RTQC"},"agent_actions":{"view_html":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H","download_json":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H.json","view_paper":"https://pith.science/paper/I7C3RTQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6715&json=true","fetch_graph":"https://pith.science/api/pith-number/I7C3RTQCZEXEVALU333HPHCF7H/graph.json","fetch_events":"https://pith.science/api/pith-number/I7C3RTQCZEXEVALU333HPHCF7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H/action/storage_attestation","attest_author":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H/action/author_attestation","sign_citation":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H/action/citation_signature","submit_replication":"https://pith.science/pith/I7C3RTQCZEXEVALU333HPHCF7H/action/replication_record"}},"created_at":"2026-05-18T03:11:47.034290+00:00","updated_at":"2026-05-18T03:11:47.034290+00:00"}