{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZIE3IQY45UT4EV5IBP5533D7E5","short_pith_number":"pith:ZIE3IQY4","canonical_record":{"source":{"id":"2410.08995","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"a2b1cafcf44e53053880a3b8a7c5dbaf8e97806779068aec1761841d6065ccbd","abstract_canon_sha256":"c768d6d70aed816c70c5a7b6762acdae597ca052b45da9962fbf08868c198c0d"},"schema_version":"1.0"},"canonical_sha256":"ca09b4431ced27c257a80bfbddec7f2742b3070b448bcde70ab37ddb4806296e","source":{"kind":"arxiv","id":"2410.08995","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08995","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08995v3","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08995","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZIE3IQY45UT4","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_16","alias_value":"ZIE3IQY45UT4EV5I","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_8","alias_value":"ZIE3IQY4","created_at":"2026-07-05T11:20:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZIE3IQY45UT4EV5IBP5533D7E5","target":"record","payload":{"canonical_record":{"source":{"id":"2410.08995","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"a2b1cafcf44e53053880a3b8a7c5dbaf8e97806779068aec1761841d6065ccbd","abstract_canon_sha256":"c768d6d70aed816c70c5a7b6762acdae597ca052b45da9962fbf08868c198c0d"},"schema_version":"1.0"},"canonical_sha256":"ca09b4431ced27c257a80bfbddec7f2742b3070b448bcde70ab37ddb4806296e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:05.680365Z","signature_b64":"8xuJgeoFl17HIrgc13Co0jzZVS3ce+bAfCokIKjeDyYaDwfSiji12IYqpGioTGujzLqo/EJI5gcOW7isxcqqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca09b4431ced27c257a80bfbddec7f2742b3070b448bcde70ab37ddb4806296e","last_reissued_at":"2026-07-05T11:20:05.679845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:05.679845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.08995","source_version":3,"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-05T11:20:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKZ8BtqBXnD+yy5xKyJnptTLAdm3CcVzAMEciv8l7lDR4SFTv+vgJrQVqTjROWUZ9A0XGrN2LU3myJwbu2FZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T18:36:52.797146Z"},"content_sha256":"c7553fa54fbc85b661d11dd637ec4dc7650d6ebed68bdcc54160050e7bd576ce","schema_version":"1.0","event_id":"sha256:c7553fa54fbc85b661d11dd637ec4dc7650d6ebed68bdcc54160050e7bd576ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZIE3IQY45UT4EV5IBP5533D7E5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S\\'ebastien Perseguers","submitted_at":"2024-10-11T17:08:49Z","abstract_excerpt":"We propose a numerical approach to design highly efficient adiabatic schedules for analog quantum computing, focusing on the maximum-independent-set problem and neutral atom platforms. On the basis of a representative dataset of small graphs, we present numerical evidence that the optimum schedules depend principally on the hardness of the problem rather than on its size. These schedules perform better than the benchmark protocols and admit a straightforward implementation in the hardware. This allows us to extrapolate the results to larger graphs and to successfully solve moderately hard prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08995","kind":"arxiv","version":3},"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/2410.08995/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-05T11:20:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9O9yt5Rnr9om2myZyLx7zAzgUZdQlYio5jCUhwN4jSMsJKq33P4qE1Hn1V65ubRg+qYjB/DqlTdYLnUIqkHCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T18:36:52.797672Z"},"content_sha256":"247bcbd5384a96313caa2f18b14144778eb09fb37116be4264fa5a254bfa1dd0","schema_version":"1.0","event_id":"sha256:247bcbd5384a96313caa2f18b14144778eb09fb37116be4264fa5a254bfa1dd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIE3IQY45UT4EV5IBP5533D7E5/bundle.json","state_url":"https://pith.science/pith/ZIE3IQY45UT4EV5IBP5533D7E5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIE3IQY45UT4EV5IBP5533D7E5/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-15T18:36:52Z","links":{"resolver":"https://pith.science/pith/ZIE3IQY45UT4EV5IBP5533D7E5","bundle":"https://pith.science/pith/ZIE3IQY45UT4EV5IBP5533D7E5/bundle.json","state":"https://pith.science/pith/ZIE3IQY45UT4EV5IBP5533D7E5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIE3IQY45UT4EV5IBP5533D7E5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZIE3IQY45UT4EV5IBP5533D7E5","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":"c768d6d70aed816c70c5a7b6762acdae597ca052b45da9962fbf08868c198c0d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:08:49Z","title_canon_sha256":"a2b1cafcf44e53053880a3b8a7c5dbaf8e97806779068aec1761841d6065ccbd"},"schema_version":"1.0","source":{"id":"2410.08995","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08995","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08995v3","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08995","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZIE3IQY45UT4","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_16","alias_value":"ZIE3IQY45UT4EV5I","created_at":"2026-07-05T11:20:05Z"},{"alias_kind":"pith_short_8","alias_value":"ZIE3IQY4","created_at":"2026-07-05T11:20:05Z"}],"graph_snapshots":[{"event_id":"sha256:247bcbd5384a96313caa2f18b14144778eb09fb37116be4264fa5a254bfa1dd0","target":"graph","created_at":"2026-07-05T11:20:05Z","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/2410.08995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a numerical approach to design highly efficient adiabatic schedules for analog quantum computing, focusing on the maximum-independent-set problem and neutral atom platforms. On the basis of a representative dataset of small graphs, we present numerical evidence that the optimum schedules depend principally on the hardness of the problem rather than on its size. These schedules perform better than the benchmark protocols and admit a straightforward implementation in the hardware. This allows us to extrapolate the results to larger graphs and to successfully solve moderately hard prob","authors_text":"S\\'ebastien Perseguers","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:08:49Z","title":"Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08995","kind":"arxiv","version":3},"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:c7553fa54fbc85b661d11dd637ec4dc7650d6ebed68bdcc54160050e7bd576ce","target":"record","created_at":"2026-07-05T11:20:05Z","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":"c768d6d70aed816c70c5a7b6762acdae597ca052b45da9962fbf08868c198c0d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:08:49Z","title_canon_sha256":"a2b1cafcf44e53053880a3b8a7c5dbaf8e97806779068aec1761841d6065ccbd"},"schema_version":"1.0","source":{"id":"2410.08995","kind":"arxiv","version":3}},"canonical_sha256":"ca09b4431ced27c257a80bfbddec7f2742b3070b448bcde70ab37ddb4806296e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca09b4431ced27c257a80bfbddec7f2742b3070b448bcde70ab37ddb4806296e","first_computed_at":"2026-07-05T11:20:05.679845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:05.679845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8xuJgeoFl17HIrgc13Co0jzZVS3ce+bAfCokIKjeDyYaDwfSiji12IYqpGioTGujzLqo/EJI5gcOW7isxcqqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:05.680365Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.08995","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7553fa54fbc85b661d11dd637ec4dc7650d6ebed68bdcc54160050e7bd576ce","sha256:247bcbd5384a96313caa2f18b14144778eb09fb37116be4264fa5a254bfa1dd0"],"state_sha256":"0cc407767e955d720a87529caf8b74aeaa899fda6c73744e373cce8e8ec801d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHXBRMCRvVIVFRQLbghwag21is7C+sG8HHpOiROJzZT/O4At1LeUiZXqEgkxZUrcPN4hMLHjdN3SwhcPQ//IBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T18:36:52.802172Z","bundle_sha256":"089aa97180f16cedbfb6cea89124aac9c6b4909c6e377f3c6f45d31cc8bbf392"}}