{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IEVL6GPAZQTKYZHN3RJARJK5AU","short_pith_number":"pith:IEVL6GPA","canonical_record":{"source":{"id":"2112.04022","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-07T22:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"4a7ed26a3ccb9ec505738da88728ffb2ddb6cfeb2c3fb4d363303185b56a75e8","abstract_canon_sha256":"cb844512ac72040e96608cd005e057aa7e00c6552748d2eaf00cba854e847470"},"schema_version":"1.0"},"canonical_sha256":"412abf19e0cc26ac64eddc5208a55d05389053e0dae85b0123194f263450ecd9","source":{"kind":"arxiv","id":"2112.04022","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04022","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04022v2","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04022","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"IEVL6GPAZQTK","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"IEVL6GPAZQTKYZHN","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"IEVL6GPA","created_at":"2026-07-05T03:56:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IEVL6GPAZQTKYZHN3RJARJK5AU","target":"record","payload":{"canonical_record":{"source":{"id":"2112.04022","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-07T22:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"4a7ed26a3ccb9ec505738da88728ffb2ddb6cfeb2c3fb4d363303185b56a75e8","abstract_canon_sha256":"cb844512ac72040e96608cd005e057aa7e00c6552748d2eaf00cba854e847470"},"schema_version":"1.0"},"canonical_sha256":"412abf19e0cc26ac64eddc5208a55d05389053e0dae85b0123194f263450ecd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:32.943162Z","signature_b64":"UNJp2usI2T8iKHNqbdRoV6n3s2dQz5qu9kjluGvUUuWzk8y7bnsalRSKjLdAgeSfJxUCWR2g2DQ03w7I3G1oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412abf19e0cc26ac64eddc5208a55d05389053e0dae85b0123194f263450ecd9","last_reissued_at":"2026-07-05T03:56:32.942751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:32.942751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.04022","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVR1meNTgeWzdwmO4joUyDhVpPVuY/5FVQQiipyz8tXuKdNdxJZMIseRhUeWFSS4kQ8sDbM+d2GQvGcJDqEiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:04:41.475569Z"},"content_sha256":"123c50adffafb0b45dd88bbd11acef6da919de57ece29b481a4c2412783100ae","schema_version":"1.0","event_id":"sha256:123c50adffafb0b45dd88bbd11acef6da919de57ece29b481a4c2412783100ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IEVL6GPAZQTKYZHN3RJARJK5AU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The resource cost of large scale quantum computing","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marco Fellous-Asiani","submitted_at":"2021-12-07T22:27:12Z","abstract_excerpt":"This thesis deals with the problematics of the scalability of fault-tolerant quantum computing. This question is studied under the angle of estimating the resources needed to set up such computers. What we call a resource is, in principle, very general; it could be the power, the energy, the total bandwidth allocated to the different qubits... However, we mainly focus on the energetic cost of quantum computing. In particular, we develop an inter-disciplinary approach that allows to minimize the resources required to implement algorithms on quantum computers. By asking to find the minimum amoun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.04022/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcrZweANW9DSt470A2iQVP/apCCbtGXvt1maFKNA+OJa8uGpQt7H04gUcqnz8nZZJI1m5QM5tWQmHvQsNUswCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:04:41.476087Z"},"content_sha256":"30b8de3e5fc96b8990cb592d09256141f58b4f9d14b1ad2b1f71a54ca81005b3","schema_version":"1.0","event_id":"sha256:30b8de3e5fc96b8990cb592d09256141f58b4f9d14b1ad2b1f71a54ca81005b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/bundle.json","state_url":"https://pith.science/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T14:04:41Z","links":{"resolver":"https://pith.science/pith/IEVL6GPAZQTKYZHN3RJARJK5AU","bundle":"https://pith.science/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/bundle.json","state":"https://pith.science/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEVL6GPAZQTKYZHN3RJARJK5AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IEVL6GPAZQTKYZHN3RJARJK5AU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb844512ac72040e96608cd005e057aa7e00c6552748d2eaf00cba854e847470","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-07T22:27:12Z","title_canon_sha256":"4a7ed26a3ccb9ec505738da88728ffb2ddb6cfeb2c3fb4d363303185b56a75e8"},"schema_version":"1.0","source":{"id":"2112.04022","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04022","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04022v2","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04022","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"IEVL6GPAZQTK","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"IEVL6GPAZQTKYZHN","created_at":"2026-07-05T03:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"IEVL6GPA","created_at":"2026-07-05T03:56:32Z"}],"graph_snapshots":[{"event_id":"sha256:30b8de3e5fc96b8990cb592d09256141f58b4f9d14b1ad2b1f71a54ca81005b3","target":"graph","created_at":"2026-07-05T03:56:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.04022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This thesis deals with the problematics of the scalability of fault-tolerant quantum computing. This question is studied under the angle of estimating the resources needed to set up such computers. What we call a resource is, in principle, very general; it could be the power, the energy, the total bandwidth allocated to the different qubits... However, we mainly focus on the energetic cost of quantum computing. In particular, we develop an inter-disciplinary approach that allows to minimize the resources required to implement algorithms on quantum computers. By asking to find the minimum amoun","authors_text":"Marco Fellous-Asiani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-07T22:27:12Z","title":"The resource cost of large scale quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04022","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:123c50adffafb0b45dd88bbd11acef6da919de57ece29b481a4c2412783100ae","target":"record","created_at":"2026-07-05T03:56:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb844512ac72040e96608cd005e057aa7e00c6552748d2eaf00cba854e847470","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-07T22:27:12Z","title_canon_sha256":"4a7ed26a3ccb9ec505738da88728ffb2ddb6cfeb2c3fb4d363303185b56a75e8"},"schema_version":"1.0","source":{"id":"2112.04022","kind":"arxiv","version":2}},"canonical_sha256":"412abf19e0cc26ac64eddc5208a55d05389053e0dae85b0123194f263450ecd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"412abf19e0cc26ac64eddc5208a55d05389053e0dae85b0123194f263450ecd9","first_computed_at":"2026-07-05T03:56:32.942751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:32.942751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UNJp2usI2T8iKHNqbdRoV6n3s2dQz5qu9kjluGvUUuWzk8y7bnsalRSKjLdAgeSfJxUCWR2g2DQ03w7I3G1oAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:32.943162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.04022","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:123c50adffafb0b45dd88bbd11acef6da919de57ece29b481a4c2412783100ae","sha256:30b8de3e5fc96b8990cb592d09256141f58b4f9d14b1ad2b1f71a54ca81005b3"],"state_sha256":"36aef60395834937b712cdf2549955a87dc72568f48b00d923f843c6897b4078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSCWzz0Lxqo5sT2ECs5/pQuI6/Vy7M1Mp8Uq1WkeEiro9/w/PiudjyMN5rSxckB9Ua0L+kIrDR87WSpqOCo4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:04:41.483001Z","bundle_sha256":"23d1519148254ec3193671bc50778d897b2973320427f8153ba4a6dd10ac0327"}}