{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B4PRZLLTHVV6HXJA5BRDTGKAOF","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":"c664fe2bf087ef04bb088873ee3487058a93b1141627ff263cddbba629bf9c81","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T10:51:08Z","title_canon_sha256":"4ded11b79697240e2595f4f04e05f398d5c1ca04f89f865f87616b78aca83bae"},"schema_version":"1.0","source":{"id":"1309.0971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0971","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0971v1","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0971","created_at":"2026-05-18T03:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"B4PRZLLTHVV6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B4PRZLLTHVV6HXJA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B4PRZLLT","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:2930ad62cba339387d093abc14258ad41d69e494a6d996fee9fa0b0be5c74157","target":"graph","created_at":"2026-05-18T03:14:09Z","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":"An \\emph{s-graph} is a graph with two kinds of edges: \\emph{subdivisible} edges and \\emph{real} edges. A \\emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at least one). Given an s-graph $B$, we study the decision problem $\\Pi_B$ whose instance is a graph $G$ and question is \"Does $G$ contain a realisation of $B$ as an induced subgraph?\". For several $B$'s, the complexity of $\\Pi_B$ is known and here we give the complexity for several more. Our NP-completeness proofs for $\\Pi_B$'s rely on the NP-completeness proo","authors_text":"Benjamin L\\'ev\\^eque, David Y. Lin, Fr\\'ed\\'eric Maffray, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T10:51:08Z","title":"Detecting induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0971","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:64b9c18fdab21099b64d879df2635ba7d71e640a6715292d22bdbccfb7daf51b","target":"record","created_at":"2026-05-18T03:14:09Z","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":"c664fe2bf087ef04bb088873ee3487058a93b1141627ff263cddbba629bf9c81","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-04T10:51:08Z","title_canon_sha256":"4ded11b79697240e2595f4f04e05f398d5c1ca04f89f865f87616b78aca83bae"},"schema_version":"1.0","source":{"id":"1309.0971","kind":"arxiv","version":1}},"canonical_sha256":"0f1f1cad733d6be3dd20e8623999407149c8b9cb14a354958d1aee8a7bbed2b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1f1cad733d6be3dd20e8623999407149c8b9cb14a354958d1aee8a7bbed2b0","first_computed_at":"2026-05-18T03:14:09.460812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:09.460812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M1BtjsIpELNpVN6Q+XWrMPIlkCFi6Fc+mrXQ4NRboE/cCj67BDWCxOtCmxbYB0pDmjov82+PwF40TDhRlPFxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:09.461328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64b9c18fdab21099b64d879df2635ba7d71e640a6715292d22bdbccfb7daf51b","sha256:2930ad62cba339387d093abc14258ad41d69e494a6d996fee9fa0b0be5c74157"],"state_sha256":"f60c817d800d7fcb815c7e3e159e7d941bc6c362ccf6f64b2cdfd197e724842c"}