{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4ZYYYZ3MA4T2A4RLDFLHD5TRU5","short_pith_number":"pith:4ZYYYZ3M","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"},"canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","source":{"kind":"arxiv","id":"1508.04725","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04725","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04725v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04725","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"4ZYYYZ3MA4T2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ZYYYZ3MA4T2A4RL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ZYYYZ3M","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4ZYYYZ3MA4T2A4RLDFLHD5TRU5","target":"record","payload":{"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"},"canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","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"},"source_kind":"arxiv","source_id":"1508.04725","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-18T01:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgWmukUR9EihCJTytWHcLXQ2ybauge11vWkjdfar7OYFXg4wH1dy+zyLJcsyLn/v8jYzOhZEccfeAe242tU5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:20:30.775523Z"},"content_sha256":"c4434bfc68b2c565ad9518346f27c92505d771891b531a55ddd2a936885a4f11","schema_version":"1.0","event_id":"sha256:c4434bfc68b2c565ad9518346f27c92505d771891b531a55ddd2a936885a4f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4ZYYYZ3MA4T2A4RLDFLHD5TRU5","target":"graph","payload":{"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"},"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-18T01:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mk8uIruLvE8IgrB2YYczMGdaoH3zU5xNahA6sAhn4XOF/dgpvSPD/+URGW9FlOt8xnQAm8dNWhVStQ11mIeuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:20:30.775879Z"},"content_sha256":"02aabad298efa8fc56a66f79f6d40146c73b37fc1e21f9b1444c86db43afc386","schema_version":"1.0","event_id":"sha256:02aabad298efa8fc56a66f79f6d40146c73b37fc1e21f9b1444c86db43afc386"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/bundle.json","state_url":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/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-22T11:20:30Z","links":{"resolver":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5","bundle":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/bundle.json","state":"https://pith.science/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZYYYZ3MA4T2A4RLDFLHD5TRU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4ZYYYZ3MA4T2A4RLDFLHD5TRU5","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":"2c1f5c87334ecd429b4ed6c5a29c85a279685591272fa84b5e1489cdfeac632b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-19T18:06:12Z","title_canon_sha256":"85bf34fe38b8437ed8b68f18b2b8f396d16f0aeb06686494dbc81bb08e981f74"},"schema_version":"1.0","source":{"id":"1508.04725","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04725","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04725v2","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04725","created_at":"2026-05-18T01:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"4ZYYYZ3MA4T2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ZYYYZ3MA4T2A4RL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ZYYYZ3M","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:02aabad298efa8fc56a66f79f6d40146c73b37fc1e21f9b1444c86db43afc386","target":"graph","created_at":"2026-05-18T01:19:18Z","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":"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","authors_text":"Du\\v{s}an Knop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-19T18:06:12Z","title":"Partitioning graphs into induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04725","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:c4434bfc68b2c565ad9518346f27c92505d771891b531a55ddd2a936885a4f11","target":"record","created_at":"2026-05-18T01:19:18Z","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":"2c1f5c87334ecd429b4ed6c5a29c85a279685591272fa84b5e1489cdfeac632b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-19T18:06:12Z","title_canon_sha256":"85bf34fe38b8437ed8b68f18b2b8f396d16f0aeb06686494dbc81bb08e981f74"},"schema_version":"1.0","source":{"id":"1508.04725","kind":"arxiv","version":2}},"canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6718c676c0727a0722b195671f671a74b4cdad68f2c86699a72d767d9d3d31e","first_computed_at":"2026-05-18T01:19:18.545244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:18.545244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGP7bu/W5zNGoklF/GumZQasLuIs0jP14wg4bLB3UXpi99psd+m1AIEg6jse/3yXN6u/8Rs5juOJTYCUopuRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:18.545646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04725","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4434bfc68b2c565ad9518346f27c92505d771891b531a55ddd2a936885a4f11","sha256:02aabad298efa8fc56a66f79f6d40146c73b37fc1e21f9b1444c86db43afc386"],"state_sha256":"d9878d9848d23d1a32fb7e7781e7faddf2e9fd510551d9ad9c674821488c6760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bnrj1oRqBAWGCZQuJ76uwxjJIVEW1DPTDCC7nqHdmGiWFRcGqiQeCCyFXCSoormam7RSPsmam3E9TwsSx9QCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:20:30.777893Z","bundle_sha256":"a933cf6aaf31b9f07ac91e4e8f04407e641c50ec83de7f00394491b1b64c51a5"}}