{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JEI7WCQ63V7APNOZ6Z6NOVMZX2","short_pith_number":"pith:JEI7WCQ6","canonical_record":{"source":{"id":"1607.07174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T08:04:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8061842e2cfd365db7cca9d654e17f4ebf79aeb831cbb2a99a342abb5e76454e","abstract_canon_sha256":"321c55a97a288c035ef7cf642535c151b63f82f3f16a856e96968afdf242ac06"},"schema_version":"1.0"},"canonical_sha256":"4911fb0a1edd7e07b5d9f67cd75599beb9217dbffba91e66596e68c50f221e7d","source":{"kind":"arxiv","id":"1607.07174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07174","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07174v2","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07174","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"pith_short_12","alias_value":"JEI7WCQ63V7A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JEI7WCQ63V7APNOZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JEI7WCQ6","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JEI7WCQ63V7APNOZ6Z6NOVMZX2","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T08:04:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8061842e2cfd365db7cca9d654e17f4ebf79aeb831cbb2a99a342abb5e76454e","abstract_canon_sha256":"321c55a97a288c035ef7cf642535c151b63f82f3f16a856e96968afdf242ac06"},"schema_version":"1.0"},"canonical_sha256":"4911fb0a1edd7e07b5d9f67cd75599beb9217dbffba91e66596e68c50f221e7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:21.039588Z","signature_b64":"pOX0sd6hH5ySaCblZmFV4j2WC3PDsrxba+1ZSI50Ys/rActDveEJULD0m6e6nLXie21dBvbCxEULzZOCIo7kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4911fb0a1edd7e07b5d9f67cd75599beb9217dbffba91e66596e68c50f221e7d","last_reissued_at":"2026-05-18T00:43:21.039081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:21.039081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07174","source_version":2,"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-18T00:43:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8UL7cNxZU3nTTDvEU4oR+0oFeXANhQFKRbYvxV7EZgzFYsZlHAbVcT1GS/g06xBXxWbkHRD1+BCkgLkoBVzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:21:09.890715Z"},"content_sha256":"c65414f606d2275723e479f057d85be3819024af54cffca1cefecdc64cb1c401","schema_version":"1.0","event_id":"sha256:c65414f606d2275723e479f057d85be3819024af54cffca1cefecdc64cb1c401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JEI7WCQ63V7APNOZ6Z6NOVMZX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $k$-strong induced arboricity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Goncalves, Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2016-07-25T08:04:52Z","abstract_excerpt":"The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edges of $G$ when each forest in a cover consists of exactly one edge. Not all edges of a graph necessarily belong to induced forests with larger components. For $k\\geq 1$, we call an edge $k$-valid if it is contained in an induced tree on $k$ edges. The $k$-strong induced arboricity of $G$, denoted by $f_k(G)$, is the smallest number of induced forests with components of sizes at least $k$ that cover all $k$-valid edges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07174","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"},"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-18T00:43:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wk1L7L7CXHjhblExXppFcLMlrF/PNm1ma6yNg2dLMO+oyspO/m/H5qeaD5wbn9ZlxIpcbTfNFsd9970ZPk5hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:21:09.891380Z"},"content_sha256":"430492d1c9d0f78be5f8265008eaba1267d5ca5928cf30834045c1449239dd05","schema_version":"1.0","event_id":"sha256:430492d1c9d0f78be5f8265008eaba1267d5ca5928cf30834045c1449239dd05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/bundle.json","state_url":"https://pith.science/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/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-26T21:21:09Z","links":{"resolver":"https://pith.science/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2","bundle":"https://pith.science/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/bundle.json","state":"https://pith.science/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEI7WCQ63V7APNOZ6Z6NOVMZX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JEI7WCQ63V7APNOZ6Z6NOVMZX2","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":"321c55a97a288c035ef7cf642535c151b63f82f3f16a856e96968afdf242ac06","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T08:04:52Z","title_canon_sha256":"8061842e2cfd365db7cca9d654e17f4ebf79aeb831cbb2a99a342abb5e76454e"},"schema_version":"1.0","source":{"id":"1607.07174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07174","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07174v2","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07174","created_at":"2026-05-18T00:43:21Z"},{"alias_kind":"pith_short_12","alias_value":"JEI7WCQ63V7A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JEI7WCQ63V7APNOZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JEI7WCQ6","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:430492d1c9d0f78be5f8265008eaba1267d5ca5928cf30834045c1449239dd05","target":"graph","created_at":"2026-05-18T00:43:21Z","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":"The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$. This is a well-defined parameter bounded from above by the number of edges of $G$ when each forest in a cover consists of exactly one edge. Not all edges of a graph necessarily belong to induced forests with larger components. For $k\\geq 1$, we call an edge $k$-valid if it is contained in an induced tree on $k$ edges. The $k$-strong induced arboricity of $G$, denoted by $f_k(G)$, is the smallest number of induced forests with components of sizes at least $k$ that cover all $k$-valid edges","authors_text":"Daniel Goncalves, Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T08:04:52Z","title":"The $k$-strong induced arboricity of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07174","kind":"arxiv","version":2},"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:c65414f606d2275723e479f057d85be3819024af54cffca1cefecdc64cb1c401","target":"record","created_at":"2026-05-18T00:43:21Z","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":"321c55a97a288c035ef7cf642535c151b63f82f3f16a856e96968afdf242ac06","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T08:04:52Z","title_canon_sha256":"8061842e2cfd365db7cca9d654e17f4ebf79aeb831cbb2a99a342abb5e76454e"},"schema_version":"1.0","source":{"id":"1607.07174","kind":"arxiv","version":2}},"canonical_sha256":"4911fb0a1edd7e07b5d9f67cd75599beb9217dbffba91e66596e68c50f221e7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4911fb0a1edd7e07b5d9f67cd75599beb9217dbffba91e66596e68c50f221e7d","first_computed_at":"2026-05-18T00:43:21.039081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:21.039081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pOX0sd6hH5ySaCblZmFV4j2WC3PDsrxba+1ZSI50Ys/rActDveEJULD0m6e6nLXie21dBvbCxEULzZOCIo7kDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:21.039588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c65414f606d2275723e479f057d85be3819024af54cffca1cefecdc64cb1c401","sha256:430492d1c9d0f78be5f8265008eaba1267d5ca5928cf30834045c1449239dd05"],"state_sha256":"fa0b8ea7ebdd721696f67cb1f6d98bf690b06a35a1a780ccbb0680f36fd9b2f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOwiNy+ybh/RGsmDUx6pZ4zhctmi2xngjp66tFYwu2m0U46uvSIaN8m9QJeyDBZuQpPaxn3r4uYn5WOdiQm0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:21:09.894968Z","bundle_sha256":"c906933195156198d7fc5814cda0ccb2d71a912d9c10a6e3e7ea3cd0a897f2f1"}}