{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BGPNZ7DVYDOJUJ4IOMBNNLU6DT","short_pith_number":"pith:BGPNZ7DV","canonical_record":{"source":{"id":"2604.08365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"311398897b27a35480699ecfb3293aaf7b2a4e0ae849da3c7589c77d4bd1a294","abstract_canon_sha256":"c145f6f84be906bcb1dd9365c612ea6dc1ac6f2c1f8fb29fdd4e4b94e79ae854"},"schema_version":"1.0"},"canonical_sha256":"099edcfc75c0dc9a27887302d6ae9e1cd7087170904ac7499f1957769d7389ea","source":{"kind":"arxiv","id":"2604.08365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08365","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08365v2","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08365","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"BGPNZ7DVYDOJ","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"BGPNZ7DVYDOJUJ4I","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"BGPNZ7DV","created_at":"2026-05-28T01:04:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BGPNZ7DVYDOJUJ4IOMBNNLU6DT","target":"record","payload":{"canonical_record":{"source":{"id":"2604.08365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"311398897b27a35480699ecfb3293aaf7b2a4e0ae849da3c7589c77d4bd1a294","abstract_canon_sha256":"c145f6f84be906bcb1dd9365c612ea6dc1ac6f2c1f8fb29fdd4e4b94e79ae854"},"schema_version":"1.0"},"canonical_sha256":"099edcfc75c0dc9a27887302d6ae9e1cd7087170904ac7499f1957769d7389ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:39.743841Z","signature_b64":"QgoVej4iH/HAm29m8ELKY2ZUDHXrHRCgDwAScU3rmv7O4RC/xI1WaaTJcOB2uAxxOoSVDdZ847lt9Jswd2ZkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"099edcfc75c0dc9a27887302d6ae9e1cd7087170904ac7499f1957769d7389ea","last_reissued_at":"2026-05-28T01:04:39.743267Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:39.743267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.08365","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB12SljMH3oCgvKz58ctvSC2g4ueQhxY3QXANcYi/Ta5WlNDKBAGPLuARuyWfUOuBhlUdeo7wHOZZ0vWqd9DCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:23:28.077592Z"},"content_sha256":"2af5f8b732bf6f2ea2379f65178425e589785247a0d04148ff779ba94c16e714","schema_version":"1.0","event_id":"sha256:2af5f8b732bf6f2ea2379f65178425e589785247a0d04148ff779ba94c16e714"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BGPNZ7DVYDOJUJ4IOMBNNLU6DT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalences of promise compactness principles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertalan Bodor","submitted_at":"2026-04-09T15:31:02Z","abstract_excerpt":"For a pair of finite relational structures $(\\mathfrak{A},\\mathfrak{B})$ such that $\\mathfrak{A}$ homomorphically maps to $\\mathfrak{B}$ we denote by $K_{(\\mathfrak{A},\\mathfrak{B})}$ the following statement: for all structures $\\mathfrak{I}$ with the same signature as $\\mathfrak{A}$ if all finite substructures of $\\mathfrak{I}$ homomorphically maps to $\\mathfrak{A}$ then $\\mathfrak{I}$ homomorphically maps to $\\mathfrak{B}$. In this article, we show that if $(\\mathfrak{A},\\mathfrak{B})$ has no Ol\\v{s}\\'{a}k polymorphism, then $K_{(\\mathfrak{A},\\mathfrak{B})}$ is equivalent to the ultrafilter "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if (𝔄,𝔅) has no Olšák polymorphism, then K_(𝔄,𝔅) is equivalent to the ultrafilter principle over ZF. This includes the statements K_(K3,K5) and K_(H2,Hc) for all c≥2.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The pair (𝔄,𝔅) has no Olšák polymorphism (and 𝔄 homomorphically maps to 𝔅); the equivalence holds specifically under this algebraic condition on the finite structures.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For structure pairs (A,B) without Olšák polymorphisms, the promise compactness K_(A,B) is equivalent to the ultrafilter principle over ZF, including K_(K3,K5) and K_(H2,Hc).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f7ff22d5b82e5275f31ec67d3086afc01366d2c4da9902e514f46ae5f52baefb"},"source":{"id":"2604.08365","kind":"arxiv","version":2},"verdict":{"id":"38b14b5f-b706-4d57-9330-d630a1b11f9e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T16:55:29.284482Z","strongest_claim":"if (𝔄,𝔅) has no Olšák polymorphism, then K_(𝔄,𝔅) is equivalent to the ultrafilter principle over ZF. This includes the statements K_(K3,K5) and K_(H2,Hc) for all c≥2.","one_line_summary":"For structure pairs (A,B) without Olšák polymorphisms, the promise compactness K_(A,B) is equivalent to the ultrafilter principle over ZF, including K_(K3,K5) and K_(H2,Hc).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The pair (𝔄,𝔅) has no Olšák polymorphism (and 𝔄 homomorphically maps to 𝔅); the equivalence holds specifically under this algebraic condition on the finite structures.","pith_extraction_headline":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08365/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":"38b14b5f-b706-4d57-9330-d630a1b11f9e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5XjPAInytsJUfH3vThZc2J3/wdMkpDtBk4pzGorimtuNdVAZpz8grsZizvNdqevq+p8hsSD1fhY7ElvhqtwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:23:28.078662Z"},"content_sha256":"b1258649ec0d5bbe0f58eeca272cd2a214ed2b28abc4ee78af7520b035b3e093","schema_version":"1.0","event_id":"sha256:b1258649ec0d5bbe0f58eeca272cd2a214ed2b28abc4ee78af7520b035b3e093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/bundle.json","state_url":"https://pith.science/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/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-06T21:23:28Z","links":{"resolver":"https://pith.science/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT","bundle":"https://pith.science/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/bundle.json","state":"https://pith.science/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGPNZ7DVYDOJUJ4IOMBNNLU6DT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BGPNZ7DVYDOJUJ4IOMBNNLU6DT","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":"c145f6f84be906bcb1dd9365c612ea6dc1ac6f2c1f8fb29fdd4e4b94e79ae854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:31:02Z","title_canon_sha256":"311398897b27a35480699ecfb3293aaf7b2a4e0ae849da3c7589c77d4bd1a294"},"schema_version":"1.0","source":{"id":"2604.08365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08365","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08365v2","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08365","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"BGPNZ7DVYDOJ","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"BGPNZ7DVYDOJUJ4I","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"BGPNZ7DV","created_at":"2026-05-28T01:04:39Z"}],"graph_snapshots":[{"event_id":"sha256:b1258649ec0d5bbe0f58eeca272cd2a214ed2b28abc4ee78af7520b035b3e093","target":"graph","created_at":"2026-05-28T01:04:39Z","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":"if (𝔄,𝔅) has no Olšák polymorphism, then K_(𝔄,𝔅) is equivalent to the ultrafilter principle over ZF. This includes the statements K_(K3,K5) and K_(H2,Hc) for all c≥2."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The pair (𝔄,𝔅) has no Olšák polymorphism (and 𝔄 homomorphically maps to 𝔅); the equivalence holds specifically under this algebraic condition on the finite structures."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For structure pairs (A,B) without Olšák polymorphisms, the promise compactness K_(A,B) is equivalent to the ultrafilter principle over ZF, including K_(K3,K5) and K_(H2,Hc)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF."}],"snapshot_sha256":"f7ff22d5b82e5275f31ec67d3086afc01366d2c4da9902e514f46ae5f52baefb"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.08365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a pair of finite relational structures $(\\mathfrak{A},\\mathfrak{B})$ such that $\\mathfrak{A}$ homomorphically maps to $\\mathfrak{B}$ we denote by $K_{(\\mathfrak{A},\\mathfrak{B})}$ the following statement: for all structures $\\mathfrak{I}$ with the same signature as $\\mathfrak{A}$ if all finite substructures of $\\mathfrak{I}$ homomorphically maps to $\\mathfrak{A}$ then $\\mathfrak{I}$ homomorphically maps to $\\mathfrak{B}$. In this article, we show that if $(\\mathfrak{A},\\mathfrak{B})$ has no Ol\\v{s}\\'{a}k polymorphism, then $K_{(\\mathfrak{A},\\mathfrak{B})}$ is equivalent to the ultrafilter ","authors_text":"Bertalan Bodor","cross_cats":[],"headline":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:31:02Z","title":"Equivalences of promise compactness principles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.08365","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T16:55:29.284482Z","id":"38b14b5f-b706-4d57-9330-d630a1b11f9e","model_set":{"reader":"grok-4.3"},"one_line_summary":"For structure pairs (A,B) without Olšák polymorphisms, the promise compactness K_(A,B) is equivalent to the ultrafilter principle over ZF, including K_(K3,K5) and K_(H2,Hc).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"When a pair of finite structures lacks an Olšák polymorphism, its promise compactness principle is equivalent to the ultrafilter principle over ZF.","strongest_claim":"if (𝔄,𝔅) has no Olšák polymorphism, then K_(𝔄,𝔅) is equivalent to the ultrafilter principle over ZF. This includes the statements K_(K3,K5) and K_(H2,Hc) for all c≥2.","weakest_assumption":"The pair (𝔄,𝔅) has no Olšák polymorphism (and 𝔄 homomorphically maps to 𝔅); the equivalence holds specifically under this algebraic condition on the finite structures."}},"verdict_id":"38b14b5f-b706-4d57-9330-d630a1b11f9e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2af5f8b732bf6f2ea2379f65178425e589785247a0d04148ff779ba94c16e714","target":"record","created_at":"2026-05-28T01:04:39Z","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":"c145f6f84be906bcb1dd9365c612ea6dc1ac6f2c1f8fb29fdd4e4b94e79ae854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-09T15:31:02Z","title_canon_sha256":"311398897b27a35480699ecfb3293aaf7b2a4e0ae849da3c7589c77d4bd1a294"},"schema_version":"1.0","source":{"id":"2604.08365","kind":"arxiv","version":2}},"canonical_sha256":"099edcfc75c0dc9a27887302d6ae9e1cd7087170904ac7499f1957769d7389ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"099edcfc75c0dc9a27887302d6ae9e1cd7087170904ac7499f1957769d7389ea","first_computed_at":"2026-05-28T01:04:39.743267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:39.743267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QgoVej4iH/HAm29m8ELKY2ZUDHXrHRCgDwAScU3rmv7O4RC/xI1WaaTJcOB2uAxxOoSVDdZ847lt9Jswd2ZkCg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:39.743841Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.08365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af5f8b732bf6f2ea2379f65178425e589785247a0d04148ff779ba94c16e714","sha256:b1258649ec0d5bbe0f58eeca272cd2a214ed2b28abc4ee78af7520b035b3e093"],"state_sha256":"15d068048f5febe6a0bf180283b5126763ba99a981b779fe73b533da08b56d88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysbU1zpuBHSHEYyOsLysm/KLXCu1nnzgvNYZuVGMEeEfu9dan5c8KLaIZxF2jtzgPpZ5SvBYR6oNWH2+arR2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:23:28.083164Z","bundle_sha256":"6bd8fd0946d090aa389b29de6514392c2abfc6f989980bfc82bed9d14166ccc2"}}