{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KR7TAJXGW4YMAYHP42LKOVHNTY","short_pith_number":"pith:KR7TAJXG","schema_version":"1.0","canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","source":{"kind":"arxiv","id":"1507.01688","version":1},"attestation_state":"computed","paper":{"title":"A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Arnaud de Mesmay, Vincent Cohen-Addad","submitted_at":"2015-07-07T07:12:29Z","abstract_excerpt":"Given a graph $G$ cellularly embedded on a surface $\\Sigma$ of genus $g$, a cut graph is a subgraph of $G$ such that cutting $\\Sigma$ along $G$ yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any $\\varepsilon >0$, we show how to compute a $(1+ \\varepsilon)$ approximation of the shortest cut graph in time $f(\\varepsilon, g)n^3$.\n  Our techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded"},"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":"1507.01688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:12:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"cf3ea211c00a71b589aa0fff640361856e9b998ba7771d297096645e1992f114","abstract_canon_sha256":"09fa78be92bfee4f0ef8e88cc790515a1b21996e0fefaaa1d3f85cb14e94ed21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.675438Z","signature_b64":"Cym/9eQSFkJBRBNcfr7yoXW8PsI83lfMEmTFhYzL+fxiLRB4jBL3K0jWbrpGFfQlP9eSkKSUQK351IITl5BeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","last_reissued_at":"2026-05-18T01:37:12.674875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.674875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Arnaud de Mesmay, Vincent Cohen-Addad","submitted_at":"2015-07-07T07:12:29Z","abstract_excerpt":"Given a graph $G$ cellularly embedded on a surface $\\Sigma$ of genus $g$, a cut graph is a subgraph of $G$ such that cutting $\\Sigma$ along $G$ yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any $\\varepsilon >0$, we show how to compute a $(1+ \\varepsilon)$ approximation of the shortest cut graph in time $f(\\varepsilon, g)n^3$.\n  Our techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01688","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":"1507.01688","created_at":"2026-05-18T01:37:12.674967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01688v1","created_at":"2026-05-18T01:37:12.674967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01688","created_at":"2026-05-18T01:37:12.674967+00:00"},{"alias_kind":"pith_short_12","alias_value":"KR7TAJXGW4YM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KR7TAJXGW4YMAYHP","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KR7TAJXG","created_at":"2026-05-18T12:29:29.992203+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/KR7TAJXGW4YMAYHP42LKOVHNTY","json":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY.json","graph_json":"https://pith.science/api/pith-number/KR7TAJXGW4YMAYHP42LKOVHNTY/graph.json","events_json":"https://pith.science/api/pith-number/KR7TAJXGW4YMAYHP42LKOVHNTY/events.json","paper":"https://pith.science/paper/KR7TAJXG"},"agent_actions":{"view_html":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY","download_json":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY.json","view_paper":"https://pith.science/paper/KR7TAJXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01688&json=true","fetch_graph":"https://pith.science/api/pith-number/KR7TAJXGW4YMAYHP42LKOVHNTY/graph.json","fetch_events":"https://pith.science/api/pith-number/KR7TAJXGW4YMAYHP42LKOVHNTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/action/storage_attestation","attest_author":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/action/author_attestation","sign_citation":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/action/citation_signature","submit_replication":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/action/replication_record"}},"created_at":"2026-05-18T01:37:12.674967+00:00","updated_at":"2026-05-18T01:37:12.674967+00:00"}