{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LZGOTFADN5GDQ5LLQBMQQ3GVQJ","short_pith_number":"pith:LZGOTFAD","canonical_record":{"source":{"id":"2102.04703","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-09T08:46:50Z","cross_cats_sorted":["cs.CC","cs.DM","math.OC"],"title_canon_sha256":"8d0f4bfd1eb129a501c9a0fe1cfd6efc2e3dbd3b3300308cd53a5d74b919b688","abstract_canon_sha256":"aba3ae25acc6b4779c0efa96d4e09c4c26950a4ab543bd7a627eb4c9958cc9fc"},"schema_version":"1.0"},"canonical_sha256":"5e4ce994036f4c38756b8059086cd5826a889618f0ad6fde94100404f884e1fe","source":{"kind":"arxiv","id":"2102.04703","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04703","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04703v4","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04703","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"LZGOTFADN5GD","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_16","alias_value":"LZGOTFADN5GDQ5LL","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_8","alias_value":"LZGOTFAD","created_at":"2026-07-05T04:55:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LZGOTFADN5GDQ5LLQBMQQ3GVQJ","target":"record","payload":{"canonical_record":{"source":{"id":"2102.04703","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-09T08:46:50Z","cross_cats_sorted":["cs.CC","cs.DM","math.OC"],"title_canon_sha256":"8d0f4bfd1eb129a501c9a0fe1cfd6efc2e3dbd3b3300308cd53a5d74b919b688","abstract_canon_sha256":"aba3ae25acc6b4779c0efa96d4e09c4c26950a4ab543bd7a627eb4c9958cc9fc"},"schema_version":"1.0"},"canonical_sha256":"5e4ce994036f4c38756b8059086cd5826a889618f0ad6fde94100404f884e1fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:35.697836Z","signature_b64":"Z7gSbTAu1bn0Irm+FyJIB2exdM13lzW0C/uJw5MoyhgP8RXVjkyxnl7wesxUeWw+ELsQS8QRfycbIUHYYwK/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4ce994036f4c38756b8059086cd5826a889618f0ad6fde94100404f884e1fe","last_reissued_at":"2026-07-05T04:55:35.697375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:35.697375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.04703","source_version":4,"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-05T04:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuPm96Apnh1kKCmxJtBo8rNipj5+Xi/uP/NnsaodEea13yT/VwZQb2V/5CsaCuQsLa+A6CvDXUf+sV/UrOK9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:35.946731Z"},"content_sha256":"1556b73c5e6b1d96368602d75ef382d3672638a48b32220465b14bf9ee2e04fb","schema_version":"1.0","event_id":"sha256:1556b73c5e6b1d96368602d75ef382d3672638a48b32220465b14bf9ee2e04fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LZGOTFADN5GDQ5LLQBMQQ3GVQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inapproximability of a Pair of Forms Defining a Partial Boolean Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.OC"],"primary_cat":"cs.LG","authors_text":"Bjoern Andres, David Stein","submitted_at":"2021-02-09T08:46:50Z","abstract_excerpt":"We consider the problem of jointly minimizing forms of two Boolean functions $f, g \\colon \\{0,1\\}^J \\to \\{0,1\\}$ such that $f + g \\leq 1$ and so as to separate disjoint sets $A \\cup B \\subseteq \\{0,1\\}^J$ such that $f(A) = \\{1\\}$ and $g(B) = \\{1\\}$. We hypothesize that this problem is easier to solve or approximate than the well-understood problem of minimizing the form of one Boolean function $h: \\{0,1\\}^J \\to \\{0,1\\}$ such that $h(A) = \\{1\\}$ and $h(B) = \\{0\\}$. For a large class of forms, including binary decision trees and ordered binary decision diagrams, we refute this hypothesis. For di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04703","kind":"arxiv","version":4},"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/2102.04703/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-05T04:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3LYKHJy7FiJYE4QqszATmLYvjHNtycGemoxyXd9QWL0RcKUGtfJ0YENdzzQYr5KSsGnhPHPXVeQK/yJdXxOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:35.947099Z"},"content_sha256":"e06b3dff34f8929c16baaf5f63fe0d768f26efb443cd5e9e01eed322122d125e","schema_version":"1.0","event_id":"sha256:e06b3dff34f8929c16baaf5f63fe0d768f26efb443cd5e9e01eed322122d125e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/bundle.json","state_url":"https://pith.science/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/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-07-06T19:34:35Z","links":{"resolver":"https://pith.science/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ","bundle":"https://pith.science/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/bundle.json","state":"https://pith.science/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZGOTFADN5GDQ5LLQBMQQ3GVQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LZGOTFADN5GDQ5LLQBMQQ3GVQJ","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":"aba3ae25acc6b4779c0efa96d4e09c4c26950a4ab543bd7a627eb4c9958cc9fc","cross_cats_sorted":["cs.CC","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-09T08:46:50Z","title_canon_sha256":"8d0f4bfd1eb129a501c9a0fe1cfd6efc2e3dbd3b3300308cd53a5d74b919b688"},"schema_version":"1.0","source":{"id":"2102.04703","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04703","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04703v4","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04703","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"LZGOTFADN5GD","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_16","alias_value":"LZGOTFADN5GDQ5LL","created_at":"2026-07-05T04:55:35Z"},{"alias_kind":"pith_short_8","alias_value":"LZGOTFAD","created_at":"2026-07-05T04:55:35Z"}],"graph_snapshots":[{"event_id":"sha256:e06b3dff34f8929c16baaf5f63fe0d768f26efb443cd5e9e01eed322122d125e","target":"graph","created_at":"2026-07-05T04:55:35Z","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/2102.04703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of jointly minimizing forms of two Boolean functions $f, g \\colon \\{0,1\\}^J \\to \\{0,1\\}$ such that $f + g \\leq 1$ and so as to separate disjoint sets $A \\cup B \\subseteq \\{0,1\\}^J$ such that $f(A) = \\{1\\}$ and $g(B) = \\{1\\}$. We hypothesize that this problem is easier to solve or approximate than the well-understood problem of minimizing the form of one Boolean function $h: \\{0,1\\}^J \\to \\{0,1\\}$ such that $h(A) = \\{1\\}$ and $h(B) = \\{0\\}$. For a large class of forms, including binary decision trees and ordered binary decision diagrams, we refute this hypothesis. For di","authors_text":"Bjoern Andres, David Stein","cross_cats":["cs.CC","cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-09T08:46:50Z","title":"Inapproximability of a Pair of Forms Defining a Partial Boolean Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04703","kind":"arxiv","version":4},"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:1556b73c5e6b1d96368602d75ef382d3672638a48b32220465b14bf9ee2e04fb","target":"record","created_at":"2026-07-05T04:55:35Z","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":"aba3ae25acc6b4779c0efa96d4e09c4c26950a4ab543bd7a627eb4c9958cc9fc","cross_cats_sorted":["cs.CC","cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-09T08:46:50Z","title_canon_sha256":"8d0f4bfd1eb129a501c9a0fe1cfd6efc2e3dbd3b3300308cd53a5d74b919b688"},"schema_version":"1.0","source":{"id":"2102.04703","kind":"arxiv","version":4}},"canonical_sha256":"5e4ce994036f4c38756b8059086cd5826a889618f0ad6fde94100404f884e1fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e4ce994036f4c38756b8059086cd5826a889618f0ad6fde94100404f884e1fe","first_computed_at":"2026-07-05T04:55:35.697375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:35.697375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7gSbTAu1bn0Irm+FyJIB2exdM13lzW0C/uJw5MoyhgP8RXVjkyxnl7wesxUeWw+ELsQS8QRfycbIUHYYwK/Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:35.697836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.04703","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1556b73c5e6b1d96368602d75ef382d3672638a48b32220465b14bf9ee2e04fb","sha256:e06b3dff34f8929c16baaf5f63fe0d768f26efb443cd5e9e01eed322122d125e"],"state_sha256":"dfe09a164427dd0206abaf8a8f6e4bbc9a70178b2e17fd518e655270f75f78c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCYx9y9kQAsriWM+6IIwxpc5C5bgayFHrmDnpBZ2VgMhWtB4cbgBxWa9gJ1w9jY6rCz5CZpIGabA3Yc4+Rg+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:34:35.949032Z","bundle_sha256":"18273e036921a54d688a205542c3a5050e6803989f97eea8bfd717dcbeda8268"}}