{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P2RPL5GBX5B2KZQAJPBMOE4APG","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":"cde8d42449979c29972d92857fcc54f358465b122f092918c17bd0a5e9b83269","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-06T13:02:51Z","title_canon_sha256":"a5e082ce807e47474cda106131daaff9e1f7ba0f574be37bda63991c6a23200f"},"schema_version":"1.0","source":{"id":"1803.02152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02152","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02152v1","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02152","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"P2RPL5GBX5B2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2RPL5GBX5B2KZQA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2RPL5GB","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e1c4b130a53034961c39737c13491f65a6994a0510c46e4410642479c84a5f9b","target":"graph","created_at":"2026-05-18T00:21:55Z","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":"We define the induced arboricity of a graph $G$, denoted by ${\\rm ia}(G)$, as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$. This notion generalizes the classical notions of the arboricity and strong chromatic index.\n  For a class $\\mathcal{F}$ of graphs and a graph parameter $p$, let $p(\\mathcal{F}) = \\sup\\{p(G) \\mid G\\in \\mathcal{F}\\}$. We show that ${\\rm ia}(\\mathcal{F})$ is bounded from above by an absolute constant depending only on $\\mathcal{F}$, that is ${\\rm ia}(\\mathcal{F})\\neq\\infty$ if and only if $\\chi(\\mathcal{F} \\nabla \\frac{1}{2}) \\ne","authors_text":"Jonathan Rollin, Maria Axenovich, Philip D\\\"orr, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-06T13:02:51Z","title":"Induced and Weak Induced Arboricities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02152","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:2047d2fff618ee6dbd7fabd67fc5c49fe1f620e0e0fcb7590b1902cdba915505","target":"record","created_at":"2026-05-18T00:21:55Z","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":"cde8d42449979c29972d92857fcc54f358465b122f092918c17bd0a5e9b83269","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-06T13:02:51Z","title_canon_sha256":"a5e082ce807e47474cda106131daaff9e1f7ba0f574be37bda63991c6a23200f"},"schema_version":"1.0","source":{"id":"1803.02152","kind":"arxiv","version":1}},"canonical_sha256":"7ea2f5f4c1bf43a566004bc2c71380798f34ccc3fa8f0bb03a736fcd3f3c720e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ea2f5f4c1bf43a566004bc2c71380798f34ccc3fa8f0bb03a736fcd3f3c720e","first_computed_at":"2026-05-18T00:21:55.633465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:55.633465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"haCASAGaOWTCTjN/rxnFmvqrKUsdM5ZYn8I3QMtnUzSfxW2TmW5bfMK0LdpXnaZgY0H1NdX9+72Xke4ssj3nDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:55.634139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2047d2fff618ee6dbd7fabd67fc5c49fe1f620e0e0fcb7590b1902cdba915505","sha256:e1c4b130a53034961c39737c13491f65a6994a0510c46e4410642479c84a5f9b"],"state_sha256":"efd9520badc80b934885579e2f56a0969cd8c954bac02abc2f64be2bf5559968"}