{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RV324H2GX5DUCJTGTUCNTWP5YP","short_pith_number":"pith:RV324H2G","schema_version":"1.0","canonical_sha256":"8d77ae1f46bf474126669d04d9d9fdc3e88b641f12339b922e7e6836128d16cc","source":{"kind":"arxiv","id":"2311.01026","version":4},"attestation_state":"computed","paper":{"title":"A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Hao Sun","submitted_at":"2023-11-02T06:38:26Z","abstract_excerpt":"The minimum directed feedback vertex set problem consists in finding the minimum set of vertices that should be removed in order to make a directed graph acyclic. This is a well-known NP-hard optimization problem with applications in various fields, such as VLSI chip design, bioinformatics and transaction processing deadlock prevention and node-weighted network design. We show a constant factor approximation for the directed feedback vertex set problem in graphs of bounded genus."},"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":"2311.01026","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-02T06:38:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"650058ddc19419f60c95cea9104b4df45bcf3cbca4715bd86cdfa3e89d0b7cb7","abstract_canon_sha256":"c5110796c69f21be459626dcf1b76e8849515ec7ecbf43625c5be971e984bd0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:01.512336Z","signature_b64":"D+mIr38Sroj6UIT/VQskeeDsP9E9xTM9oh5HhWlBO7/DlCoI7BN5htbMXBGCcFenREQP/sp05gdwaySnSMy8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d77ae1f46bf474126669d04d9d9fdc3e88b641f12339b922e7e6836128d16cc","last_reissued_at":"2026-07-05T08:18:01.511840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:01.511840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Hao Sun","submitted_at":"2023-11-02T06:38:26Z","abstract_excerpt":"The minimum directed feedback vertex set problem consists in finding the minimum set of vertices that should be removed in order to make a directed graph acyclic. This is a well-known NP-hard optimization problem with applications in various fields, such as VLSI chip design, bioinformatics and transaction processing deadlock prevention and node-weighted network design. We show a constant factor approximation for the directed feedback vertex set problem in graphs of bounded genus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01026","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.01026/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.01026","created_at":"2026-07-05T08:18:01.511898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01026v4","created_at":"2026-07-05T08:18:01.511898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01026","created_at":"2026-07-05T08:18:01.511898+00:00"},{"alias_kind":"pith_short_12","alias_value":"RV324H2GX5DU","created_at":"2026-07-05T08:18:01.511898+00:00"},{"alias_kind":"pith_short_16","alias_value":"RV324H2GX5DUCJTG","created_at":"2026-07-05T08:18:01.511898+00:00"},{"alias_kind":"pith_short_8","alias_value":"RV324H2G","created_at":"2026-07-05T08:18:01.511898+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/RV324H2GX5DUCJTGTUCNTWP5YP","json":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP.json","graph_json":"https://pith.science/api/pith-number/RV324H2GX5DUCJTGTUCNTWP5YP/graph.json","events_json":"https://pith.science/api/pith-number/RV324H2GX5DUCJTGTUCNTWP5YP/events.json","paper":"https://pith.science/paper/RV324H2G"},"agent_actions":{"view_html":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP","download_json":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP.json","view_paper":"https://pith.science/paper/RV324H2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01026&json=true","fetch_graph":"https://pith.science/api/pith-number/RV324H2GX5DUCJTGTUCNTWP5YP/graph.json","fetch_events":"https://pith.science/api/pith-number/RV324H2GX5DUCJTGTUCNTWP5YP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP/action/storage_attestation","attest_author":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP/action/author_attestation","sign_citation":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP/action/citation_signature","submit_replication":"https://pith.science/pith/RV324H2GX5DUCJTGTUCNTWP5YP/action/replication_record"}},"created_at":"2026-07-05T08:18:01.511898+00:00","updated_at":"2026-07-05T08:18:01.511898+00:00"}