{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KR7TAJXGW4YMAYHP42LKOVHNTY","short_pith_number":"pith:KR7TAJXG","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"},"canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","source":{"kind":"arxiv","id":"1507.01688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01688","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01688v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01688","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"KR7TAJXGW4YM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KR7TAJXGW4YMAYHP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KR7TAJXG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KR7TAJXGW4YMAYHP42LKOVHNTY","target":"record","payload":{"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"},"canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","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"},"source_kind":"arxiv","source_id":"1507.01688","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjMUULt3vAIFIOdgINWft34LBpuXAm2aimZ/koHE3z/u8NX+4i3G+1cHAvQZ4r6tjbngXjehSBtYv22uEPODAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:17:05.722999Z"},"content_sha256":"0cb7b663975a695d9c4c6fa3b14f4b94669129ea0834cde7bed5ace9532dd8ce","schema_version":"1.0","event_id":"sha256:0cb7b663975a695d9c4c6fa3b14f4b94669129ea0834cde7bed5ace9532dd8ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KR7TAJXGW4YMAYHP42LKOVHNTY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa7+pWk9kkX7ObV7jau2RT8eOTMuXmBdtXvUcxqqXnOqNShRy0sBJomu88LQDgbdwpZJm2V+49s47wxtHsuGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:17:05.723368Z"},"content_sha256":"4d2d5f053c693a28b1a61d497bcaae0afca30dd3675b3f3af8e43c546619852d","schema_version":"1.0","event_id":"sha256:4d2d5f053c693a28b1a61d497bcaae0afca30dd3675b3f3af8e43c546619852d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/bundle.json","state_url":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T11:17:05Z","links":{"resolver":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY","bundle":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/bundle.json","state":"https://pith.science/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KR7TAJXGW4YMAYHP42LKOVHNTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KR7TAJXGW4YMAYHP42LKOVHNTY","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":"09fa78be92bfee4f0ef8e88cc790515a1b21996e0fefaaa1d3f85cb14e94ed21","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:12:29Z","title_canon_sha256":"cf3ea211c00a71b589aa0fff640361856e9b998ba7771d297096645e1992f114"},"schema_version":"1.0","source":{"id":"1507.01688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01688","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01688v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01688","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"KR7TAJXGW4YM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KR7TAJXGW4YMAYHP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KR7TAJXG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:4d2d5f053c693a28b1a61d497bcaae0afca30dd3675b3f3af8e43c546619852d","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"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","authors_text":"Arnaud de Mesmay, Vincent Cohen-Addad","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:12:29Z","title":"A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01688","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:0cb7b663975a695d9c4c6fa3b14f4b94669129ea0834cde7bed5ace9532dd8ce","target":"record","created_at":"2026-05-18T01:37:12Z","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":"09fa78be92bfee4f0ef8e88cc790515a1b21996e0fefaaa1d3f85cb14e94ed21","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:12:29Z","title_canon_sha256":"cf3ea211c00a71b589aa0fff640361856e9b998ba7771d297096645e1992f114"},"schema_version":"1.0","source":{"id":"1507.01688","kind":"arxiv","version":1}},"canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"547f3026e6b730c060efe696a754ed9e016806f9a831ee99f2c55fdd6680d20c","first_computed_at":"2026-05-18T01:37:12.674875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.674875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cym/9eQSFkJBRBNcfr7yoXW8PsI83lfMEmTFhYzL+fxiLRB4jBL3K0jWbrpGFfQlP9eSkKSUQK351IITl5BeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.675438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cb7b663975a695d9c4c6fa3b14f4b94669129ea0834cde7bed5ace9532dd8ce","sha256:4d2d5f053c693a28b1a61d497bcaae0afca30dd3675b3f3af8e43c546619852d"],"state_sha256":"28cad8eb54a227112e31d06893b95e2257b4a4663359eb2337b61e4ce89f3f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/6YVd/haI7nf31IkpHMEVHL4E34ZCcppojx7MInB30GQGW1me4ba5ecPf2DGzdFJchUVC+5prSprPzLOKCHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:17:05.725326Z","bundle_sha256":"662cfa72b3fd6e9e1dc3548d41b1d12467c370d43231a49404082aee3f87ad49"}}