{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4SGJD4R32Z3XAYZ2SWZ75U4A64","short_pith_number":"pith:4SGJD4R3","canonical_record":{"source":{"id":"1402.7060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-27T20:41:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a8b4e93b8086ba6ac5c4fed2cc038689b6b5b28bf217ee87d56c108da5d8545","abstract_canon_sha256":"84d6dca6ac1dfc0bb80423dc3c7b8a68b726341344e04f19afa212ff6ea7fd5b"},"schema_version":"1.0"},"canonical_sha256":"e48c91f23bd67770633a95b3fed380f70e7c17fbc37fc70d999151c3e57fdf49","source":{"kind":"arxiv","id":"1402.7060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7060","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7060v1","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7060","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"4SGJD4R32Z3X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SGJD4R32Z3XAYZ2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SGJD4R3","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4SGJD4R32Z3XAYZ2SWZ75U4A64","target":"record","payload":{"canonical_record":{"source":{"id":"1402.7060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-27T20:41:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a8b4e93b8086ba6ac5c4fed2cc038689b6b5b28bf217ee87d56c108da5d8545","abstract_canon_sha256":"84d6dca6ac1dfc0bb80423dc3c7b8a68b726341344e04f19afa212ff6ea7fd5b"},"schema_version":"1.0"},"canonical_sha256":"e48c91f23bd67770633a95b3fed380f70e7c17fbc37fc70d999151c3e57fdf49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.359673Z","signature_b64":"RKhVpGwSgIQgznpSDIVvWXVNsoZHvWg+oMcQo4HWHXCN4bzbtziWDc4wPgUx6Hi2AbwWWoh1cnkZ5UxYcbF4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e48c91f23bd67770633a95b3fed380f70e7c17fbc37fc70d999151c3e57fdf49","last_reissued_at":"2026-05-18T02:57:36.359189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.359189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.7060","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-05-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzFOhiazNzXdQg1DdwNlPa+r2IvzcHCO5BncmJMaKb9Ihz0tsE06+2CEBKAbLPdzutLAkzzs7xFILRs7iw7HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:40:09.216955Z"},"content_sha256":"1f6b4412ce49e497979fb05e85dae70d2606ba3c9431569deaff73653ebd7689","schema_version":"1.0","event_id":"sha256:1f6b4412ce49e497979fb05e85dae70d2606ba3c9431569deaff73653ebd7689"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4SGJD4R32Z3XAYZ2SWZ75U4A64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classifying the Clique-Width of $H$-Free Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski","submitted_at":"2014-02-27T20:41:54Z","abstract_excerpt":"Let $G$ be a bipartite graph, and let $H$ be a bipartite graph with a fixed bipartition $(B_H,W_H)$. We consider three different, natural ways of forbidding $H$ as an induced subgraph in $G$. First, $G$ is $H$-free if it does not contain $H$ as an induced subgraph. Second, $G$ is strongly $H$-free if $G$ is $H$-free or else has no bipartition $(B_G,W_G)$ with $B_H\\subseteq B_G$ and $W_H\\subseteq W_G$. Third, $G$ is weakly $H$-free if $G$ is $H$-free or else has at least one bipartition $(B_G,W_G)$ with $B_H\\not\\subseteq B_G$ or $W_H\\not\\subseteq W_G$. Lozin and Volz characterized all bipartite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7060","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":""},"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-18T02:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMno54wW5fPuvT0ClronRpD4b0IQaP6ATO4xzLMgxGC8069AgYiT0pYJhVyS2Ejw1D3xQwYxO6fOemRAwWUhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:40:09.217293Z"},"content_sha256":"b659962f1c40a84c395d0423e0cb78e1f69b2ef3839b335488675cea16a592d8","schema_version":"1.0","event_id":"sha256:b659962f1c40a84c395d0423e0cb78e1f69b2ef3839b335488675cea16a592d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/bundle.json","state_url":"https://pith.science/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/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-29T15:40:09Z","links":{"resolver":"https://pith.science/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64","bundle":"https://pith.science/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/bundle.json","state":"https://pith.science/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SGJD4R32Z3XAYZ2SWZ75U4A64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4SGJD4R32Z3XAYZ2SWZ75U4A64","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":"84d6dca6ac1dfc0bb80423dc3c7b8a68b726341344e04f19afa212ff6ea7fd5b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-27T20:41:54Z","title_canon_sha256":"7a8b4e93b8086ba6ac5c4fed2cc038689b6b5b28bf217ee87d56c108da5d8545"},"schema_version":"1.0","source":{"id":"1402.7060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7060","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7060v1","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7060","created_at":"2026-05-18T02:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"4SGJD4R32Z3X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4SGJD4R32Z3XAYZ2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4SGJD4R3","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:b659962f1c40a84c395d0423e0cb78e1f69b2ef3839b335488675cea16a592d8","target":"graph","created_at":"2026-05-18T02:57:36Z","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":"Let $G$ be a bipartite graph, and let $H$ be a bipartite graph with a fixed bipartition $(B_H,W_H)$. We consider three different, natural ways of forbidding $H$ as an induced subgraph in $G$. First, $G$ is $H$-free if it does not contain $H$ as an induced subgraph. Second, $G$ is strongly $H$-free if $G$ is $H$-free or else has no bipartition $(B_G,W_G)$ with $B_H\\subseteq B_G$ and $W_H\\subseteq W_G$. Third, $G$ is weakly $H$-free if $G$ is $H$-free or else has at least one bipartition $(B_G,W_G)$ with $B_H\\not\\subseteq B_G$ or $W_H\\not\\subseteq W_G$. Lozin and Volz characterized all bipartite","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-27T20:41:54Z","title":"Classifying the Clique-Width of $H$-Free Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7060","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:1f6b4412ce49e497979fb05e85dae70d2606ba3c9431569deaff73653ebd7689","target":"record","created_at":"2026-05-18T02:57:36Z","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":"84d6dca6ac1dfc0bb80423dc3c7b8a68b726341344e04f19afa212ff6ea7fd5b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-27T20:41:54Z","title_canon_sha256":"7a8b4e93b8086ba6ac5c4fed2cc038689b6b5b28bf217ee87d56c108da5d8545"},"schema_version":"1.0","source":{"id":"1402.7060","kind":"arxiv","version":1}},"canonical_sha256":"e48c91f23bd67770633a95b3fed380f70e7c17fbc37fc70d999151c3e57fdf49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e48c91f23bd67770633a95b3fed380f70e7c17fbc37fc70d999151c3e57fdf49","first_computed_at":"2026-05-18T02:57:36.359189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:36.359189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKhVpGwSgIQgznpSDIVvWXVNsoZHvWg+oMcQo4HWHXCN4bzbtziWDc4wPgUx6Hi2AbwWWoh1cnkZ5UxYcbF4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:36.359673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f6b4412ce49e497979fb05e85dae70d2606ba3c9431569deaff73653ebd7689","sha256:b659962f1c40a84c395d0423e0cb78e1f69b2ef3839b335488675cea16a592d8"],"state_sha256":"61d30f87e8a14df05da9aa5623439c23fbdb6451448ea2e05533e24b1b5cfd0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkIgNnE2xXgnx/GyBEBeyN2wVu7ySPBlUNVOIo9VB4mz1q0GW0QD7j29SNbwcq8hRLoeqZ7nY6OpxmfZwr1dCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:40:09.219292Z","bundle_sha256":"05b1d22771acc3638baaabd9a82a75dc0c00493e97798a1343887ca9b26869a9"}}