{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5ENQGS2UVXCNY3QPB2KKTL4WS7","short_pith_number":"pith:5ENQGS2U","canonical_record":{"source":{"id":"1304.5498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T18:23:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d0619f0e9dca392bc6aeaade67850ac400cdc3099909e39d6140b4331079b2f","abstract_canon_sha256":"42569b90fa765d00ae6f4dac1509b977231cf08f299a46007c5cc678d3564fcf"},"schema_version":"1.0"},"canonical_sha256":"e91b034b54adc4dc6e0f0e94a9af9697e3316ada04f566c1f334d2a58d758124","source":{"kind":"arxiv","id":"1304.5498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5498","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5498v2","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5498","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"5ENQGS2UVXCN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ENQGS2UVXCNY3QP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ENQGS2U","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5ENQGS2UVXCNY3QPB2KKTL4WS7","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T18:23:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d0619f0e9dca392bc6aeaade67850ac400cdc3099909e39d6140b4331079b2f","abstract_canon_sha256":"42569b90fa765d00ae6f4dac1509b977231cf08f299a46007c5cc678d3564fcf"},"schema_version":"1.0"},"canonical_sha256":"e91b034b54adc4dc6e0f0e94a9af9697e3316ada04f566c1f334d2a58d758124","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:08.734548Z","signature_b64":"ZGoVJZ9ugoOVNgcNRnWdYXDwRL9MNODBo4UGytnC8LWIOjhqbMKpxOW2qN1ciYbIDfN0YpiYWs3gq1wRTK0YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e91b034b54adc4dc6e0f0e94a9af9697e3316ada04f566c1f334d2a58d758124","last_reissued_at":"2026-05-18T03:12:08.733769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:08.733769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5498","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-18T03:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HMbJ8g67qB7T+owntLY7bTwa8s9FRkXfI3ZmYXDR3oFZpenCANaiPsAos9b0rqfxgbCm/Xs8y5NtgsYlab6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:08:38.281483Z"},"content_sha256":"75669ee5cf48866ae1152912767773101ac22d7103a80873680efc8c7aa668db","schema_version":"1.0","event_id":"sha256:75669ee5cf48866ae1152912767773101ac22d7103a80873680efc8c7aa668db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5ENQGS2UVXCNY3QPB2KKTL4WS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A SAT Approach to Clique-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Marijn J. H. Heule, Stefan Szeider","submitted_at":"2013-04-19T18:23:16Z","abstract_excerpt":"Clique-width is a graph invariant that has been widely studied in combinatorics and computer science. However, computing the clique-width of a graph is an intricate problem, the exact clique-width is not known even for very small graphs. We present a new method for computing the clique-width of graphs based on an encoding to propositional satisfiability (SAT) which is then evaluated by a SAT solver. Our encoding is based on a reformulation of clique-width in terms of partitions that utilizes an efficient encoding of cardinality constraints. Our SAT-based method is the first to discover the exa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5498","kind":"arxiv","version":2},"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"},"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-05-18T03:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nfb5XqWtQ+lgaWbwKhzXuPOER4mdAd9xTEdG2uyEhAq+EhLUJ0gnduOM3R3LuDu5LVEgAo4Ljk5GYCCCH8QPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:08:38.281869Z"},"content_sha256":"f066d0ddacf3210e9d2c60f3eedad721e0cad112161ee6b4330561dcccac6821","schema_version":"1.0","event_id":"sha256:f066d0ddacf3210e9d2c60f3eedad721e0cad112161ee6b4330561dcccac6821"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/bundle.json","state_url":"https://pith.science/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/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-28T19:08:38Z","links":{"resolver":"https://pith.science/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7","bundle":"https://pith.science/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/bundle.json","state":"https://pith.science/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ENQGS2UVXCNY3QPB2KKTL4WS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5ENQGS2UVXCNY3QPB2KKTL4WS7","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":"42569b90fa765d00ae6f4dac1509b977231cf08f299a46007c5cc678d3564fcf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T18:23:16Z","title_canon_sha256":"4d0619f0e9dca392bc6aeaade67850ac400cdc3099909e39d6140b4331079b2f"},"schema_version":"1.0","source":{"id":"1304.5498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5498","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5498v2","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5498","created_at":"2026-05-18T03:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"5ENQGS2UVXCN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ENQGS2UVXCNY3QP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ENQGS2U","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:f066d0ddacf3210e9d2c60f3eedad721e0cad112161ee6b4330561dcccac6821","target":"graph","created_at":"2026-05-18T03:12:08Z","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"},"paper":{"abstract_excerpt":"Clique-width is a graph invariant that has been widely studied in combinatorics and computer science. However, computing the clique-width of a graph is an intricate problem, the exact clique-width is not known even for very small graphs. We present a new method for computing the clique-width of graphs based on an encoding to propositional satisfiability (SAT) which is then evaluated by a SAT solver. Our encoding is based on a reformulation of clique-width in terms of partitions that utilizes an efficient encoding of cardinality constraints. Our SAT-based method is the first to discover the exa","authors_text":"Marijn J. H. Heule, Stefan Szeider","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T18:23:16Z","title":"A SAT Approach to Clique-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5498","kind":"arxiv","version":2},"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:75669ee5cf48866ae1152912767773101ac22d7103a80873680efc8c7aa668db","target":"record","created_at":"2026-05-18T03:12:08Z","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":"42569b90fa765d00ae6f4dac1509b977231cf08f299a46007c5cc678d3564fcf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T18:23:16Z","title_canon_sha256":"4d0619f0e9dca392bc6aeaade67850ac400cdc3099909e39d6140b4331079b2f"},"schema_version":"1.0","source":{"id":"1304.5498","kind":"arxiv","version":2}},"canonical_sha256":"e91b034b54adc4dc6e0f0e94a9af9697e3316ada04f566c1f334d2a58d758124","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e91b034b54adc4dc6e0f0e94a9af9697e3316ada04f566c1f334d2a58d758124","first_computed_at":"2026-05-18T03:12:08.733769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:08.733769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGoVJZ9ugoOVNgcNRnWdYXDwRL9MNODBo4UGytnC8LWIOjhqbMKpxOW2qN1ciYbIDfN0YpiYWs3gq1wRTK0YAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:08.734548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75669ee5cf48866ae1152912767773101ac22d7103a80873680efc8c7aa668db","sha256:f066d0ddacf3210e9d2c60f3eedad721e0cad112161ee6b4330561dcccac6821"],"state_sha256":"3a5de79584ccdaa789e0ebd8344139d769dc51b2790c489c342746514b29717f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvH9QTmwqe9Vioes0/j3LlnHJRDLm71/kkWUdakdnsK/R2HdwWWxTj+ss/h8zFv9V/4HVOtAz9WURGdegRqHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:08:38.285599Z","bundle_sha256":"b72d124f14e3c92955b4763160d5781b076e610f20da67244b10fea43a27dec7"}}