{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4ZYYYZ3MA4T2A4RLDFLHD5TRU5","short_pith_number":"pith:4ZYYYZ3M","schema_version":"1.0","canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","source":{"kind":"arxiv","id":"1508.04725","version":2},"attestation_state":"computed","paper":{"title":"Partitioning graphs into induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop","submitted_at":"2015-08-19T18:06:12Z","abstract_excerpt":"We study the Induced $H$ Partition problem from the parameterized complexity point of view. In the Induced $H$ Partition problem the task is to partition vertices of a graph $G$ into sets $V_1,V_2,\\dots,V_n$ such that the graph $H$ is isomorphic to the subgraph of $G$ induced by each set $V_i$ for $i = 1,2,\\dots,n.$ The pattern graph $H$ is fixed.\n  For the parametrization we consider three distinct structural parameters of the graph $G$ - namely the tree-width, the neighborhood diversity, and the modular-width. For the parametrization by the neighborhood diversity we obtain an FPT algorithm f"},"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":"1508.04725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-19T18:06:12Z","cross_cats_sorted":[],"title_canon_sha256":"85bf34fe38b8437ed8b68f18b2b8f396d16f0aeb06686494dbc81bb08e981f74","abstract_canon_sha256":"2c1f5c87334ecd429b4ed6c5a29c85a279685591272fa84b5e1489cdfeac632b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:18.545646Z","signature_b64":"SGP7bu/W5zNGoklF/GumZQasLuIs0jP14wg4bLB3UXpi99psd+m1AIEg6jse/3yXN6u/8Rs5juOJTYCUopuRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","last_reissued_at":"2026-05-18T01:19:18.545244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:18.545244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning graphs into induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop","submitted_at":"2015-08-19T18:06:12Z","abstract_excerpt":"We study the Induced $H$ Partition problem from the parameterized complexity point of view. In the Induced $H$ Partition problem the task is to partition vertices of a graph $G$ into sets $V_1,V_2,\\dots,V_n$ such that the graph $H$ is isomorphic to the subgraph of $G$ induced by each set $V_i$ for $i = 1,2,\\dots,n.$ The pattern graph $H$ is fixed.\n  For the parametrization we consider three distinct structural parameters of the graph $G$ - namely the tree-width, the neighborhood diversity, and the modular-width. For the parametrization by the neighborhood diversity we obtain an FPT algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04725","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.04725","created_at":"2026-05-18T01:19:18.545308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04725v2","created_at":"2026-05-18T01:19:18.545308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04725","created_at":"2026-05-18T01:19:18.545308+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZYYYZ3MA4T2","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZYYYZ3MA4T2A4RL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZYYYZ3M","created_at":"2026-05-18T12:29:05.191682+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/4ZYYYZ3MA4T2A4RLDFLHD5TRU5","json":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5.json","graph_json":"https://pith.science/api/pith-number/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/graph.json","events_json":"https://pith.science/api/pith-number/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/events.json","paper":"https://pith.science/paper/4ZYYYZ3M"},"agent_actions":{"view_html":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5","download_json":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5.json","view_paper":"https://pith.science/paper/4ZYYYZ3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04725&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/action/storage_attestation","attest_author":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/action/author_attestation","sign_citation":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/action/citation_signature","submit_replication":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/action/replication_record"}},"created_at":"2026-05-18T01:19:18.545308+00:00","updated_at":"2026-05-18T01:19:18.545308+00:00"}