{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LFABMVKP7ROAS2HP24LIN3345J","short_pith_number":"pith:LFABMVKP","canonical_record":{"source":{"id":"1612.05004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T10:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"541b827ea6e7e68db5c31e46923215c05285b5b8ee0d68d99b9ce23f0c558932","abstract_canon_sha256":"c2962e25968304d6ce4539ec5b9168e28cdb539dbf8673b45607adc99658c9cf"},"schema_version":"1.0"},"canonical_sha256":"594016554ffc5c0968efd71686ef7cea7649808c62a675301244d728879a3e52","source":{"kind":"arxiv","id":"1612.05004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05004","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05004v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05004","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"LFABMVKP7ROA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFABMVKP7ROAS2HP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFABMVKP","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LFABMVKP7ROAS2HP24LIN3345J","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T10:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"541b827ea6e7e68db5c31e46923215c05285b5b8ee0d68d99b9ce23f0c558932","abstract_canon_sha256":"c2962e25968304d6ce4539ec5b9168e28cdb539dbf8673b45607adc99658c9cf"},"schema_version":"1.0"},"canonical_sha256":"594016554ffc5c0968efd71686ef7cea7649808c62a675301244d728879a3e52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:53.658825Z","signature_b64":"5rbjjWENeGtvl4KX+kgdrEuO6eDk8K7cp5gSff9B76ZVNYGFd8tLCu4jn61lPljdOttNhcMgIEKx98xjgZtDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594016554ffc5c0968efd71686ef7cea7649808c62a675301244d728879a3e52","last_reissued_at":"2026-05-18T00:54:53.658431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:53.658431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05004","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-18T00:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/gedneeZq6pET1pqFsmULVNqFomo0fYj+UExpPejO4hZ3oEm/om82QU5nEnwdnXkdYR0KGjUm/gsV40dOPsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:43:29.969597Z"},"content_sha256":"4e156d4e6464cb181e9db12d76fec8e865bbe98d9ccf152914858ee682b71dc5","schema_version":"1.0","event_id":"sha256:4e156d4e6464cb181e9db12d76fec8e865bbe98d9ccf152914858ee682b71dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LFABMVKP7ROAS2HP24LIN3345J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two short proofs of the Perfect Forest Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2016-12-15T10:30:52Z","abstract_excerpt":"A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a matching, all components are trees on one edge. Scott first proved the Perfect Forest Theorem, namely, that every connected graph of even order has a perfect forest. Gutin then gave another proof using linear algebra.\n  We give here two very short proofs of the Perfect Forest Theorem which use only elementary notions from graph theory. Both our proofs yield polyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05004","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-18T00:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8j8K+HDe+c05vpWd3810EJN3Wj5NK1VP1Wl3AlTn7L1MkDC4CaqZYz4Ji4FvQZcRp7cgO9jaXPR0d37CHkjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:43:29.969937Z"},"content_sha256":"e8bfdf20ef194d5088047cb67ffdda72e7dbd5792679e96d3906316896dab44a","schema_version":"1.0","event_id":"sha256:e8bfdf20ef194d5088047cb67ffdda72e7dbd5792679e96d3906316896dab44a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFABMVKP7ROAS2HP24LIN3345J/bundle.json","state_url":"https://pith.science/pith/LFABMVKP7ROAS2HP24LIN3345J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFABMVKP7ROAS2HP24LIN3345J/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-25T06:43:29Z","links":{"resolver":"https://pith.science/pith/LFABMVKP7ROAS2HP24LIN3345J","bundle":"https://pith.science/pith/LFABMVKP7ROAS2HP24LIN3345J/bundle.json","state":"https://pith.science/pith/LFABMVKP7ROAS2HP24LIN3345J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFABMVKP7ROAS2HP24LIN3345J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LFABMVKP7ROAS2HP24LIN3345J","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":"c2962e25968304d6ce4539ec5b9168e28cdb539dbf8673b45607adc99658c9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T10:30:52Z","title_canon_sha256":"541b827ea6e7e68db5c31e46923215c05285b5b8ee0d68d99b9ce23f0c558932"},"schema_version":"1.0","source":{"id":"1612.05004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05004","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05004v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05004","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"LFABMVKP7ROA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFABMVKP7ROAS2HP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFABMVKP","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e8bfdf20ef194d5088047cb67ffdda72e7dbd5792679e96d3906316896dab44a","target":"graph","created_at":"2026-05-18T00:54:53Z","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":"A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a matching, all components are trees on one edge. Scott first proved the Perfect Forest Theorem, namely, that every connected graph of even order has a perfect forest. Gutin then gave another proof using linear algebra.\n  We give here two very short proofs of the Perfect Forest Theorem which use only elementary notions from graph theory. Both our proofs yield polyn","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T10:30:52Z","title":"Two short proofs of the Perfect Forest Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05004","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:4e156d4e6464cb181e9db12d76fec8e865bbe98d9ccf152914858ee682b71dc5","target":"record","created_at":"2026-05-18T00:54:53Z","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":"c2962e25968304d6ce4539ec5b9168e28cdb539dbf8673b45607adc99658c9cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T10:30:52Z","title_canon_sha256":"541b827ea6e7e68db5c31e46923215c05285b5b8ee0d68d99b9ce23f0c558932"},"schema_version":"1.0","source":{"id":"1612.05004","kind":"arxiv","version":1}},"canonical_sha256":"594016554ffc5c0968efd71686ef7cea7649808c62a675301244d728879a3e52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"594016554ffc5c0968efd71686ef7cea7649808c62a675301244d728879a3e52","first_computed_at":"2026-05-18T00:54:53.658431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:53.658431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rbjjWENeGtvl4KX+kgdrEuO6eDk8K7cp5gSff9B76ZVNYGFd8tLCu4jn61lPljdOttNhcMgIEKx98xjgZtDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:53.658825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e156d4e6464cb181e9db12d76fec8e865bbe98d9ccf152914858ee682b71dc5","sha256:e8bfdf20ef194d5088047cb67ffdda72e7dbd5792679e96d3906316896dab44a"],"state_sha256":"b078a90c3568adccf48373996a3871481a9ddb2d4372126eb934d70cb9965007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpZfeY3oTjOSuL1d3beckW+SvjUOdvYe+GepHUSkfQ+73bleJ0tMqGPeMHxRwdvemTaF832l1crl2HDvpHFABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:43:29.971851Z","bundle_sha256":"085f3df5459a0af69d6b05bfd7d855f3fc3c0c0630f6587f4b2afe73ff55d8b9"}}