{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2WN5DH3CEUBBFPL25YZZWSYXWM","short_pith_number":"pith:2WN5DH3C","canonical_record":{"source":{"id":"2012.15100","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T10:12:43Z","cross_cats_sorted":[],"title_canon_sha256":"f6bb1b6b9531d4ea275f9a2c95e3e850a8dd62d7fba121e0d96baf8fe129c224","abstract_canon_sha256":"39126b8dab897f5ec39d9cfba46b2fe537901935259551bf331146d36ea419fd"},"schema_version":"1.0"},"canonical_sha256":"d59bd19f62250212bd7aee339b4b17b32bfa24abadea11cffb92d7faff8f7d5c","source":{"kind":"arxiv","id":"2012.15100","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15100","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15100v3","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15100","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_12","alias_value":"2WN5DH3CEUBB","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_16","alias_value":"2WN5DH3CEUBBFPL2","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_8","alias_value":"2WN5DH3C","created_at":"2026-07-05T05:38:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2WN5DH3CEUBBFPL25YZZWSYXWM","target":"record","payload":{"canonical_record":{"source":{"id":"2012.15100","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T10:12:43Z","cross_cats_sorted":[],"title_canon_sha256":"f6bb1b6b9531d4ea275f9a2c95e3e850a8dd62d7fba121e0d96baf8fe129c224","abstract_canon_sha256":"39126b8dab897f5ec39d9cfba46b2fe537901935259551bf331146d36ea419fd"},"schema_version":"1.0"},"canonical_sha256":"d59bd19f62250212bd7aee339b4b17b32bfa24abadea11cffb92d7faff8f7d5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:39.088432Z","signature_b64":"53PIh2XsBZt0inXzxd6oB2uYae+bdLfeAC2ZT/vwTWbrIz7oe7d2M8hhqKvVITawt81kbTH0HBT5dLxq5YpLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59bd19f62250212bd7aee339b4b17b32bfa24abadea11cffb92d7faff8f7d5c","last_reissued_at":"2026-07-05T05:38:39.088074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:39.088074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.15100","source_version":3,"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-07-05T05:38:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xr84QL0VSTsTQcfJzxG0kyv5ls/3ZiQ527rFchzoH264jcSxUhv19rA6yZhdHjTTHLwjVI6ycSYNp3FUSPUICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:38:16.995158Z"},"content_sha256":"86e007d3102662e72a1a5b0210008a5094a233221df9ce92ecb851b18c773c06","schema_version":"1.0","event_id":"sha256:86e007d3102662e72a1a5b0210008a5094a233221df9ce92ecb851b18c773c06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2WN5DH3CEUBBFPL25YZZWSYXWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing a triangle-free planar graph into a forest and a subcubic forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Robert \\v{S}\\'amal","submitted_at":"2020-12-30T10:12:43Z","abstract_excerpt":"We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15100","kind":"arxiv","version":3},"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/2012.15100/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-07-05T05:38:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwBLfUiR4HoienjBiPK6zaFm4+F39TO5k29yrcb7YzSjfUFwPHMo3msSH7Z03/TdLxfTyyjT8A/DF2rdceoWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:38:16.996092Z"},"content_sha256":"de790e4ad6d432341da11b7c99639f07ca0c3263ea7225582831b6fd39dc41c2","schema_version":"1.0","event_id":"sha256:de790e4ad6d432341da11b7c99639f07ca0c3263ea7225582831b6fd39dc41c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/bundle.json","state_url":"https://pith.science/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/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-08-10T22:38:17Z","links":{"resolver":"https://pith.science/pith/2WN5DH3CEUBBFPL25YZZWSYXWM","bundle":"https://pith.science/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/bundle.json","state":"https://pith.science/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WN5DH3CEUBBFPL25YZZWSYXWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2WN5DH3CEUBBFPL25YZZWSYXWM","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":"39126b8dab897f5ec39d9cfba46b2fe537901935259551bf331146d36ea419fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T10:12:43Z","title_canon_sha256":"f6bb1b6b9531d4ea275f9a2c95e3e850a8dd62d7fba121e0d96baf8fe129c224"},"schema_version":"1.0","source":{"id":"2012.15100","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15100","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15100v3","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15100","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_12","alias_value":"2WN5DH3CEUBB","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_16","alias_value":"2WN5DH3CEUBBFPL2","created_at":"2026-07-05T05:38:39Z"},{"alias_kind":"pith_short_8","alias_value":"2WN5DH3C","created_at":"2026-07-05T05:38:39Z"}],"graph_snapshots":[{"event_id":"sha256:de790e4ad6d432341da11b7c99639f07ca0c3263ea7225582831b6fd39dc41c2","target":"graph","created_at":"2026-07-05T05:38:39Z","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/2012.15100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$.","authors_text":"Carl Feghali, Robert \\v{S}\\'amal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T10:12:43Z","title":"Decomposing a triangle-free planar graph into a forest and a subcubic forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15100","kind":"arxiv","version":3},"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:86e007d3102662e72a1a5b0210008a5094a233221df9ce92ecb851b18c773c06","target":"record","created_at":"2026-07-05T05:38:39Z","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":"39126b8dab897f5ec39d9cfba46b2fe537901935259551bf331146d36ea419fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T10:12:43Z","title_canon_sha256":"f6bb1b6b9531d4ea275f9a2c95e3e850a8dd62d7fba121e0d96baf8fe129c224"},"schema_version":"1.0","source":{"id":"2012.15100","kind":"arxiv","version":3}},"canonical_sha256":"d59bd19f62250212bd7aee339b4b17b32bfa24abadea11cffb92d7faff8f7d5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d59bd19f62250212bd7aee339b4b17b32bfa24abadea11cffb92d7faff8f7d5c","first_computed_at":"2026-07-05T05:38:39.088074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:39.088074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53PIh2XsBZt0inXzxd6oB2uYae+bdLfeAC2ZT/vwTWbrIz7oe7d2M8hhqKvVITawt81kbTH0HBT5dLxq5YpLBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:39.088432Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.15100","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e007d3102662e72a1a5b0210008a5094a233221df9ce92ecb851b18c773c06","sha256:de790e4ad6d432341da11b7c99639f07ca0c3263ea7225582831b6fd39dc41c2"],"state_sha256":"778228ffebdf83290725ca0b010da6ef1127c7d30f0b4d1ff0ff6eb91bbd0f20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2TYlQ6wTzEExXeMF4VBlAlqRlFOJfO5qYaR81fCwwrLOHmPVvA1duWG8Nwgee2tGipzlAGSIQ8ss9rpbYTcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:38:17.014284Z","bundle_sha256":"c4fdeeaef490c54eacb9b4ce224ef473a54d978aa46980f0154a72bdcd960e5e"}}