{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4AXZJA53H5EZX2NVBOTA3JJ2N","short_pith_number":"pith:Z4AXZJA5","canonical_record":{"source":{"id":"1804.03485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-10T12:50:19Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"486833d1745b8cc8a6c6618346063a9437b48e2cc6f0d0662b26e9db31fe894b","abstract_canon_sha256":"28ceb6ee1435e4cbd2dbf7f5ecf1188c51d8dd4644c09f09e7c9e246cb68cdd6"},"schema_version":"1.0"},"canonical_sha256":"cf017ca41dd9fa4cdf4da85d306d29d3551c3385ff7777d804622db246322779","source":{"kind":"arxiv","id":"1804.03485","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03485","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03485v3","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03485","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"Z4AXZJA53H5E","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4AXZJA53H5EZX2N","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4AXZJA5","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4AXZJA53H5EZX2NVBOTA3JJ2N","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-10T12:50:19Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"486833d1745b8cc8a6c6618346063a9437b48e2cc6f0d0662b26e9db31fe894b","abstract_canon_sha256":"28ceb6ee1435e4cbd2dbf7f5ecf1188c51d8dd4644c09f09e7c9e246cb68cdd6"},"schema_version":"1.0"},"canonical_sha256":"cf017ca41dd9fa4cdf4da85d306d29d3551c3385ff7777d804622db246322779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:14.605629Z","signature_b64":"5P0B+ijYs36UNy55vy6ve5CKC1hbUc2DsjUo6o1Qhxqt0Iw2aHEpFMn/flmzIPYqWyPFBbQCQ7g+LpfVcQlYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf017ca41dd9fa4cdf4da85d306d29d3551c3385ff7777d804622db246322779","last_reissued_at":"2026-05-17T23:51:14.605164Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:14.605164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03485","source_version":3,"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-17T23:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vypj60EdOTSJXf1+C+98WkRKDsaRGOqfhlm13IlWW8hZNWl+l1wOxbO1cmKQ2UhrfBzn+0LGXIVzLABePkLyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:46.332950Z"},"content_sha256":"d96cdc3df575ed059e858b27a39ca401d9aecd14d6b9bcc9c411b5739a9f254b","schema_version":"1.0","event_id":"sha256:d96cdc3df575ed059e858b27a39ca401d9aecd14d6b9bcc9c411b5739a9f254b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4AXZJA53H5EZX2NVBOTA3JJ2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Extremal Bound on the Lov\\'{a}sz Cactus Number in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Schmid, Parinya Chalermsook, Sumedha Uniyal","submitted_at":"2018-04-10T12:50:19Z","abstract_excerpt":"A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\\frac{1}{6}$ fraction of the triangular faces of $G$. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing \"dense planar structures\" inside any graph: (i) A $\\frac{1}{6}$ approximation algorithm for, given any graph $G$, finding a planar subgraph with a maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03485","kind":"arxiv","version":3},"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-17T23:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDNkozTpEKB15q4Uvq7NrleyeIeEYgY3Ng7neItmLfoFVPBuM5haDwUWdjX3Juiqujh7EuvPZl0ScDFUf7/PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:46.333598Z"},"content_sha256":"d074eead5238847ab497081e1cb74188cd1af403434fbaa0d4b953541640ae01","schema_version":"1.0","event_id":"sha256:d074eead5238847ab497081e1cb74188cd1af403434fbaa0d4b953541640ae01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/bundle.json","state_url":"https://pith.science/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/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-25T17:44:46Z","links":{"resolver":"https://pith.science/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N","bundle":"https://pith.science/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/bundle.json","state":"https://pith.science/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4AXZJA53H5EZX2NVBOTA3JJ2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4AXZJA53H5EZX2NVBOTA3JJ2N","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":"28ceb6ee1435e4cbd2dbf7f5ecf1188c51d8dd4644c09f09e7c9e246cb68cdd6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-10T12:50:19Z","title_canon_sha256":"486833d1745b8cc8a6c6618346063a9437b48e2cc6f0d0662b26e9db31fe894b"},"schema_version":"1.0","source":{"id":"1804.03485","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03485","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03485v3","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03485","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"Z4AXZJA53H5E","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4AXZJA53H5EZX2N","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4AXZJA5","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:d074eead5238847ab497081e1cb74188cd1af403434fbaa0d4b953541640ae01","target":"graph","created_at":"2026-05-17T23:51:14Z","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":"A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\\frac{1}{6}$ fraction of the triangular faces of $G$. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing \"dense planar structures\" inside any graph: (i) A $\\frac{1}{6}$ approximation algorithm for, given any graph $G$, finding a planar subgraph with a maxi","authors_text":"Andreas Schmid, Parinya Chalermsook, Sumedha Uniyal","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-10T12:50:19Z","title":"A Tight Extremal Bound on the Lov\\'{a}sz Cactus Number in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03485","kind":"arxiv","version":3},"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:d96cdc3df575ed059e858b27a39ca401d9aecd14d6b9bcc9c411b5739a9f254b","target":"record","created_at":"2026-05-17T23:51:14Z","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":"28ceb6ee1435e4cbd2dbf7f5ecf1188c51d8dd4644c09f09e7c9e246cb68cdd6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-10T12:50:19Z","title_canon_sha256":"486833d1745b8cc8a6c6618346063a9437b48e2cc6f0d0662b26e9db31fe894b"},"schema_version":"1.0","source":{"id":"1804.03485","kind":"arxiv","version":3}},"canonical_sha256":"cf017ca41dd9fa4cdf4da85d306d29d3551c3385ff7777d804622db246322779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf017ca41dd9fa4cdf4da85d306d29d3551c3385ff7777d804622db246322779","first_computed_at":"2026-05-17T23:51:14.605164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:14.605164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5P0B+ijYs36UNy55vy6ve5CKC1hbUc2DsjUo6o1Qhxqt0Iw2aHEpFMn/flmzIPYqWyPFBbQCQ7g+LpfVcQlYBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:14.605629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03485","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d96cdc3df575ed059e858b27a39ca401d9aecd14d6b9bcc9c411b5739a9f254b","sha256:d074eead5238847ab497081e1cb74188cd1af403434fbaa0d4b953541640ae01"],"state_sha256":"e3a586b9ef77b0d2e0c898e98d11140db971fd1df6b38524f3fa2ac9db752aa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Gm1Q5rIZehHS/bFcIMIRDyNh5iXRqz22UMDmXtYD2VEmxLKlJkc4lHriGiNbyoNRMCvmLJgh08dsU3k8mNHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:44:46.337215Z","bundle_sha256":"914f54e58460f466f27c364ccbd004a5216c89880acc8e86c76dc07fb1c9caf6"}}