{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P5PQTDBJOPEGSTUVUYA5GRX6AM","short_pith_number":"pith:P5PQTDBJ","canonical_record":{"source":{"id":"1711.08837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T22:43:34Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"79b9a350be939f5904bda36649bfae8c68566368e68f738ebabf1a3408f86afc","abstract_canon_sha256":"2e602fcd143db60743cc845fbd6d8a49f9424a18e6b4adc8fa5a2650f895af68"},"schema_version":"1.0"},"canonical_sha256":"7f5f098c2973c8694e95a601d346fe0300e660035ab03afe54a3440e8fc01ae8","source":{"kind":"arxiv","id":"1711.08837","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08837","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08837v1","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08837","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"P5PQTDBJOPEG","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5PQTDBJOPEGSTUV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5PQTDBJ","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P5PQTDBJOPEGSTUVUYA5GRX6AM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T22:43:34Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"79b9a350be939f5904bda36649bfae8c68566368e68f738ebabf1a3408f86afc","abstract_canon_sha256":"2e602fcd143db60743cc845fbd6d8a49f9424a18e6b4adc8fa5a2650f895af68"},"schema_version":"1.0"},"canonical_sha256":"7f5f098c2973c8694e95a601d346fe0300e660035ab03afe54a3440e8fc01ae8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:43.957910Z","signature_b64":"yBYvxJUQiFpTMboqrRCfoUnNiPT7Tsxkh54gZAmkZFC97gO+o/EO86mN/KZDA/Lj2Nu5pNBzsOfmnJ+r0n97Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f5f098c2973c8694e95a601d346fe0300e660035ab03afe54a3440e8fc01ae8","last_reissued_at":"2026-05-18T00:29:43.957344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:43.957344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08837","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-18T00:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBLZAcp7ci4UFjYuJS6fHHWPnE9jWAKTkDE7q7i+bN6Ga7PzFnO5q0b/HQmL3PwEu5JKe0cXmvrRNk01ETIdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:17.070674Z"},"content_sha256":"c8495f3bc07817b4162ac115fa8154addb5441eb842b4b48c3bd9b50bda9a3d7","schema_version":"1.0","event_id":"sha256:c8495f3bc07817b4162ac115fa8154addb5441eb842b4b48c3bd9b50bda9a3d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P5PQTDBJOPEGSTUVUYA5GRX6AM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Vadim V. Lozin","submitted_at":"2017-11-23T22:43:34Z","abstract_excerpt":"Daligault, Rao and Thomass\\'e asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether the question has a positive answer for finitely defined hereditary graph classes. Apart from two stubborn cases, this has been confirmed when at most two induced subgraphs $H_1,H_2$ are forbidden. We confirm it f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08837","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-18T00:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKiDoH73dhGtU6FuquvZiDx4Up083UsqzCCFEmwmGq7Nh29BR0X0vjdmBJXXTA+9KpMsqVoQTIXi6rd3LjmPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:17.071029Z"},"content_sha256":"85330db87c39e2ae51eeab8903f7042b66b87690c5400acafc722492cad41710","schema_version":"1.0","event_id":"sha256:85330db87c39e2ae51eeab8903f7042b66b87690c5400acafc722492cad41710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/bundle.json","state_url":"https://pith.science/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/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-02T12:15:17Z","links":{"resolver":"https://pith.science/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM","bundle":"https://pith.science/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/bundle.json","state":"https://pith.science/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5PQTDBJOPEGSTUVUYA5GRX6AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P5PQTDBJOPEGSTUVUYA5GRX6AM","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":"2e602fcd143db60743cc845fbd6d8a49f9424a18e6b4adc8fa5a2650f895af68","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T22:43:34Z","title_canon_sha256":"79b9a350be939f5904bda36649bfae8c68566368e68f738ebabf1a3408f86afc"},"schema_version":"1.0","source":{"id":"1711.08837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08837","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08837v1","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08837","created_at":"2026-05-18T00:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"P5PQTDBJOPEG","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5PQTDBJOPEGSTUV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5PQTDBJ","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:85330db87c39e2ae51eeab8903f7042b66b87690c5400acafc722492cad41710","target":"graph","created_at":"2026-05-18T00:29:43Z","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":"Daligault, Rao and Thomass\\'e asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question, but their counterexample is a class that can only be characterised by infinitely many forbidden induced subgraphs. This raises the issue of whether the question has a positive answer for finitely defined hereditary graph classes. Apart from two stubborn cases, this has been confirmed when at most two induced subgraphs $H_1,H_2$ are forbidden. We confirm it f","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Vadim V. Lozin","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T22:43:34Z","title":"Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08837","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:c8495f3bc07817b4162ac115fa8154addb5441eb842b4b48c3bd9b50bda9a3d7","target":"record","created_at":"2026-05-18T00:29:43Z","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":"2e602fcd143db60743cc845fbd6d8a49f9424a18e6b4adc8fa5a2650f895af68","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-23T22:43:34Z","title_canon_sha256":"79b9a350be939f5904bda36649bfae8c68566368e68f738ebabf1a3408f86afc"},"schema_version":"1.0","source":{"id":"1711.08837","kind":"arxiv","version":1}},"canonical_sha256":"7f5f098c2973c8694e95a601d346fe0300e660035ab03afe54a3440e8fc01ae8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f5f098c2973c8694e95a601d346fe0300e660035ab03afe54a3440e8fc01ae8","first_computed_at":"2026-05-18T00:29:43.957344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:43.957344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBYvxJUQiFpTMboqrRCfoUnNiPT7Tsxkh54gZAmkZFC97gO+o/EO86mN/KZDA/Lj2Nu5pNBzsOfmnJ+r0n97Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:43.957910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8495f3bc07817b4162ac115fa8154addb5441eb842b4b48c3bd9b50bda9a3d7","sha256:85330db87c39e2ae51eeab8903f7042b66b87690c5400acafc722492cad41710"],"state_sha256":"dbe9ff3afa2ec4a19e4872b131774a3e433f20f16eaff393f4003a6af78bfe2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTPIH9O8J8pe4mhUrSvIQCUvcDPi697lc7KcirAUEgl9T/HKdHEwSd3n93s9rm2M7LeqKP6ALuknCZ6pjgBfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:15:17.073892Z","bundle_sha256":"117b02c561de8e1e511d18110119ff14f0154c4289c7334c1279d295fd1f0254"}}