{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JNPWBJNISW5H6SBJO4FQ6HCJ5X","short_pith_number":"pith:JNPWBJNI","canonical_record":{"source":{"id":"2412.17309","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-23T06:04:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1d5f50a90a0aef9bd00a069a9f54fdb0abf781cf7444b009e55f77562cc3f271","abstract_canon_sha256":"05452606660d061a074318bd07d8ccb16bc13d8bfdd13cb4cae15cab5f86c3a5"},"schema_version":"1.0"},"canonical_sha256":"4b5f60a5a895ba7f4829770b0f1c49edfb979e688d7fc3d2b88993b6538bf491","source":{"kind":"arxiv","id":"2412.17309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17309","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17309v1","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17309","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"JNPWBJNISW5H","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"JNPWBJNISW5H6SBJ","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"JNPWBJNI","created_at":"2026-07-05T09:53:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JNPWBJNISW5H6SBJO4FQ6HCJ5X","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17309","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-23T06:04:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1d5f50a90a0aef9bd00a069a9f54fdb0abf781cf7444b009e55f77562cc3f271","abstract_canon_sha256":"05452606660d061a074318bd07d8ccb16bc13d8bfdd13cb4cae15cab5f86c3a5"},"schema_version":"1.0"},"canonical_sha256":"4b5f60a5a895ba7f4829770b0f1c49edfb979e688d7fc3d2b88993b6538bf491","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:20.620066Z","signature_b64":"xotoCfAvktxqgDqg0Luwl1rrEmyCPrXOIv9Qd9vozh/n5YkgkLIcSXqTRxxC04AceQOalMN5dVSjNEi+XHq7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b5f60a5a895ba7f4829770b0f1c49edfb979e688d7fc3d2b88993b6538bf491","last_reissued_at":"2026-07-05T09:53:20.619635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:20.619635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17309","source_version":1,"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-05T09:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NO237z8OneB6VN3vP0eZyecIKWU9easSQfa0gZ2FLEKupdxWZUKB/xY8b5BfWmVVdkYV/4mHOBEd5v4t0cpbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:22:14.581154Z"},"content_sha256":"6fcbb1efe7b53d16f4217ed2721224acedba9b9d9be9f0940d8341d55d9c5058","schema_version":"1.0","event_id":"sha256:6fcbb1efe7b53d16f4217ed2721224acedba9b9d9be9f0940d8341d55d9c5058"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JNPWBJNISW5H6SBJO4FQ6HCJ5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Approximate Optimisation Applied to Graph Similarity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Nicholas J. Pritchard","submitted_at":"2024-12-23T06:04:08Z","abstract_excerpt":"Quantum computing promises solutions to classically difficult and new-found problems through controlling the subtleties of quantum computing. The Quantum Approximate Optimisation Algorithm (QAOA) is a recently proposed quantum algorithm designed to tackle difficult combinatorial optimisation problems utilising both quantum and classical computation. The hybrid nature, generality and typically low gate-depth make it a strong candidate for near-term implementation in quantum computing. Finding the practical limits of the algorithm is currently an open problem. Until now, no tools to facilitate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17309","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/2412.17309/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-05T09:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZhbU6bBQZmKYbWBAFUjuVw276fVGs6L9BYv8soKGsmv9QmQYjjuEuGlX4IwRf8aZR8ojClU1LgmOPgWUxhWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:22:14.581839Z"},"content_sha256":"354ca43bd9d3c3e8a6a39b0499e3b65ad06559aef7073d487337c8e584f51210","schema_version":"1.0","event_id":"sha256:354ca43bd9d3c3e8a6a39b0499e3b65ad06559aef7073d487337c8e584f51210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/bundle.json","state_url":"https://pith.science/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/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-14T23:22:14Z","links":{"resolver":"https://pith.science/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X","bundle":"https://pith.science/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/bundle.json","state":"https://pith.science/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNPWBJNISW5H6SBJO4FQ6HCJ5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JNPWBJNISW5H6SBJO4FQ6HCJ5X","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":"05452606660d061a074318bd07d8ccb16bc13d8bfdd13cb4cae15cab5f86c3a5","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-23T06:04:08Z","title_canon_sha256":"1d5f50a90a0aef9bd00a069a9f54fdb0abf781cf7444b009e55f77562cc3f271"},"schema_version":"1.0","source":{"id":"2412.17309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17309","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17309v1","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17309","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"JNPWBJNISW5H","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"JNPWBJNISW5H6SBJ","created_at":"2026-07-05T09:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"JNPWBJNI","created_at":"2026-07-05T09:53:20Z"}],"graph_snapshots":[{"event_id":"sha256:354ca43bd9d3c3e8a6a39b0499e3b65ad06559aef7073d487337c8e584f51210","target":"graph","created_at":"2026-07-05T09:53:20Z","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/2412.17309/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing promises solutions to classically difficult and new-found problems through controlling the subtleties of quantum computing. The Quantum Approximate Optimisation Algorithm (QAOA) is a recently proposed quantum algorithm designed to tackle difficult combinatorial optimisation problems utilising both quantum and classical computation. The hybrid nature, generality and typically low gate-depth make it a strong candidate for near-term implementation in quantum computing. Finding the practical limits of the algorithm is currently an open problem. Until now, no tools to facilitate t","authors_text":"Nicholas J. Pritchard","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17309","kind":"arxiv","version":1},"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:6fcbb1efe7b53d16f4217ed2721224acedba9b9d9be9f0940d8341d55d9c5058","target":"record","created_at":"2026-07-05T09:53:20Z","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":"05452606660d061a074318bd07d8ccb16bc13d8bfdd13cb4cae15cab5f86c3a5","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-23T06:04:08Z","title_canon_sha256":"1d5f50a90a0aef9bd00a069a9f54fdb0abf781cf7444b009e55f77562cc3f271"},"schema_version":"1.0","source":{"id":"2412.17309","kind":"arxiv","version":1}},"canonical_sha256":"4b5f60a5a895ba7f4829770b0f1c49edfb979e688d7fc3d2b88993b6538bf491","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b5f60a5a895ba7f4829770b0f1c49edfb979e688d7fc3d2b88993b6538bf491","first_computed_at":"2026-07-05T09:53:20.619635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:20.619635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xotoCfAvktxqgDqg0Luwl1rrEmyCPrXOIv9Qd9vozh/n5YkgkLIcSXqTRxxC04AceQOalMN5dVSjNEi+XHq7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:20.620066Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fcbb1efe7b53d16f4217ed2721224acedba9b9d9be9f0940d8341d55d9c5058","sha256:354ca43bd9d3c3e8a6a39b0499e3b65ad06559aef7073d487337c8e584f51210"],"state_sha256":"2afcca27614d019b8b2d8c2073f529e3f2492dc423b90bce3f71ad16e508dec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgPdEwJGz0Pemeb2xLxEYHbtTVCIf2NtIxDqqgI6dKuTLrpwVqyyNke+K7q+bwby/KDUNp7ASftFIAxG6TyqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T23:22:14.587956Z","bundle_sha256":"4f7b9f4dff2d921bdf6d322f8c03700c7b48122e8ebca9c4086af80e03b1168e"}}