{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","short_pith_number":"pith:KYQEXSJ3","canonical_record":{"source":{"id":"2608.04645","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-05T10:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"481a3f1cbadb3910a0abc42c1bd4261fb69e454ed124f33ac2193f5f85edb8f3","abstract_canon_sha256":"6532493d84b26f94640ad4858b533ce60448cf68a4efc3a0687b213bcc3dc76a"},"schema_version":"1.0"},"canonical_sha256":"56204bc93b81433fe9f8c33668dd856dbec6daff43e9a5d31490e92d771a03f9","source":{"kind":"arxiv","id":"2608.04645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04645","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04645v1","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04645","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_12","alias_value":"KYQEXSJ3QFBT","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_16","alias_value":"KYQEXSJ3QFBT72PY","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_8","alias_value":"KYQEXSJ3","created_at":"2026-08-06T01:36:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04645","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-05T10:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"481a3f1cbadb3910a0abc42c1bd4261fb69e454ed124f33ac2193f5f85edb8f3","abstract_canon_sha256":"6532493d84b26f94640ad4858b533ce60448cf68a4efc3a0687b213bcc3dc76a"},"schema_version":"1.0"},"canonical_sha256":"56204bc93b81433fe9f8c33668dd856dbec6daff43e9a5d31490e92d771a03f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:36:30.460760Z","signature_b64":"fg37Y+nShuqxhJOJGziMM42rqkKcsiGspwSjoWm0TikvaMuemjeHboP8vOW2unh+ADBj5xAVXHuDrwVFSk1VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56204bc93b81433fe9f8c33668dd856dbec6daff43e9a5d31490e92d771a03f9","last_reissued_at":"2026-08-06T01:36:30.459175Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:36:30.459175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04645","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-08-06T01:36:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdR1C+k8tkyilzR/eMqbfvRDBuDeJxzK2KYnfSGYWSkSCcnaea4nOuC0iY5oMtH4bhHE1CGXXfpdD6iFP59aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:34:43.468791Z"},"content_sha256":"04931495d5ba7537826ec14e170d324af6b063460de2a50da3199e23fecfb4b9","schema_version":"1.0","event_id":"sha256:04931495d5ba7537826ec14e170d324af6b063460de2a50da3199e23fecfb4b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Datalog on Quantum Annealers: Compiling Recursive Logic Programs with Bottom-up Semantics to 2-local Ising Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Bruno Rucy Carneiro Alves de Lima, Evgenii Dolzhkov, Joseph Haske, Victor Henrique Cabral Pinheiro","submitted_at":"2026-08-05T10:05:38Z","abstract_excerpt":"Quantum annealers solve problems by finding the lowest-energy (ground) state of a programmable physical system, a 2-local Ising model, whose energy function is the Hamiltonian. We compile recursive Datalog programs into such models so that the ground state projects onto the program's minimal Herbrand model. The compiler has four stages: binarization, grounding, reduction to a Min-Ones SAT formula, and Ising encoding. Each rule becomes an energy penalty on the one assignment that violates it, and a small uniform cost on every true atom selects the minimal model. We contribute both in theory and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04645","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/2608.04645/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-08-06T01:36:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htoDxHdL5kScGQ1/0fLwC6209OD7P06k/inosTmzm1cdUazYeq8vGuCTU7SAN7WzTICNbCwIRAM1Az9QePWkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:34:43.469282Z"},"content_sha256":"85bb5ca85b9b4e1965155c4b7623dc74d3e8c2aacd5088aa9f7176f6872be25c","schema_version":"1.0","event_id":"sha256:85bb5ca85b9b4e1965155c4b7623dc74d3e8c2aacd5088aa9f7176f6872be25c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1126/science.ado6285 resolves to 'Beyond-classical computation in quantum simulation'. A reader following the printed text alone cannot reach it.","snippet":"A. D. King, et al., Beyond-classical computation in quantum simulation, Science 388 (2025) 199–204. doi: 10.1126/science. ado6285","arxiv_id":"2608.04645","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":"Beyond-classical computation in quantum simulation","printed_excerpt":"10.1126/science","reconstructed_doi":"10.1126/science.ado6285"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-06T20:08:11.972869Z","event_type":"pith.integrity.v1","detected_doi":"10.1126/science.ado6285","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"492fa6ab3d22c739608616d6174809c3b994f2d63f3c565a216a735f6beb57e7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Beyond-classical computation in quantum simulation","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18358,"payload_sha256":"33e6a11f213b5e77f58d5d157f2815e64cea9662284acc1891a61d02558172d9","signature_b64":"+Itw0st/NjMv/L04DVdRG3gqKo1KHE6vwdsxlaVOLEUOzn8FYYxFkFKtEBywKazn3VMvjgh00SUaGp3lEgeMAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-06T20:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MefWNeJeBFpjZ0D40Hq/8WRwsGCQABtW887u2RU3Lr5j/Go/CeCTuBWqtLqVQpVDESfxu3SogBUlBUDJdn/VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:34:43.472527Z"},"content_sha256":"f9ab063f477dbf88dcc0e75a08918777995c2f39242270df7ccabdbce8edbb0e","schema_version":"1.0","event_id":"sha256:f9ab063f477dbf88dcc0e75a08918777995c2f39242270df7ccabdbce8edbb0e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.ic.2020.104609 resolves to 'Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results'. A reader following the printed text alone cannot reach it.","snippet":"Z. Bian, F. Chudak, W. Macready, A. Roy, R. Sebastiani, S. Varotti, Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results, Information and Computation 275 (2020) 104609. doi: 10.1016/j.ic.2020. 10","arxiv_id":"2608.04645","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":"Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results","printed_excerpt":"10.1016/j.ic.2020","reconstructed_doi":"10.1016/j.ic.2020.104609"},"severity":"advisory","ref_index":12,"audited_at":"2026-08-06T20:08:11.972869Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ic.2020.104609","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e869235883fa472ad9e82d76e74890e0d40ce394c9f856a1963e8083814e1ad7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18357,"payload_sha256":"79d71574024707b8a3a84bef3dc1ef3074c88c4dfc48e52c2cdde34e9965619d","signature_b64":"yw6EChqljCxgJEK/XioVuRoSg1LDygYXsjo3nQkGOKc2yRRRGz+xxyGGID+66ajXM+at9PEjS/EXR88Wakg3BQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-06T20:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hss3lt8owclFFI8NaTShuUyohzquh9TlrG+MNSxNty76dCkz5lb8CAWM9ElWV30NsVwT989Io69RtBUf/9Q+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:34:43.472917Z"},"content_sha256":"0d704c19d5674b10f1a881883bad4927f72e17f175629864ef9a14d54530b7ff","schema_version":"1.0","event_id":"sha256:0d704c19d5674b10f1a881883bad4927f72e17f175629864ef9a14d54530b7ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/bundle.json","state_url":"https://pith.science/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/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-10T03:34:43Z","links":{"resolver":"https://pith.science/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW","bundle":"https://pith.science/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/bundle.json","state":"https://pith.science/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYQEXSJ3QFBT72PYYM3GRXMFNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KYQEXSJ3QFBT72PYYM3GRXMFNW","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6532493d84b26f94640ad4858b533ce60448cf68a4efc3a0687b213bcc3dc76a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-05T10:05:38Z","title_canon_sha256":"481a3f1cbadb3910a0abc42c1bd4261fb69e454ed124f33ac2193f5f85edb8f3"},"schema_version":"1.0","source":{"id":"2608.04645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04645","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04645v1","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04645","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_12","alias_value":"KYQEXSJ3QFBT","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_16","alias_value":"KYQEXSJ3QFBT72PY","created_at":"2026-08-06T01:36:30Z"},{"alias_kind":"pith_short_8","alias_value":"KYQEXSJ3","created_at":"2026-08-06T01:36:30Z"}],"graph_snapshots":[{"event_id":"sha256:85bb5ca85b9b4e1965155c4b7623dc74d3e8c2aacd5088aa9f7176f6872be25c","target":"graph","created_at":"2026-08-06T01:36:30Z","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/2608.04645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum annealers solve problems by finding the lowest-energy (ground) state of a programmable physical system, a 2-local Ising model, whose energy function is the Hamiltonian. We compile recursive Datalog programs into such models so that the ground state projects onto the program's minimal Herbrand model. The compiler has four stages: binarization, grounding, reduction to a Min-Ones SAT formula, and Ising encoding. Each rule becomes an energy penalty on the one assignment that violates it, and a small uniform cost on every true atom selects the minimal model. We contribute both in theory and","authors_text":"Bruno Rucy Carneiro Alves de Lima, Evgenii Dolzhkov, Joseph Haske, Victor Henrique Cabral Pinheiro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-05T10:05:38Z","title":"Towards Datalog on Quantum Annealers: Compiling Recursive Logic Programs with Bottom-up Semantics to 2-local Ising Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04645","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:04931495d5ba7537826ec14e170d324af6b063460de2a50da3199e23fecfb4b9","target":"record","created_at":"2026-08-06T01:36:30Z","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":"6532493d84b26f94640ad4858b533ce60448cf68a4efc3a0687b213bcc3dc76a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-05T10:05:38Z","title_canon_sha256":"481a3f1cbadb3910a0abc42c1bd4261fb69e454ed124f33ac2193f5f85edb8f3"},"schema_version":"1.0","source":{"id":"2608.04645","kind":"arxiv","version":1}},"canonical_sha256":"56204bc93b81433fe9f8c33668dd856dbec6daff43e9a5d31490e92d771a03f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56204bc93b81433fe9f8c33668dd856dbec6daff43e9a5d31490e92d771a03f9","first_computed_at":"2026-08-06T01:36:30.459175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:36:30.459175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fg37Y+nShuqxhJOJGziMM42rqkKcsiGspwSjoWm0TikvaMuemjeHboP8vOW2unh+ADBj5xAVXHuDrwVFSk1VCg==","signature_status":"signed_v1","signed_at":"2026-08-06T01:36:30.460760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04645","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:0d704c19d5674b10f1a881883bad4927f72e17f175629864ef9a14d54530b7ff","sha256:f9ab063f477dbf88dcc0e75a08918777995c2f39242270df7ccabdbce8edbb0e"]}],"invalid_events":[],"applied_event_ids":["sha256:04931495d5ba7537826ec14e170d324af6b063460de2a50da3199e23fecfb4b9","sha256:85bb5ca85b9b4e1965155c4b7623dc74d3e8c2aacd5088aa9f7176f6872be25c"],"state_sha256":"34d09c30d43f07f1b1718f5ce7818aabe03c88eb9be7f13c6d4cbcbc7a43b392"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90iBa0M1cfuzGzW6L7PxNPoiEcJjOq2hwx8lUq/UFBUtca63Oc9jHM5zg+ivQXy2CE7M8IMBoxp77UA0ho29DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:34:43.475789Z","bundle_sha256":"d75dcc75453d215243f2190355eb34c7a70a27f3290e8e60bd683b52829eb272"}}