{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KKZZT2SEOEKMCDQL2PWGE752KP","short_pith_number":"pith:KKZZT2SE","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"},"canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","source":{"kind":"arxiv","id":"2606.06298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06298","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06298v1","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06298","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"KKZZT2SEOEKM","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"KKZZT2SEOEKMCDQL","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"KKZZT2SE","created_at":"2026-06-05T01:15:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KKZZT2SEOEKMCDQL2PWGE752KP","target":"record","payload":{"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"},"canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","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"},"source_kind":"arxiv","source_id":"2606.06298","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-06-05T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHGzsHAECmdwHd2dXq9LsKKUD6JDDrUT0yCuKeiZ88IVpD5r/bmTvzIhe+PNeP/HgMU2868TK5HuWvsKy2zXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:16.061770Z"},"content_sha256":"0717559085d513b8a5820d6eb57d4d2bb42b107a1e2607287fff8b70b0d91aa3","schema_version":"1.0","event_id":"sha256:0717559085d513b8a5820d6eb57d4d2bb42b107a1e2607287fff8b70b0d91aa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KKZZT2SEOEKMCDQL2PWGE752KP","target":"graph","payload":{"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"},"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-06-05T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJgAngeEf4u0THz9DECLE5zoEeafjOW+fbYwSzWMqHjBetjdfq/KJeqeeHfn6U2v8I6k9ViweJs2+jSVnLvkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:16.062453Z"},"content_sha256":"bab4219bb122d0619776770edb72609e09ab3e77ce4f10a9f1f4c602aae464ca","schema_version":"1.0","event_id":"sha256:bab4219bb122d0619776770edb72609e09ab3e77ce4f10a9f1f4c602aae464ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/bundle.json","state_url":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKZZT2SEOEKMCDQL2PWGE752KP/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-06-08T17:57:16Z","links":{"resolver":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP","bundle":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/bundle.json","state":"https://pith.science/pith/KKZZT2SEOEKMCDQL2PWGE752KP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKZZT2SEOEKMCDQL2PWGE752KP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KKZZT2SEOEKMCDQL2PWGE752KP","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":"fb942155cce0b37c2794ab9c09a5b5439b0ebc0a565e3d3f7a49c29f9d461f3d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T15:36:57Z","title_canon_sha256":"578cd7452c6ecd1a857a37f37e91d0c530085b1cb4646f1b37b5c205ca4bac12"},"schema_version":"1.0","source":{"id":"2606.06298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.06298","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.06298v1","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06298","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"KKZZT2SEOEKM","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"KKZZT2SEOEKMCDQL","created_at":"2026-06-05T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"KKZZT2SE","created_at":"2026-06-05T01:15:40Z"}],"graph_snapshots":[{"event_id":"sha256:bab4219bb122d0619776770edb72609e09ab3e77ce4f10a9f1f4c602aae464ca","target":"graph","created_at":"2026-06-05T01:15:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.06298/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Licheng Zhang, Yuanqiu Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T15:36:57Z","title":"The density of $k$-cacti via excluding minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06298","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:0717559085d513b8a5820d6eb57d4d2bb42b107a1e2607287fff8b70b0d91aa3","target":"record","created_at":"2026-06-05T01:15:40Z","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":"fb942155cce0b37c2794ab9c09a5b5439b0ebc0a565e3d3f7a49c29f9d461f3d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T15:36:57Z","title_canon_sha256":"578cd7452c6ecd1a857a37f37e91d0c530085b1cb4646f1b37b5c205ca4bac12"},"schema_version":"1.0","source":{"id":"2606.06298","kind":"arxiv","version":1}},"canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52b399ea447114c10e0bd3ec627fba53f968fec20d07ab9ed8e228064bf7aca7","first_computed_at":"2026-06-05T01:15:40.887892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:40.887892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCvzVGIZ7VlH9OmlQOD1g2X0VdKj3oG+qaheULb8JY0ARqDDAx/fGK0BlH4IwGZKmX9NSOENqrwst0oNGHWJAA==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:40.888275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.06298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0717559085d513b8a5820d6eb57d4d2bb42b107a1e2607287fff8b70b0d91aa3","sha256:bab4219bb122d0619776770edb72609e09ab3e77ce4f10a9f1f4c602aae464ca"],"state_sha256":"20c906b695da139d83bcb2ebba779eb0f3e23d28dd613c285c26ffdf895e6319"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUuL7xusw2gRn5AKPPO1htlM/5c6g0Fzt28EQtlsZhYyvbjfja8J4T4Mx1bRxIDfxY9RgK/pcsfABmIs+BMTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:57:16.066811Z","bundle_sha256":"49e54fa3a45fd47789d21f7de76929d660b857260d2e38104ed196dc7d8700a0"}}