{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WD5UEMGHB5NBTSTH7WOTG2BIWA","short_pith_number":"pith:WD5UEMGH","schema_version":"1.0","canonical_sha256":"b0fb4230c70f5a19ca67fd9d336828b0219e780bb07cbbe3778d16fb9698ac7b","source":{"kind":"arxiv","id":"0901.4417","version":4},"attestation_state":"computed","paper":{"title":"ALLSAT compressed with wildcards: All, or all maximum independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MS"],"primary_cat":"cs.DS","authors_text":"Marcel Wild","submitted_at":"2009-01-28T09:09:36Z","abstract_excerpt":"An odd cycle cover is a vertex set whose removal makes a graph bipartite. We show that if a $k$-element odd cycle cover of a graph with w vertices is known then all $N$ maximum anticliques (= independent sets) can be generated in time $O(2^k w^3 + N w^2))$. Generating ${\\it all}\\ N'$ anticliques (maximum or not) is easier and works for arbitrary graphs in time $O(N'w^2)$. In fact the use of wildcards allows to compactly generate the anticliques in clusters."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0901.4417","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-28T09:09:36Z","cross_cats_sorted":["cs.DM","cs.MS"],"title_canon_sha256":"51249de83ae07825d45e6615b66868d1a1ac575f735142c06a288c266ece36fd","abstract_canon_sha256":"3edd6e94adaf362078f0f7bb15b448b18488e10a73b2abba0a1b7e574226f2b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:10.608743Z","signature_b64":"5H6gx/xVhOMbdNkPKq5zsuV99TlpFW3QuumBuvPRZGUyosb45Rdv0OEhsc/5+rz9Eu26XJNaqb8ohVUGkS8LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0fb4230c70f5a19ca67fd9d336828b0219e780bb07cbbe3778d16fb9698ac7b","last_reissued_at":"2026-05-17T23:44:10.608135Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:10.608135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ALLSAT compressed with wildcards: All, or all maximum independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MS"],"primary_cat":"cs.DS","authors_text":"Marcel Wild","submitted_at":"2009-01-28T09:09:36Z","abstract_excerpt":"An odd cycle cover is a vertex set whose removal makes a graph bipartite. We show that if a $k$-element odd cycle cover of a graph with w vertices is known then all $N$ maximum anticliques (= independent sets) can be generated in time $O(2^k w^3 + N w^2))$. Generating ${\\it all}\\ N'$ anticliques (maximum or not) is easier and works for arbitrary graphs in time $O(N'w^2)$. In fact the use of wildcards allows to compactly generate the anticliques in clusters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4417","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0901.4417","created_at":"2026-05-17T23:44:10.608222+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.4417v4","created_at":"2026-05-17T23:44:10.608222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4417","created_at":"2026-05-17T23:44:10.608222+00:00"},{"alias_kind":"pith_short_12","alias_value":"WD5UEMGHB5NB","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WD5UEMGHB5NBTSTH","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WD5UEMGH","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA","json":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA.json","graph_json":"https://pith.science/api/pith-number/WD5UEMGHB5NBTSTH7WOTG2BIWA/graph.json","events_json":"https://pith.science/api/pith-number/WD5UEMGHB5NBTSTH7WOTG2BIWA/events.json","paper":"https://pith.science/paper/WD5UEMGH"},"agent_actions":{"view_html":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA","download_json":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA.json","view_paper":"https://pith.science/paper/WD5UEMGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.4417&json=true","fetch_graph":"https://pith.science/api/pith-number/WD5UEMGHB5NBTSTH7WOTG2BIWA/graph.json","fetch_events":"https://pith.science/api/pith-number/WD5UEMGHB5NBTSTH7WOTG2BIWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA/action/storage_attestation","attest_author":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA/action/author_attestation","sign_citation":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA/action/citation_signature","submit_replication":"https://pith.science/pith/WD5UEMGHB5NBTSTH7WOTG2BIWA/action/replication_record"}},"created_at":"2026-05-17T23:44:10.608222+00:00","updated_at":"2026-05-17T23:44:10.608222+00:00"}