{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2NGAH2EBC675B2ESI6CAFU7KLA","short_pith_number":"pith:2NGAH2EB","schema_version":"1.0","canonical_sha256":"d34c03e88117bfd0e892478402d3ea580df4239ed4f0ae1d71b6c522b18c8c66","source":{"kind":"arxiv","id":"1309.1553","version":1},"attestation_state":"computed","paper":{"title":"Finding an induced subdivision of a digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Havet, J{\\o}rgen Bang-Jensen, Nicolas Trotignon","submitted_at":"2013-09-06T07:19:51Z","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."},"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":"1309.1553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-06T07:19:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"38ab4ea936a1342b9cda1225bb9400120f04decf621c011c79b5a108142d765d","abstract_canon_sha256":"a56163e2ea92ab521ba5510beded23e5d215731d01addc5d06c61d741df665fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:19.625176Z","signature_b64":"u4KQciuqpkn/bYdJX40y2uNroBKgae5PivJB6+09d739FnZNzBk2haYrPTr/w+uQmL1WRkPhU0smkyY4AOknCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34c03e88117bfd0e892478402d3ea580df4239ed4f0ae1d71b6c522b18c8c66","last_reissued_at":"2026-05-18T01:18:19.624518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:19.624518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding an induced subdivision of a digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Havet, J{\\o}rgen Bang-Jensen, Nicolas Trotignon","submitted_at":"2013-09-06T07:19:51Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1553","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.1553","created_at":"2026-05-18T01:18:19.624611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1553v1","created_at":"2026-05-18T01:18:19.624611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1553","created_at":"2026-05-18T01:18:19.624611+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NGAH2EBC675","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NGAH2EBC675B2ES","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NGAH2EB","created_at":"2026-05-18T12:27:32.513160+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/2NGAH2EBC675B2ESI6CAFU7KLA","json":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA.json","graph_json":"https://pith.science/api/pith-number/2NGAH2EBC675B2ESI6CAFU7KLA/graph.json","events_json":"https://pith.science/api/pith-number/2NGAH2EBC675B2ESI6CAFU7KLA/events.json","paper":"https://pith.science/paper/2NGAH2EB"},"agent_actions":{"view_html":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA","download_json":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA.json","view_paper":"https://pith.science/paper/2NGAH2EB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1553&json=true","fetch_graph":"https://pith.science/api/pith-number/2NGAH2EBC675B2ESI6CAFU7KLA/graph.json","fetch_events":"https://pith.science/api/pith-number/2NGAH2EBC675B2ESI6CAFU7KLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA/action/storage_attestation","attest_author":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA/action/author_attestation","sign_citation":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA/action/citation_signature","submit_replication":"https://pith.science/pith/2NGAH2EBC675B2ESI6CAFU7KLA/action/replication_record"}},"created_at":"2026-05-18T01:18:19.624611+00:00","updated_at":"2026-05-18T01:18:19.624611+00:00"}