{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","short_pith_number":"pith:LI4EFKXO","canonical_record":{"source":{"id":"2607.20022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-22T11:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"260e77698b44c2e8b8446e6905f57f8dc806dbf616fe165f149d686f8209f714","abstract_canon_sha256":"a4a7cf851905f29383e8692f9c6f09dbecf7d7e8b9cdae1321845a892e7e0d52"},"schema_version":"1.0"},"canonical_sha256":"5a3842aaee1398b32c992edc0bd15e402bcf31ecdaa60a344cbfc658ca302511","source":{"kind":"arxiv","id":"2607.20022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20022","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20022v1","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20022","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"LI4EFKXOCOML","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"LI4EFKXOCOMLGLEZ","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"LI4EFKXO","created_at":"2026-07-23T01:24:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","target":"record","payload":{"canonical_record":{"source":{"id":"2607.20022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-22T11:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"260e77698b44c2e8b8446e6905f57f8dc806dbf616fe165f149d686f8209f714","abstract_canon_sha256":"a4a7cf851905f29383e8692f9c6f09dbecf7d7e8b9cdae1321845a892e7e0d52"},"schema_version":"1.0"},"canonical_sha256":"5a3842aaee1398b32c992edc0bd15e402bcf31ecdaa60a344cbfc658ca302511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:55.983487Z","signature_b64":"7dO2G4A7rQHU3OgHM0nxybzLNUvR3LgaapydQrWU2xCnGSs5j6Y3dDP0V8e40yRA1sfOc1sPHvRimxKloUDcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3842aaee1398b32c992edc0bd15e402bcf31ecdaa60a344cbfc658ca302511","last_reissued_at":"2026-07-23T01:24:55.982676Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:55.982676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.20022","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-23T01:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRDjcCGAms4cFjoJUy+06NJAUhj9Nkyb9hwhXa5JwGKBQpROso0j8IWwAeebCwHDnK43iq4NyrCGfIP+ZLjbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:30.584746Z"},"content_sha256":"b1c13850039a3876a3d05e4e33373ad0b76df3ee6db419c0415d09e97e0fa579","schema_version":"1.0","event_id":"sha256:b1c13850039a3876a3d05e4e33373ad0b76df3ee6db419c0415d09e97e0fa579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Difference Constraint Propagation for Constraint Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Schutt, Jip J. Dekker, Lucas Kletzander, Peter J. Stuckey","submitted_at":"2026-07-22T11:02:56Z","abstract_excerpt":"Difference constraints of the form $x - y \\leq d$ are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finite domain propagation algorithms, however, typically do not make use of these algorithms, and treat each difference constraint as a separate propagator. Propagation does guarantee completeness of solving, but can be needlessly slow. In this paper we describe how to build a (bounds consistent) global propagator for difference constraints that treats them all simultaneously. SAT modulo theory solvers have included theor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20022","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/2607.20022/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-23T01:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fajqNWuRy6nwHd5HJ0pT8KNgN+LPo6psQgxAzvfPk3ZpWFhOa9mkFI4n5B6GHoHXBYseijDcdvjkA0sAkSrjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:30.585246Z"},"content_sha256":"e0d9ce9d70418cab24345526b63d9e803594292a3beea2bb183f409fd8726aec","schema_version":"1.0","event_id":"sha256:e0d9ce9d70418cab24345526b63d9e803594292a3beea2bb183f409fd8726aec"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.3233/fAIA230278) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Bit-Monnot, A.: Enhancing hybrid CP-SAT search for disjunctive scheduling. In: Gal, K., Now´ e, A., Nalepa, G.J., Fairstein, R., R˘ adulescu, R. (eds.) 26th Euro- pean Conference on Artificial Intelligence (ECAI 2023)), pp. 255–262. IOS Pre","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.3233/f","reconstructed_doi":"10.3233/fAIA230278"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.3233/fAIA230278","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"da68932aee93ce9ec9c39a3e2e00c7a47c62b9cf55f91d460a4bb7cde60334c7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15695,"payload_sha256":"62c6bc23526e85ddd17f2b8ff3f5efd94368d337b69d5ff30111e35e40c5619c","signature_b64":"kD6HZtqhnwOZDOVECKjBrpGkXMQ4HFSX2KerC/Tdt6HSFDyimJF8n72EaebK6X0uUDVyVrvfQY9EaE4dr0iiCA==","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-01T11:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+/u0sT5IM/+gpN4R4gnAt1iJ+MiBX7HoElbti3BqaLYtH82Oej4A96885ycHgOrzC7BZVaQ8c+UUOdZETJiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:30.608885Z"},"content_sha256":"80c3b850b4a32bc7d5a12adaf533a031f1064bc5aa92e727064630cd08955b16","schema_version":"1.0","event_id":"sha256:80c3b850b4a32bc7d5a12adaf533a031f1064bc5aa92e727064630cd08955b16"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1609/aaai.v38i8.28638 resolves to 'Parallel Empirical Evaluations: Resilience despite Concurrency'. A reader following the printed text alone cannot reach it.","snippet":"Fichte, J.K., Geibinger, T., Hecher, M., Schl¨ ogel, M.: Parallel empirical eval- uations: Resilience despite concurrency. Proceedings of the AAAI Conference on Artificial Intelligence38(8), 8004–8012 (2024) https://doi.org/10.1609/aaai. v3","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":"Parallel Empirical Evaluations: Resilience despite Concurrency","printed_excerpt":"10.1609/aaai","reconstructed_doi":"10.1609/aaai.v38i8.28638"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.1609/aaai.v38i8.28638","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"1ae6c2ed2621e0844aca554856807d515b627cf6e58497c6fb4e191fdb580850","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Parallel Empirical Evaluations: Resilience despite Concurrency","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15694,"payload_sha256":"234a35475d41c1eb2e0a59da338640c60509d3e07e54f37dad9970e485ef1fa7","signature_b64":"TTZ9WabCFgEmsWRtgbePeX+dY/dKCikYP6JXSqTGHIiqh09ZWkfp5Ap8zZBW7i7ZJvlNPAzTeWN2SAGBCJ7YAw==","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-01T11:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtgRN5jB21RQiVu9WHoKHa77W7k5t6vTZAakRZc6R7zrpfRshAJnNws5JRQ96/jiUNkAQOIIHMsaY9a4f8N0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:30.609284Z"},"content_sha256":"ce65c32ce18d20a6c7a697f05b34fe4078973dfd4cd2b2de2a57c0324ce157c8","schema_version":"1.0","event_id":"sha256:ce65c32ce18d20a6c7a697f05b34fe4078973dfd4cd2b2de2a57c0324ce157c8"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","target":"integrity","payload":{"note":"Identifier '10.1007/978-3-540-32275-7' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Ar- tificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Mont","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-540-32275-7","arxiv_id":null,"ref_index":4,"raw_excerpt":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Ar- tificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings. Lecture Notes in Com- puter Science, vol. 3452, pp. 36–50. Springer, Berlin, Heidelberg (2004). https: //doi.or","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":4,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-32275-7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"0ed9bc444483234f2baa4a51ab40c780a3802cfef73e709383adcf7519469f3b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15693,"payload_sha256":"af7be5e6baad019026321bf99d9da62328381abac7099c860b439fe2e600333d","signature_b64":"5EIKRW5S8RULIX4RpKtWr3jJxpLpjf0/QXqpMVeqfP/ib1EQTt0IRFQ7Mi5U99/CUqtSpH9KkcdKPhYr9uWPBA==","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-01T11:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"touwRwKQfyCEdZdZflwvqxbhmb3P45w27Hl0j0f2R8n4/T+R4RfailM2h9tAZGlV9vsshVmMrksgzpW3FbxnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:30.609682Z"},"content_sha256":"f19dd27be811afbec36f2532e62b88180d2d9c273adf60bd9af086ea2506eef9","schema_version":"1.0","event_id":"sha256:f19dd27be811afbec36f2532e62b88180d2d9c273adf60bd9af086ea2506eef9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/bundle.json","state_url":"https://pith.science/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/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-05T23:55:30Z","links":{"resolver":"https://pith.science/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA","bundle":"https://pith.science/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/bundle.json","state":"https://pith.science/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LI4EFKXOCOMLGLEZF3OAXUK6IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LI4EFKXOCOMLGLEZF3OAXUK6IA","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a4a7cf851905f29383e8692f9c6f09dbecf7d7e8b9cdae1321845a892e7e0d52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-22T11:02:56Z","title_canon_sha256":"260e77698b44c2e8b8446e6905f57f8dc806dbf616fe165f149d686f8209f714"},"schema_version":"1.0","source":{"id":"2607.20022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20022","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20022v1","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20022","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"LI4EFKXOCOML","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"LI4EFKXOCOMLGLEZ","created_at":"2026-07-23T01:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"LI4EFKXO","created_at":"2026-07-23T01:24:55Z"}],"graph_snapshots":[{"event_id":"sha256:e0d9ce9d70418cab24345526b63d9e803594292a3beea2bb183f409fd8726aec","target":"graph","created_at":"2026-07-23T01:24:55Z","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/2607.20022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Difference constraints of the form $x - y \\leq d$ are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finite domain propagation algorithms, however, typically do not make use of these algorithms, and treat each difference constraint as a separate propagator. Propagation does guarantee completeness of solving, but can be needlessly slow. In this paper we describe how to build a (bounds consistent) global propagator for difference constraints that treats them all simultaneously. SAT modulo theory solvers have included theor","authors_text":"Andreas Schutt, Jip J. Dekker, Lucas Kletzander, Peter J. Stuckey","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-22T11:02:56Z","title":"Global Difference Constraint Propagation for Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20022","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:b1c13850039a3876a3d05e4e33373ad0b76df3ee6db419c0415d09e97e0fa579","target":"record","created_at":"2026-07-23T01:24:55Z","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":"a4a7cf851905f29383e8692f9c6f09dbecf7d7e8b9cdae1321845a892e7e0d52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-22T11:02:56Z","title_canon_sha256":"260e77698b44c2e8b8446e6905f57f8dc806dbf616fe165f149d686f8209f714"},"schema_version":"1.0","source":{"id":"2607.20022","kind":"arxiv","version":1}},"canonical_sha256":"5a3842aaee1398b32c992edc0bd15e402bcf31ecdaa60a344cbfc658ca302511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a3842aaee1398b32c992edc0bd15e402bcf31ecdaa60a344cbfc658ca302511","first_computed_at":"2026-07-23T01:24:55.982676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:24:55.982676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dO2G4A7rQHU3OgHM0nxybzLNUvR3LgaapydQrWU2xCnGSs5j6Y3dDP0V8e40yRA1sfOc1sPHvRimxKloUDcAw==","signature_status":"signed_v1","signed_at":"2026-07-23T01:24:55.983487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.20022","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:80c3b850b4a32bc7d5a12adaf533a031f1064bc5aa92e727064630cd08955b16","sha256:ce65c32ce18d20a6c7a697f05b34fe4078973dfd4cd2b2de2a57c0324ce157c8","sha256:f19dd27be811afbec36f2532e62b88180d2d9c273adf60bd9af086ea2506eef9"]}],"invalid_events":[],"applied_event_ids":["sha256:b1c13850039a3876a3d05e4e33373ad0b76df3ee6db419c0415d09e97e0fa579","sha256:e0d9ce9d70418cab24345526b63d9e803594292a3beea2bb183f409fd8726aec"],"state_sha256":"689c5215987f176d1f1bfe9c201235d34d0b61c93efd81446e4b670ad13847e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDV2u3cUBD0PhF9zu8iSqHsX/PaW25EqgfkuwJEo76v+LIQJsXjSA5UQ7KM/vFR104w2zEmYxTe1KE6UKXzeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:55:30.613016Z","bundle_sha256":"5c89def6363307287d5cd57dd569a12c3c6720e7491aac61d058b5db15cc1e0b"}}