{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UVGKIGYQXISA2JAMTB6TTVYU7D","short_pith_number":"pith:UVGKIGYQ","canonical_record":{"source":{"id":"1503.00704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-02T20:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"36ed5497206423ae12ffd7d00b1865537281e534909e26dcbe4f4c1326e24516","abstract_canon_sha256":"e48fbe040b014b371dc94e11296a468a2d1abc445716bc25a6e72e09779e256c"},"schema_version":"1.0"},"canonical_sha256":"a54ca41b10ba240d240c987d39d714f8dcd4111d586e8f2553337b3f1b5ced13","source":{"kind":"arxiv","id":"1503.00704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00704","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00704v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00704","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"UVGKIGYQXISA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVGKIGYQXISA2JAM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVGKIGYQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UVGKIGYQXISA2JAMTB6TTVYU7D","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-02T20:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"36ed5497206423ae12ffd7d00b1865537281e534909e26dcbe4f4c1326e24516","abstract_canon_sha256":"e48fbe040b014b371dc94e11296a468a2d1abc445716bc25a6e72e09779e256c"},"schema_version":"1.0"},"canonical_sha256":"a54ca41b10ba240d240c987d39d714f8dcd4111d586e8f2553337b3f1b5ced13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:49.479854Z","signature_b64":"sHGGomTE9Kto6M4LexveYVUbDgxzUlMCpqEb5+0sJVxw+ZfRCa5We8m5xbxJ2vQcNs9nhKjApXzIrwyPT57QAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54ca41b10ba240d240c987d39d714f8dcd4111d586e8f2553337b3f1b5ced13","last_reissued_at":"2026-05-18T02:25:49.479443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:49.479443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00704","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:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTjHqPWA2wNGhyUdEkWUrd4bKjgyqBjSio2AW4WWY2hj2hi5vL4POyK8xFiaiYPgYCG/p66UFlL9XjcCFkilAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:01:02.772718Z"},"content_sha256":"4a4a763680327af446cf63bb8d7d549dc57ca54966ca6af5351fe343710f125c","schema_version":"1.0","event_id":"sha256:4a4a763680327af446cf63bb8d7d549dc57ca54966ca6af5351fe343710f125c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UVGKIGYQXISA2JAMTB6TTVYU7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial kernelization for removing induced claws and diamonds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Marcin Pilipczuk, Marcin Wrochna, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2015-03-02T20:49:51Z","abstract_excerpt":"A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique.\n  In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00704","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:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbuo9mw/zTFM2FOwa3RpfW9o2+kxsY0KywPsJApOrJzOsOEA9hTQZMr4CAeRHPDOLPgC0qzfSaqzuxenivfPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:01:02.773433Z"},"content_sha256":"eb76dc2a72bece29d2b49c1873299fe0fe7e8616de19700bf391462e69bec561","schema_version":"1.0","event_id":"sha256:eb76dc2a72bece29d2b49c1873299fe0fe7e8616de19700bf391462e69bec561"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/bundle.json","state_url":"https://pith.science/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/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-10T07:01:02Z","links":{"resolver":"https://pith.science/pith/UVGKIGYQXISA2JAMTB6TTVYU7D","bundle":"https://pith.science/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/bundle.json","state":"https://pith.science/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVGKIGYQXISA2JAMTB6TTVYU7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVGKIGYQXISA2JAMTB6TTVYU7D","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":"e48fbe040b014b371dc94e11296a468a2d1abc445716bc25a6e72e09779e256c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-02T20:49:51Z","title_canon_sha256":"36ed5497206423ae12ffd7d00b1865537281e534909e26dcbe4f4c1326e24516"},"schema_version":"1.0","source":{"id":"1503.00704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00704","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00704v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00704","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"UVGKIGYQXISA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVGKIGYQXISA2JAM","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVGKIGYQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:eb76dc2a72bece29d2b49c1873299fe0fe7e8616de19700bf391462e69bec561","target":"graph","created_at":"2026-05-18T02:25:49Z","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":"A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique.\n  In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edg","authors_text":"Erik Jan van Leeuwen, Marcin Pilipczuk, Marcin Wrochna, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-02T20:49:51Z","title":"Polynomial kernelization for removing induced claws and diamonds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00704","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:4a4a763680327af446cf63bb8d7d549dc57ca54966ca6af5351fe343710f125c","target":"record","created_at":"2026-05-18T02:25:49Z","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":"e48fbe040b014b371dc94e11296a468a2d1abc445716bc25a6e72e09779e256c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-02T20:49:51Z","title_canon_sha256":"36ed5497206423ae12ffd7d00b1865537281e534909e26dcbe4f4c1326e24516"},"schema_version":"1.0","source":{"id":"1503.00704","kind":"arxiv","version":1}},"canonical_sha256":"a54ca41b10ba240d240c987d39d714f8dcd4111d586e8f2553337b3f1b5ced13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a54ca41b10ba240d240c987d39d714f8dcd4111d586e8f2553337b3f1b5ced13","first_computed_at":"2026-05-18T02:25:49.479443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:49.479443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHGGomTE9Kto6M4LexveYVUbDgxzUlMCpqEb5+0sJVxw+ZfRCa5We8m5xbxJ2vQcNs9nhKjApXzIrwyPT57QAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:49.479854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a4a763680327af446cf63bb8d7d549dc57ca54966ca6af5351fe343710f125c","sha256:eb76dc2a72bece29d2b49c1873299fe0fe7e8616de19700bf391462e69bec561"],"state_sha256":"5737b250fc0c41dd18586a54b35d674c24fb0a89d8ab3eb20b674a1d8e66ab91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8alsOa4r5v6QmiixiligAuPC6dQorJ65bPdf29VSRx3hAG+E/3ykCGt4B0OphXAOi8LaWVdC2mbKFe6oxADCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:01:02.777247Z","bundle_sha256":"101697a2d1ce60fb4a56648601ad9c11a659eaf8fe1d7457ced08686f3898b14"}}