{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","short_pith_number":"pith:O2T66WJJ","canonical_record":{"source":{"id":"2605.15406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-05-14T20:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"b8b19479b18f3ddd497d3510ed26d00376bde6115a05ccf7267ad8ac05840bc2","abstract_canon_sha256":"459e62aa367d9c652d9d26da92717f1f15b12a7d801f120e07220b45ae188604"},"schema_version":"1.0"},"canonical_sha256":"76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74","source":{"kind":"arxiv","id":"2605.15406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15406","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15406v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15406","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"O2T66WJJFIRW","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"O2T66WJJFIRWK3ZN","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"O2T66WJJ","created_at":"2026-05-20T00:00:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-05-14T20:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"b8b19479b18f3ddd497d3510ed26d00376bde6115a05ccf7267ad8ac05840bc2","abstract_canon_sha256":"459e62aa367d9c652d9d26da92717f1f15b12a7d801f120e07220b45ae188604"},"schema_version":"1.0"},"canonical_sha256":"76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:56.982746Z","signature_b64":"hoz7rZFbXXIPoCuI153VqJa7u2qRSq/vJzG4kflZk8gjk+ev/pu271KJMwz2zgoTzBnHswI1P8+zS0h19wCfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74","last_reissued_at":"2026-05-20T00:00:56.981853Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:56.981853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15406","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-05-20T00:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWQKZkjWQulHI7BkWreRda0Vy8LD7p4swPnjWysrcxrrdFzKFDMvPjdQaE60PDa30E2Ay+TWVDHVN1lRwlAuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.264003Z"},"content_sha256":"9360393b49a3efaf92a3d20bcdf3b82db05636c2e7467dff747bce76f34896f5","schema_version":"1.0","event_id":"sha256:9360393b49a3efaf92a3d20bcdf3b82db05636c2e7467dff747bce76f34896f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polymorphic Bottom-Up Weighted Relational Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Dmitri Volkov","submitted_at":"2026-05-14T20:43:52Z","abstract_excerpt":"This work presents a new approach for implementing polymorphism for bottom-up relational languages, without monomorphization. We begin by introducing semiringKanren, a bottom-up weighted relational programming language. We extend this base language to support polymorphism. We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method. Finally, we consider existing work and suggest directions for future research."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That equality patterns together with sufficiently large concrete instances of each polymorphic relation are enough to preserve the full semantics and weighting behavior of the original polymorphic program for every possible input.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"656ec6c2840948066eff35f20c7e106fac8cd71d974a3854a04030b5a713a1bd"},"source":{"id":"2605.15406","kind":"arxiv","version":1},"verdict":{"id":"95c0a483-4f36-4773-a2ae-816121142e23","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:46:50.623457Z","strongest_claim":"We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method.","one_line_summary":"Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That equality patterns together with sufficiently large concrete instances of each polymorphic relation are enough to preserve the full semantics and weighting behavior of the original polymorphic program for every possible input.","pith_extraction_headline":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics."},"integrity":{"clean":false,"summary":{"advisory":3,"critical":1,"by_detector":{"doi_compliance":{"total":4,"advisory":3,"critical":1,"informational":0}},"informational":0},"endpoint":"/pith/2605.15406/integrity.json","findings":[{"note":"Identifier '10.1145/3720506.url:https://doi.org/10.1145/3720506' 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.","detector":"doi_compliance","severity":"critical","ref_index":14,"audited_at":"2026-05-19T15:01:48.854956Z","detected_doi":"10.1145/3720506.url:https://doi.org/10.1145/3720506","finding_type":"unresolvable_identifier","verdict_class":"cross_source","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3586050.url:https://doi.org/10.1145/3586050) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":7,"audited_at":"2026-05-19T15:01:48.854956Z","detected_doi":"10.1145/3586050.url:https://doi.org/10.1145/3586050","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":15,"audited_at":"2026-05-19T15:01:48.854956Z","detected_doi":"10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":16,"audited_at":"2026-05-19T15:01:48.854956Z","detected_doi":"10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T16:23:47.846090Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:49.296362Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:01:48.854956Z","status":"completed","version":"1.0.0","findings_count":4},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.699697Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.155704Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.713361Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"34614fa34677942577cb069507b993c44c300cd773758da8aa00c94b544222c4"},"references":{"count":33,"sample":[{"doi":"10.1145/3643027","year":2024,"title":"Convergence of datalog over (Pre-) Semir- ings","work_id":"efec446f-46ef-4a4c-a950-1253a860104e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Polymorphism in Datalog and Inheritance in a Metamodel","work_id":"cbc8c84b-fe54-43a9-8b41-07751fa4c0cd","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"FormuLog: Datalog for static analysis involving logical formulae","work_id":"fb72ecca-d189-46c1-87dc-e8338a9ef133","ref_index":3,"cited_arxiv_id":"1809.06274","is_internal_anchor":true},{"doi":"","year":2010,"title":"Testing Polymorphic Properties","work_id":"224ac723-c068-45a0-8393-c639b01cc6a3","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/2661103.2661105","year":2012,"title":"miniKanren, live and un- tagged: quine generation via relational interpreters (programming pearl)","work_id":"d2abdb11-82cb-4574-9411-158330a47e0f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":33,"snapshot_sha256":"fc2c99d5ee0f1cab52e8f632fa444107cfc7bb4b79859cdb09844bd16f590fc3","internal_anchors":3},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb4fda935d4d91af3d3747e69b50364280dc7b52d45b8364c75bd967bb2029c4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"95c0a483-4f36-4773-a2ae-816121142e23"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKBhdVz1bhCaDFxnodkDQLbu18EoQbeEEYfdHi7ZqfWvG/VKm3DPjvZstM0U34JFSw2boMwhOrIJDzmjgp4XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.264731Z"},"content_sha256":"5ce9a833133f0cbb66bbc707871458c0c78a408d12f627871b949187eee409b6","schema_version":"1.0","event_id":"sha256:5ce9a833133f0cbb66bbc707871458c0c78a408d12f627871b949187eee409b6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Lov K. Grover. “A fast quantum mechanical algorithm for database search”. In:Proceedings of the Twenty-Eighth Annual ACM Symposium on The- ory of Computing. STOC ’96. Philadelphia, Pennsylvania, USA: Associ- ation for Computing Machinery, 1","arxiv_id":"2605.15406","detector":"doi_compliance","evidence":{"ref_index":16,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Lov K. Grover. “A fast quantum mechanical algorithm for database search”. In:Proceedings of the Twenty-Eighth Annual ACM Symposium on The- ory of Computing. STOC ’96. Philadelphia, Pennsylvania, USA: Associ- ation for Computing Machinery, 1","reconstructed_doi":"10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866"},"severity":"advisory","ref_index":16,"audited_at":"2026-05-19T15:01:48.854956Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"bfd5181f23e85403a2fd20523cc47e536f0c1e82b23e03efcf1049bf2d5000ed","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1762,"payload_sha256":"946c964480b1d95aa2190b00e9d6ad2591b9e4398c79dd46c9624d615996246b","signature_b64":"dRn2rJAbG9dbbZiWNcTJN+P25TjE4KXnuvw2JxLzDwuxjiXjsN3Rga4fMV3ZkcSyZmLfbYHbkyOKKq6qUFQDBA==","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-05-19T15:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJbDuCJ0ygDQT6cuop5VxK5lSzjwpBET4GcbTx0e43dwbmc7c2egKk6Gn+9Vu0IaHs2bnIXCG4VY1yruaUBSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.266131Z"},"content_sha256":"bedf4e338b06aa254c1f1e06c79d2ac5a78f2c0b746257ef7a1b6e6c0a10be62","schema_version":"1.0","event_id":"sha256:bedf4e338b06aa254c1f1e06c79d2ac5a78f2c0b746257ef7a1b6e6c0a10be62"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Todd J. Green, Grigoris Karvounarakis, and Val Tannen. “Provenance semirings”. In:Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT- SIGART Symposium on Principles of Database Systems. PODS ’07. Bei- jing, China: Association for Computing M","arxiv_id":"2605.15406","detector":"doi_compliance","evidence":{"ref_index":15,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Todd J. Green, Grigoris Karvounarakis, and Val Tannen. “Provenance semirings”. In:Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT- SIGART Symposium on Principles of Database Systems. PODS ’07. Bei- jing, China: Association for Computing M","reconstructed_doi":"10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535"},"severity":"advisory","ref_index":15,"audited_at":"2026-05-19T15:01:48.854956Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"add0598978c3169949058afa770807df28784243323d009afa5d85479bfc9403","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1761,"payload_sha256":"9b6dd5ff919b0ac3573d9ef3b88a1d4ea35916e425401436407d489368e3c1df","signature_b64":"2JKYXw+kZ2mbHpEvPATJe4N8bgTvfd0DJnx/O0TRItIaxKMKz6k9yj6Rdm4lgKBigT/4qI3CAanpnJTJBtCvCg==","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-05-19T15:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"binpQ0h82iWFwgddiSFG7W7wlZF0+9q8S3DAnlDk2Of/mxtCm3+2CzErckBdA6L+gas3krthbaZIg1yl9wsRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.266633Z"},"content_sha256":"658df6269efb2cd449b8a9b3b3cbb178ceceab5149c6f6c7f45716fd93859317","schema_version":"1.0","event_id":"sha256:658df6269efb2cd449b8a9b3b3cbb178ceceab5149c6f6c7f45716fd93859317"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"integrity","payload":{"note":"Identifier '10.1145/3720506.url:https://doi.org/10.1145/3720506' 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":"Mahdi Ghorbani et al. “Compressed and Parallelized Structured Tensor Algebra”. In:Proc. ACM Program. Lang.9.OOPSLA1 (Apr. 2025).doi: 10.1145/3720506.url:https://doi.org/10.1145/3720506","arxiv_id":"2605.15406","detector":"doi_compliance","evidence":{"doi":"10.1145/3720506.url:https://doi.org/10.1145/3720506","arxiv_id":null,"ref_index":14,"raw_excerpt":"Mahdi Ghorbani et al. “Compressed and Parallelized Structured Tensor Algebra”. In:Proc. ACM Program. Lang.9.OOPSLA1 (Apr. 2025).doi: 10.1145/3720506.url:https://doi.org/10.1145/3720506","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":14,"audited_at":"2026-05-19T15:01:48.854956Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3720506.url:https://doi.org/10.1145/3720506","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"0b673729dbc910b09dbcb5fe06415293eae74f60882f9dbbab55cde1fecec6ba","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1760,"payload_sha256":"2959b3a0d92a9c66772bb308c5416ce3e3f88012f5018dd640929b58af8dad33","signature_b64":"DwSi/OvBlSrMOXI59l3+0EHb9fMDRiEoxG+zvgK/gjta8+VZpd0fy3w5D5DXHHfoxMMH4zFL0h7SouCHl2KcAQ==","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-05-19T15:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnjLH2kxLRJBZ+aq/LPIjTttYxvgaGjo2JuBFRWbsdWTU+gVbwQkRPcgD4LWZrqTYU4jBI9X/IPeYyoSOkkKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.267245Z"},"content_sha256":"dab987d308f31be2fa18f4265d548760a01488b2ba429eaeea4d39f9d34dbefe","schema_version":"1.0","event_id":"sha256:dab987d308f31be2fa18f4265d548760a01488b2ba429eaeea4d39f9d34dbefe"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3586050.url:https://doi.org/10.1145/3586050) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"David Chiang, Colin McDonald, and Chung-chieh Shan. “Exact Recursive Probabilistic Programming”. In:Proc. ACM Program. Lang.7.OOPSLA1 (Apr. 2023).doi:10.1145/3586050.url:https://doi.org/10.1145/ 3586050","arxiv_id":"2605.15406","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"David Chiang, Colin McDonald, and Chung-chieh Shan. “Exact Recursive Probabilistic Programming”. In:Proc. ACM Program. Lang.7.OOPSLA1 (Apr. 2023).doi:10.1145/3586050.url:https://doi.org/10.1145/ 3586050","reconstructed_doi":"10.1145/3586050.url:https://doi.org/10.1145/3586050"},"severity":"advisory","ref_index":7,"audited_at":"2026-05-19T15:01:48.854956Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3586050.url:https://doi.org/10.1145/3586050","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f19f2301b254f23ac59eb7fc4c2c05a28a982ee1813a812d57f0d679020e2c5a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1759,"payload_sha256":"11b00276190966cb9238b5fd573073d1853956ac4ae7bf8667ff15d623191452","signature_b64":"X3ufIXwcsdDf8vA39FWT7rPWWIFfF3pySjAWftNUK7//z5RBuEyycNpCcJeNcmJ2wiLzzA54SVTqQjUAhGS+Cw==","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-05-19T15:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/9CLFjpEnuNOre2EZJjGBjt0PeVqmZXBGseIDgU3KuHQ5yk+mJd2bYIzReBlHXz+NHR8B2ixqzurfZJXsAaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:27:49.267736Z"},"content_sha256":"96bdcc663d60c40dc66fcbe29a2cb69aeb1a21986a54be1457141bfa342c5ee5","schema_version":"1.0","event_id":"sha256:96bdcc663d60c40dc66fcbe29a2cb69aeb1a21986a54be1457141bfa342c5ee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/bundle.json","state_url":"https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/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-05-21T13:27:49Z","links":{"resolver":"https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5","bundle":"https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/bundle.json","state":"https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"459e62aa367d9c652d9d26da92717f1f15b12a7d801f120e07220b45ae188604","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-05-14T20:43:52Z","title_canon_sha256":"b8b19479b18f3ddd497d3510ed26d00376bde6115a05ccf7267ad8ac05840bc2"},"schema_version":"1.0","source":{"id":"2605.15406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15406","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15406v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15406","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"O2T66WJJFIRW","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"O2T66WJJFIRWK3ZN","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"O2T66WJJ","created_at":"2026-05-20T00:00:56Z"}],"graph_snapshots":[{"event_id":"sha256:5ce9a833133f0cbb66bbc707871458c0c78a408d12f627871b949187eee409b6","target":"graph","created_at":"2026-05-20T00:00:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That equality patterns together with sufficiently large concrete instances of each polymorphic relation are enough to preserve the full semantics and weighting behavior of the original polymorphic program for every possible input."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics."}],"snapshot_sha256":"656ec6c2840948066eff35f20c7e106fac8cd71d974a3854a04030b5a713a1bd"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb4fda935d4d91af3d3747e69b50364280dc7b52d45b8364c75bd967bb2029c4"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T16:23:47.846090Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:49.296362Z","status":"completed","version":"0.1.0"},{"findings_count":4,"name":"doi_compliance","ran_at":"2026-05-19T15:01:48.854956Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.699697Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.155704Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.713361Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15406/integrity.json","findings":[{"audited_at":"2026-05-19T15:01:48.854956Z","detected_arxiv_id":null,"detected_doi":"10.1145/3720506.url:https://doi.org/10.1145/3720506","detector":"doi_compliance","finding_type":"unresolvable_identifier","note":"Identifier '10.1145/3720506.url:https://doi.org/10.1145/3720506' 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.","ref_index":14,"severity":"critical","verdict_class":"cross_source"},{"audited_at":"2026-05-19T15:01:48.854956Z","detected_arxiv_id":null,"detected_doi":"10.1145/3586050.url:https://doi.org/10.1145/3586050","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/3586050.url:https://doi.org/10.1145/3586050) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":7,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T15:01:48.854956Z","detected_arxiv_id":null,"detected_doi":"10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/1265530.1265535.url:https://doi.org/10.1145/1265530.1265535) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":15,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T15:01:48.854956Z","detected_arxiv_id":null,"detected_doi":"10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/237814.237866.url:https://doi.org/10.1145/237814.237866) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":16,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"34614fa34677942577cb069507b993c44c300cd773758da8aa00c94b544222c4","summary":{"advisory":3,"by_detector":{"doi_compliance":{"advisory":3,"critical":1,"informational":0,"total":4}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"This work presents a new approach for implementing polymorphism for bottom-up relational languages, without monomorphization. We begin by introducing semiringKanren, a bottom-up weighted relational programming language. We extend this base language to support polymorphism. We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method. Finally, we consider existing work and suggest directions for future research.","authors_text":"Dmitri Volkov","cross_cats":[],"headline":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-05-14T20:43:52Z","title":"Polymorphic Bottom-Up Weighted Relational Programming"},"references":{"count":33,"internal_anchors":3,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"10.1145/3643027","is_internal_anchor":false,"ref_index":1,"title":"Convergence of datalog over (Pre-) Semir- ings","work_id":"efec446f-46ef-4a4c-a950-1253a860104e","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Polymorphism in Datalog and Inheritance in a Metamodel","work_id":"cbc8c84b-fe54-43a9-8b41-07751fa4c0cd","year":2010},{"cited_arxiv_id":"1809.06274","doi":"","is_internal_anchor":true,"ref_index":3,"title":"FormuLog: Datalog for static analysis involving logical formulae","work_id":"fb72ecca-d189-46c1-87dc-e8338a9ef133","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Testing Polymorphic Properties","work_id":"224ac723-c068-45a0-8393-c639b01cc6a3","year":2010},{"cited_arxiv_id":"","doi":"10.1145/2661103.2661105","is_internal_anchor":false,"ref_index":5,"title":"miniKanren, live and un- tagged: quine generation via relational interpreters (programming pearl)","work_id":"d2abdb11-82cb-4574-9411-158330a47e0f","year":2012}],"snapshot_sha256":"fc2c99d5ee0f1cab52e8f632fa444107cfc7bb4b79859cdb09844bd16f590fc3"},"source":{"id":"2605.15406","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:46:50.623457Z","id":"95c0a483-4f36-4773-a2ae-816121142e23","model_set":{"reader":"grok-4.3"},"one_line_summary":"Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics.","strongest_claim":"We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method.","weakest_assumption":"That equality patterns together with sufficiently large concrete instances of each polymorphic relation are enough to preserve the full semantics and weighting behavior of the original polymorphic program for every possible input."}},"verdict_id":"95c0a483-4f36-4773-a2ae-816121142e23"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9360393b49a3efaf92a3d20bcdf3b82db05636c2e7467dff747bce76f34896f5","target":"record","created_at":"2026-05-20T00:00:56Z","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":"459e62aa367d9c652d9d26da92717f1f15b12a7d801f120e07220b45ae188604","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2026-05-14T20:43:52Z","title_canon_sha256":"b8b19479b18f3ddd497d3510ed26d00376bde6115a05ccf7267ad8ac05840bc2"},"schema_version":"1.0","source":{"id":"2605.15406","kind":"arxiv","version":1}},"canonical_sha256":"76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74","first_computed_at":"2026-05-20T00:00:56.981853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:56.981853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hoz7rZFbXXIPoCuI153VqJa7u2qRSq/vJzG4kflZk8gjk+ev/pu271KJMwz2zgoTzBnHswI1P8+zS0h19wCfDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:56.982746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15406","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:658df6269efb2cd449b8a9b3b3cbb178ceceab5149c6f6c7f45716fd93859317","sha256:96bdcc663d60c40dc66fcbe29a2cb69aeb1a21986a54be1457141bfa342c5ee5","sha256:bedf4e338b06aa254c1f1e06c79d2ac5a78f2c0b746257ef7a1b6e6c0a10be62","sha256:dab987d308f31be2fa18f4265d548760a01488b2ba429eaeea4d39f9d34dbefe"]}],"invalid_events":[],"applied_event_ids":["sha256:9360393b49a3efaf92a3d20bcdf3b82db05636c2e7467dff747bce76f34896f5","sha256:5ce9a833133f0cbb66bbc707871458c0c78a408d12f627871b949187eee409b6"],"state_sha256":"51e6a91ec48c1fb66aaaa7c466e80ca3d02235a4b78c7f326ba3c30a38102f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmU6jsYezi6uwMvnH3qIbrgIa/Co66Nln3m3Sw1l1dpQaefXnYNWZ2y7EE9Z+lOjCYeyKIYcls2GmCaWOiFfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:27:49.272860Z","bundle_sha256":"354bd616691ed5649c297eb3402971478b1c94768a0a51f62b3e7766310d6325"}}