{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5Q2X5VXB3TMPS35MZL4NRZM2KN","short_pith_number":"pith:5Q2X5VXB","canonical_record":{"source":{"id":"1606.04394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0cfafef8f6178ccb1caf506ba442050d5b496b6bb0756a4c3dd63e80530f0ed0","abstract_canon_sha256":"f6c9bad0eaa2dffb7d27f6f6a395b64a76d0edf046fb412d4feca1d1cfab4008"},"schema_version":"1.0"},"canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","source":{"kind":"arxiv","id":"1606.04394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04394","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04394v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04394","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"5Q2X5VXB3TMP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5Q2X5VXB3TMPS35M","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5Q2X5VXB","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5Q2X5VXB3TMPS35MZL4NRZM2KN","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0cfafef8f6178ccb1caf506ba442050d5b496b6bb0756a4c3dd63e80530f0ed0","abstract_canon_sha256":"f6c9bad0eaa2dffb7d27f6f6a395b64a76d0edf046fb412d4feca1d1cfab4008"},"schema_version":"1.0"},"canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.657785Z","signature_b64":"LjL1M6AvwzA8q9gtoaVLJlR3t+RVrGm8A2GbLSs2g2AOggsmelrknsJwM8zoDexmivx8ouBqNhv+re4951lUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","last_reissued_at":"2026-05-18T01:12:25.657400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.657400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04394","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-05-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFCudVI7SVgC0O0azaiEoXU0b7W14MMSN9O2k+LrwyWl1rBIU9+OZNucYh1cg2bEBsGgHiN9eamn5JQW3DleCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:50:04.730869Z"},"content_sha256":"e1595895a90505a273bda1168195646a5743870a064baa3d926ea91e87b4f160","schema_version":"1.0","event_id":"sha256:e1595895a90505a273bda1168195646a5743870a064baa3d926ea91e87b4f160"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5Q2X5VXB3TMPS35MZL4NRZM2KN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning sparse graphs into an independent set and a forest of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","submitted_at":"2016-06-14T14:38:07Z","abstract_excerpt":"An $({\\cal I},{\\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$ and $d \\ge \\frac{2}{3-M} - 2$, if a graph has maximum average degree less than $M$, then it has an $({\\cal I},{\\cal F}_d)$-partition. Additionally, we prove that for all $\\frac{8}{3} \\le M < 3$ and $d \\ge \\frac{1}{3-M}$, if a graph has maximum average degree less than $M$ then it has an $({\\cal I},{\\cal F}_d)$-partition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04394","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":""},"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-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cdp21feyC/FJd5sdYKQSe4yHq28CCgKvphlr60S5Qh00vmyTQXURfTg+OYOJlBE02CFTibNXsWyQ/rgrmXGYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:50:04.731202Z"},"content_sha256":"d7d4a9d439b88e028552f2363412fa40a3364c1ee173457f3f356222e8fefcce","schema_version":"1.0","event_id":"sha256:d7d4a9d439b88e028552f2363412fa40a3364c1ee173457f3f356222e8fefcce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/bundle.json","state_url":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/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-20T07:50:04Z","links":{"resolver":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN","bundle":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/bundle.json","state":"https://pith.science/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Q2X5VXB3TMPS35MZL4NRZM2KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5Q2X5VXB3TMPS35MZL4NRZM2KN","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":"f6c9bad0eaa2dffb7d27f6f6a395b64a76d0edf046fb412d4feca1d1cfab4008","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","title_canon_sha256":"0cfafef8f6178ccb1caf506ba442050d5b496b6bb0756a4c3dd63e80530f0ed0"},"schema_version":"1.0","source":{"id":"1606.04394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04394","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04394v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04394","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"5Q2X5VXB3TMP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5Q2X5VXB3TMPS35M","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5Q2X5VXB","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:d7d4a9d439b88e028552f2363412fa40a3364c1ee173457f3f356222e8fefcce","target":"graph","created_at":"2026-05-18T01:12:25Z","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":"An $({\\cal I},{\\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$ and $d \\ge \\frac{2}{3-M} - 2$, if a graph has maximum average degree less than $M$, then it has an $({\\cal I},{\\cal F}_d)$-partition. Additionally, we prove that for all $\\frac{8}{3} \\le M < 3$ and $d \\ge \\frac{1}{3-M}$, if a graph has maximum average degree less than $M$ then it has an $({\\cal I},{\\cal F}_d)$-partition.","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","title":"Partitioning sparse graphs into an independent set and a forest of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04394","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:e1595895a90505a273bda1168195646a5743870a064baa3d926ea91e87b4f160","target":"record","created_at":"2026-05-18T01:12:25Z","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":"f6c9bad0eaa2dffb7d27f6f6a395b64a76d0edf046fb412d4feca1d1cfab4008","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-14T14:38:07Z","title_canon_sha256":"0cfafef8f6178ccb1caf506ba442050d5b496b6bb0756a4c3dd63e80530f0ed0"},"schema_version":"1.0","source":{"id":"1606.04394","kind":"arxiv","version":1}},"canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec357ed6e1dcd8f96faccaf8d8e59a537a628432c0db2123296be2f0ac2378b8","first_computed_at":"2026-05-18T01:12:25.657400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:25.657400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LjL1M6AvwzA8q9gtoaVLJlR3t+RVrGm8A2GbLSs2g2AOggsmelrknsJwM8zoDexmivx8ouBqNhv+re4951lUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:25.657785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1595895a90505a273bda1168195646a5743870a064baa3d926ea91e87b4f160","sha256:d7d4a9d439b88e028552f2363412fa40a3364c1ee173457f3f356222e8fefcce"],"state_sha256":"3775660f5a68cc446fb45d3376bdae3843e08c21d1e09a80bdcf7cc0df1ce3a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPU3mWqeOCEDLzRfFGUne3J3ney64iZrWUWmy8aPuLXbm+jJ+ezxV6Pat7625PhlbvF7cBfRktE9lpE8FS1rAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:50:04.733026Z","bundle_sha256":"919cd39abcda078ee2186271c79cde310f15dd7f077e3c694f5d079a854ac858"}}