{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2NGAH2EBC675B2ESI6CAFU7KLA","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":"a56163e2ea92ab521ba5510beded23e5d215731d01addc5d06c61d741df665fe","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T07:19:51Z","title_canon_sha256":"38ab4ea936a1342b9cda1225bb9400120f04decf621c011c79b5a108142d765d"},"schema_version":"1.0","source":{"id":"1309.1553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1553","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1553v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1553","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"2NGAH2EBC675","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2NGAH2EBC675B2ES","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2NGAH2EB","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:0ed337f239c5f03ca132f9a73eac1e3e88f48765a1e0acd2215f33cb0280c2c4","target":"graph","created_at":"2026-05-18T01:18:19Z","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 consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? The complexity of this problem depends on $D$ and on whether $G$ must be an oriented graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs.","authors_text":"Fr\\'ed\\'eric Havet, J{\\o}rgen Bang-Jensen, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T07:19:51Z","title":"Finding an induced subdivision of a digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1553","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:36d4b9504662e3a4fcd10c1dc1d5803f4be39510d9c3657a464b68eaf61f6ff3","target":"record","created_at":"2026-05-18T01:18:19Z","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":"a56163e2ea92ab521ba5510beded23e5d215731d01addc5d06c61d741df665fe","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T07:19:51Z","title_canon_sha256":"38ab4ea936a1342b9cda1225bb9400120f04decf621c011c79b5a108142d765d"},"schema_version":"1.0","source":{"id":"1309.1553","kind":"arxiv","version":1}},"canonical_sha256":"d34c03e88117bfd0e892478402d3ea580df4239ed4f0ae1d71b6c522b18c8c66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d34c03e88117bfd0e892478402d3ea580df4239ed4f0ae1d71b6c522b18c8c66","first_computed_at":"2026-05-18T01:18:19.624518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:19.624518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u4KQciuqpkn/bYdJX40y2uNroBKgae5PivJB6+09d739FnZNzBk2haYrPTr/w+uQmL1WRkPhU0smkyY4AOknCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:19.625176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36d4b9504662e3a4fcd10c1dc1d5803f4be39510d9c3657a464b68eaf61f6ff3","sha256:0ed337f239c5f03ca132f9a73eac1e3e88f48765a1e0acd2215f33cb0280c2c4"],"state_sha256":"6dd3ac66af53986702547e35b9fab880bd99cab8bb22e0b0884fcc367ddd810d"}