{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KKZZT2SEOEKMCDQL2PWGE752KP","short_pith_number":"pith:KKZZT2SE","schema_version":"1.0","canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","source":{"kind":"arxiv","id":"2606.06298","version":1},"attestation_state":"computed","paper":{"title":"The density of $k$-cacti via excluding minors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Licheng Zhang, Yuanqiu Huang","submitted_at":"2026-06-04T15:36:57Z","abstract_excerpt":"A \\emph{$k$-cactus} generalizes forests and cacti by allowing each edge to lie on at most $k$ cycles. The maximum number of edges is classical for forests and cacti, but for $k$-cacti was known only for $k\\le 4$. In this note we treat general $k$. The key idea is that bounding the cycles through each edge forces a $k$-cactus to exclude a large complete minor; in particular, the class of $k$-cacti is minor-closed. From this we prove that every $n$-vertex $k$-cactus has $O\\!\\left(\\frac{\\log k}{\\sqrt{\\log\\log k}}\\,n\\right)$ edges for all sufficiently large $k$, and a construction shows this is op"},"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":"2606.06298","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T15:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"578cd7452c6ecd1a857a37f37e91d0c530085b1cb4646f1b37b5c205ca4bac12","abstract_canon_sha256":"fb942155cce0b37c2794ab9c09a5b5439b0ebc0a565e3d3f7a49c29f9d461f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:40.888275Z","signature_b64":"aCvzVGIZ7VlH9OmlQOD1g2X0VdKj3oG+qaheULb8JY0ARqDDAx/fGK0BlH4IwGZKmX9NSOENqrwst0oNGHWJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","last_reissued_at":"2026-06-05T01:15:40.887892Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:40.887892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The density of $k$-cacti via excluding minors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Licheng Zhang, Yuanqiu Huang","submitted_at":"2026-06-04T15:36:57Z","abstract_excerpt":"A \\emph{$k$-cactus} generalizes forests and cacti by allowing each edge to lie on at most $k$ cycles. The maximum number of edges is classical for forests and cacti, but for $k$-cacti was known only for $k\\le 4$. In this note we treat general $k$. The key idea is that bounding the cycles through each edge forces a $k$-cactus to exclude a large complete minor; in particular, the class of $k$-cacti is minor-closed. From this we prove that every $n$-vertex $k$-cactus has $O\\!\\left(\\frac{\\log k}{\\sqrt{\\log\\log k}}\\,n\\right)$ edges for all sufficiently large $k$, and a construction shows this is op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06298","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.06298/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":"2606.06298","created_at":"2026-06-05T01:15:40.887955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06298v1","created_at":"2026-06-05T01:15:40.887955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06298","created_at":"2026-06-05T01:15:40.887955+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKZZT2SEOEKM","created_at":"2026-06-05T01:15:40.887955+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKZZT2SEOEKMCDQL","created_at":"2026-06-05T01:15:40.887955+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKZZT2SE","created_at":"2026-06-05T01:15:40.887955+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/KKZZT2SEOEKMCDQL2PWGE752KP","json":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP.json","graph_json":"https://pith.science/api/pith-number/KKZZT2SEOEKMCDQL2PWGE752KP/graph.json","events_json":"https://pith.science/api/pith-number/KKZZT2SEOEKMCDQL2PWGE752KP/events.json","paper":"https://pith.science/paper/KKZZT2SE"},"agent_actions":{"view_html":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP","download_json":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP.json","view_paper":"https://pith.science/paper/KKZZT2SE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06298&json=true","fetch_graph":"https://pith.science/api/pith-number/KKZZT2SEOEKMCDQL2PWGE752KP/graph.json","fetch_events":"https://pith.science/api/pith-number/KKZZT2SEOEKMCDQL2PWGE752KP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/action/storage_attestation","attest_author":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/action/author_attestation","sign_citation":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/action/citation_signature","submit_replication":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/action/replication_record"}},"created_at":"2026-06-05T01:15:40.887955+00:00","updated_at":"2026-06-05T01:15:40.887955+00:00"}