{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QYH5FBJQQ2F3UDFR7DW5T4AJI7","short_pith_number":"pith:QYH5FBJQ","schema_version":"1.0","canonical_sha256":"860fd28530868bba0cb1f8edd9f00947c79fca130d091d76f12d2defaebe7ac1","source":{"kind":"arxiv","id":"0911.4366","version":2},"attestation_state":"computed","paper":{"title":"Hitting Diamonds and Growing Cacti","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Samuel Fiorini, Ugo Pietropaoli","submitted_at":"2009-11-23T11:14:06Z","abstract_excerpt":"We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primal-dual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is \\Theta(\\log n), where n denotes the number of vertices in the graph."},"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":"0911.4366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-11-23T11:14:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dc336ab3ff050eeed8b9a178523f30785839e3356e06c65fb88820507abc93d5","abstract_canon_sha256":"c3d58fa73e2f82f259106e01d112bc10118f904146d5dcee9e065cdae6fbf278"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:37.546630Z","signature_b64":"2zq3CUg8qFbYcbPFnkSrNntqmXYQMUhr0iCJDV9szGzM3J/DfS9V97OigYKqHwf+uorzoj7k8O2V1hLlyd5kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860fd28530868bba0cb1f8edd9f00947c79fca130d091d76f12d2defaebe7ac1","last_reissued_at":"2026-05-18T02:10:37.545982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:37.545982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting Diamonds and Growing Cacti","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Samuel Fiorini, Ugo Pietropaoli","submitted_at":"2009-11-23T11:14:06Z","abstract_excerpt":"We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primal-dual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is \\Theta(\\log n), where n denotes the number of vertices in the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4366","kind":"arxiv","version":2},"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":"0911.4366","created_at":"2026-05-18T02:10:37.546104+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4366v2","created_at":"2026-05-18T02:10:37.546104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4366","created_at":"2026-05-18T02:10:37.546104+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYH5FBJQQ2F3","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYH5FBJQQ2F3UDFR","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYH5FBJQ","created_at":"2026-05-18T12:26:01.383474+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/QYH5FBJQQ2F3UDFR7DW5T4AJI7","json":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7.json","graph_json":"https://pith.science/api/pith-number/QYH5FBJQQ2F3UDFR7DW5T4AJI7/graph.json","events_json":"https://pith.science/api/pith-number/QYH5FBJQQ2F3UDFR7DW5T4AJI7/events.json","paper":"https://pith.science/paper/QYH5FBJQ"},"agent_actions":{"view_html":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7","download_json":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7.json","view_paper":"https://pith.science/paper/QYH5FBJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4366&json=true","fetch_graph":"https://pith.science/api/pith-number/QYH5FBJQQ2F3UDFR7DW5T4AJI7/graph.json","fetch_events":"https://pith.science/api/pith-number/QYH5FBJQQ2F3UDFR7DW5T4AJI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7/action/storage_attestation","attest_author":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7/action/author_attestation","sign_citation":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7/action/citation_signature","submit_replication":"https://pith.science/pith/QYH5FBJQQ2F3UDFR7DW5T4AJI7/action/replication_record"}},"created_at":"2026-05-18T02:10:37.546104+00:00","updated_at":"2026-05-18T02:10:37.546104+00:00"}