{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SMUW4GNJQAKKZ7EL6MRSPMHF3L","short_pith_number":"pith:SMUW4GNJ","canonical_record":{"source":{"id":"2606.00845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T18:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"6316b30066fc83b6f30cc7c18740d9a905b14c9a569b158a1fd72f489649ff6d","abstract_canon_sha256":"c0312399028d5eb34d65c94b6c748a71023c8b08a39df7cf5af6d5061aeabeba"},"schema_version":"1.0"},"canonical_sha256":"93296e19a98014acfc8bf32327b0e5dac11357f5db6840934164eff8cea9414c","source":{"kind":"arxiv","id":"2606.00845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00845","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00845v1","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00845","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"SMUW4GNJQAKK","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"SMUW4GNJQAKKZ7EL","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"SMUW4GNJ","created_at":"2026-06-02T01:04:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SMUW4GNJQAKKZ7EL6MRSPMHF3L","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T18:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"6316b30066fc83b6f30cc7c18740d9a905b14c9a569b158a1fd72f489649ff6d","abstract_canon_sha256":"c0312399028d5eb34d65c94b6c748a71023c8b08a39df7cf5af6d5061aeabeba"},"schema_version":"1.0"},"canonical_sha256":"93296e19a98014acfc8bf32327b0e5dac11357f5db6840934164eff8cea9414c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:07.445785Z","signature_b64":"sc6vQAIV626b3XXSZxNQye1jLzW5Y4cxwk6l5yMCXgRz5DVZQv2frSCzbIs0eE2v1OMHhiTStTh7pWwxARBRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93296e19a98014acfc8bf32327b0e5dac11357f5db6840934164eff8cea9414c","last_reissued_at":"2026-06-02T01:04:07.445369Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:07.445369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00845","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-06-02T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EyBuQ7375ZUv8kpULgXWMWa/KkUbbRYkfGD77cTHbH5CpBTig97D6Uo2t/huWiuzdLuRPh/EoPY5jSLIYpEJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:22:35.776228Z"},"content_sha256":"38b331d786b6fe31c0fd53f87eb44a82f723ef9cca9a20f0dbba70a91b487ca0","schema_version":"1.0","event_id":"sha256:38b331d786b6fe31c0fd53f87eb44a82f723ef9cca9a20f0dbba70a91b487ca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SMUW4GNJQAKKZ7EL6MRSPMHF3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conjunctive reducibilities and completeness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andrea Sorbi, Irakli Chitaia, Keng Meng Ng, Roland Omanadze","submitted_at":"2026-05-30T18:44:05Z","abstract_excerpt":"In this article we study the notion of completeness for conjunctive reducibilities. We investigate the relationship between $c$-completeness and $r$-completeness of computably enumerable (c.e.) sets with respect to various strong reducibilities $\\le_r$. By using simplicity properties of sets, we prove that there exist c.e. sets that are simultaneously $Q$-complete and $bd$-complete, yet fail to be $c$-complete. Similarly, there exist c.e. sets that are simultaneously $Q$-complete and $bwtt$-complete (respectively, $btt$-complete) but not $c$-complete. Furthermore, we study two restrictions of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00845","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/2606.00845/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-06-02T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OP8nc0/1AtF6UQhBkBJHvmPhskZ2jdWsAXQ6mP919n+lfkL3Nl5LGsIOjG7keDfP+jUuOX3ZpGbBHhfk1/lHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:22:35.777075Z"},"content_sha256":"25eab96fe9891f4cd32914d2298d27596ba6a14609f3f4a989c1ce3ffe673483","schema_version":"1.0","event_id":"sha256:25eab96fe9891f4cd32914d2298d27596ba6a14609f3f4a989c1ce3ffe673483"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/bundle.json","state_url":"https://pith.science/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/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-06T22:22:35Z","links":{"resolver":"https://pith.science/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L","bundle":"https://pith.science/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/bundle.json","state":"https://pith.science/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMUW4GNJQAKKZ7EL6MRSPMHF3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SMUW4GNJQAKKZ7EL6MRSPMHF3L","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":"c0312399028d5eb34d65c94b6c748a71023c8b08a39df7cf5af6d5061aeabeba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T18:44:05Z","title_canon_sha256":"6316b30066fc83b6f30cc7c18740d9a905b14c9a569b158a1fd72f489649ff6d"},"schema_version":"1.0","source":{"id":"2606.00845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00845","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00845v1","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00845","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"SMUW4GNJQAKK","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"SMUW4GNJQAKKZ7EL","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"SMUW4GNJ","created_at":"2026-06-02T01:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:25eab96fe9891f4cd32914d2298d27596ba6a14609f3f4a989c1ce3ffe673483","target":"graph","created_at":"2026-06-02T01:04:07Z","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/2606.00845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article we study the notion of completeness for conjunctive reducibilities. We investigate the relationship between $c$-completeness and $r$-completeness of computably enumerable (c.e.) sets with respect to various strong reducibilities $\\le_r$. By using simplicity properties of sets, we prove that there exist c.e. sets that are simultaneously $Q$-complete and $bd$-complete, yet fail to be $c$-complete. Similarly, there exist c.e. sets that are simultaneously $Q$-complete and $bwtt$-complete (respectively, $btt$-complete) but not $c$-complete. Furthermore, we study two restrictions of ","authors_text":"Andrea Sorbi, Irakli Chitaia, Keng Meng Ng, Roland Omanadze","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T18:44:05Z","title":"Conjunctive reducibilities and completeness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00845","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:38b331d786b6fe31c0fd53f87eb44a82f723ef9cca9a20f0dbba70a91b487ca0","target":"record","created_at":"2026-06-02T01:04:07Z","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":"c0312399028d5eb34d65c94b6c748a71023c8b08a39df7cf5af6d5061aeabeba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-30T18:44:05Z","title_canon_sha256":"6316b30066fc83b6f30cc7c18740d9a905b14c9a569b158a1fd72f489649ff6d"},"schema_version":"1.0","source":{"id":"2606.00845","kind":"arxiv","version":1}},"canonical_sha256":"93296e19a98014acfc8bf32327b0e5dac11357f5db6840934164eff8cea9414c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93296e19a98014acfc8bf32327b0e5dac11357f5db6840934164eff8cea9414c","first_computed_at":"2026-06-02T01:04:07.445369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:07.445369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sc6vQAIV626b3XXSZxNQye1jLzW5Y4cxwk6l5yMCXgRz5DVZQv2frSCzbIs0eE2v1OMHhiTStTh7pWwxARBRBw==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:07.445785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38b331d786b6fe31c0fd53f87eb44a82f723ef9cca9a20f0dbba70a91b487ca0","sha256:25eab96fe9891f4cd32914d2298d27596ba6a14609f3f4a989c1ce3ffe673483"],"state_sha256":"3bf8aa510328550e53d8bae0194993049db01f69486765165a17ecdb1f124746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxWbkGU31kKXVQ1ciJlx564SActFJbv3NIkwvKpoSwX1gxZD4pJtlPkgx/Q03OK9aDDMZRsAKjNCotTlow1uBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:22:35.781402Z","bundle_sha256":"f3db23e3b69f1782b16c308ae51a5de1c6a9d4374917094c1bafa2aa36c3a0e0"}}