{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DMMS5Q2V7S6UZJ3QD7DUJICDM6","short_pith_number":"pith:DMMS5Q2V","canonical_record":{"source":{"id":"1205.1148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-05T16:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"1fbbca41a5fe6d547e98c9501e3468c890bd91927a0a36bcf855fb024a4cb253","abstract_canon_sha256":"b35190cf146b27c6c3ff5a55ec2aa2e8fafb79831fc120ffd1c8b2560b4f48c1"},"schema_version":"1.0"},"canonical_sha256":"1b192ec355fcbd4ca7701fc744a0436784f7c13ff82b6437ce5418131f257f2a","source":{"kind":"arxiv","id":"1205.1148","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1148","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1148v2","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1148","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"DMMS5Q2V7S6U","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DMMS5Q2V7S6UZJ3Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DMMS5Q2V","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DMMS5Q2V7S6UZJ3QD7DUJICDM6","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-05T16:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"1fbbca41a5fe6d547e98c9501e3468c890bd91927a0a36bcf855fb024a4cb253","abstract_canon_sha256":"b35190cf146b27c6c3ff5a55ec2aa2e8fafb79831fc120ffd1c8b2560b4f48c1"},"schema_version":"1.0"},"canonical_sha256":"1b192ec355fcbd4ca7701fc744a0436784f7c13ff82b6437ce5418131f257f2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:38.894584Z","signature_b64":"5Zo18NR1h1YiHfdaVCNFU+G1klvQil/eoKpJocX/8ZE00kK80Xkr/fP/k/hqO+/7D1eJIrU+u8ZPUI51NwzMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b192ec355fcbd4ca7701fc744a0436784f7c13ff82b6437ce5418131f257f2a","last_reissued_at":"2026-05-18T03:54:38.893819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:38.893819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1148","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-05-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrEpuy94GAn5qewIClYkm91M2UrtVkQaTsh+Z577vp7np8oqCQXpX2YnuZW8W/DUXPYtAerDMX1Kxnr7VBFlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:04:17.928496Z"},"content_sha256":"60873a9e43cee2c77fb883f03c3ec1676d6cb1d36f0832dba59c0b18fa155f2e","schema_version":"1.0","event_id":"sha256:60873a9e43cee2c77fb883f03c3ec1676d6cb1d36f0832dba59c0b18fa155f2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DMMS5Q2V7S6UZJ3QD7DUJICDM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Classification with Adiabatic Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, Nan Ding, S. V. N. Vishwanathan, Vasil S. Denchev","submitted_at":"2012-05-05T16:38:06Z","abstract_excerpt":"We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resulting problem by adiabatic quantum optimization. Two requirements are imposed by the engineering constraints of existing quantum hardware: training problems are formulated as quadratic unconstrained binary optimization; and model parameters are represented as binary expansions of low bit-depth. In the present work we validate this approach by using a heuristic classical solver as a stand-in for quantum hardware. Testi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1148","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":""},"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-05-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V07VVXlfi6XSoDA2/Wa6+44wK6iR1OtoYYbt7b6xs8md8gdJTvh25J0t5QSY35g2VLEQkv5grPisFMHMhTTyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:04:17.929085Z"},"content_sha256":"a2fa1c0ca3b09a9a0d899ac670e3d302b1152d2044d60486248b3869d9e29bb1","schema_version":"1.0","event_id":"sha256:a2fa1c0ca3b09a9a0d899ac670e3d302b1152d2044d60486248b3869d9e29bb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/bundle.json","state_url":"https://pith.science/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/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-06-07T10:04:17Z","links":{"resolver":"https://pith.science/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6","bundle":"https://pith.science/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/bundle.json","state":"https://pith.science/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMMS5Q2V7S6UZJ3QD7DUJICDM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DMMS5Q2V7S6UZJ3QD7DUJICDM6","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":"b35190cf146b27c6c3ff5a55ec2aa2e8fafb79831fc120ffd1c8b2560b4f48c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-05T16:38:06Z","title_canon_sha256":"1fbbca41a5fe6d547e98c9501e3468c890bd91927a0a36bcf855fb024a4cb253"},"schema_version":"1.0","source":{"id":"1205.1148","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1148","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1148v2","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1148","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"DMMS5Q2V7S6U","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DMMS5Q2V7S6UZJ3Q","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DMMS5Q2V","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:a2fa1c0ca3b09a9a0d899ac670e3d302b1152d2044d60486248b3869d9e29bb1","target":"graph","created_at":"2026-05-18T03:54:38Z","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"},"paper":{"abstract_excerpt":"We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resulting problem by adiabatic quantum optimization. Two requirements are imposed by the engineering constraints of existing quantum hardware: training problems are formulated as quadratic unconstrained binary optimization; and model parameters are represented as binary expansions of low bit-depth. In the present work we validate this approach by using a heuristic classical solver as a stand-in for quantum hardware. Testi","authors_text":"Hartmut Neven, Nan Ding, S. V. N. Vishwanathan, Vasil S. Denchev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-05T16:38:06Z","title":"Robust Classification with Adiabatic Quantum Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1148","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:60873a9e43cee2c77fb883f03c3ec1676d6cb1d36f0832dba59c0b18fa155f2e","target":"record","created_at":"2026-05-18T03:54:38Z","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":"b35190cf146b27c6c3ff5a55ec2aa2e8fafb79831fc120ffd1c8b2560b4f48c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-05T16:38:06Z","title_canon_sha256":"1fbbca41a5fe6d547e98c9501e3468c890bd91927a0a36bcf855fb024a4cb253"},"schema_version":"1.0","source":{"id":"1205.1148","kind":"arxiv","version":2}},"canonical_sha256":"1b192ec355fcbd4ca7701fc744a0436784f7c13ff82b6437ce5418131f257f2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b192ec355fcbd4ca7701fc744a0436784f7c13ff82b6437ce5418131f257f2a","first_computed_at":"2026-05-18T03:54:38.893819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:38.893819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Zo18NR1h1YiHfdaVCNFU+G1klvQil/eoKpJocX/8ZE00kK80Xkr/fP/k/hqO+/7D1eJIrU+u8ZPUI51NwzMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:38.894584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1148","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60873a9e43cee2c77fb883f03c3ec1676d6cb1d36f0832dba59c0b18fa155f2e","sha256:a2fa1c0ca3b09a9a0d899ac670e3d302b1152d2044d60486248b3869d9e29bb1"],"state_sha256":"7935163e91fad75e63188d42c44f6441aff8b0ba7bbd7f44a1c1881f222329ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKQREl82ukwucJXiThROe9VROz5arGyTqdoVuVmHsP+iwJmfC5hm7Gl6zAJGErNxY5BqEAY+jUV9UGYwCmj1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:04:17.932379Z","bundle_sha256":"b5ad3cd92b315264a45e1fadea679d646895d2cb5a682ca4c99149603898cddb"}}