{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DCCLDGCRJI36GC6HH4MTLNLWIF","short_pith_number":"pith:DCCLDGCR","canonical_record":{"source":{"id":"1511.01661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:11:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d9ce7189646dbdaca20dfeef1011b614ef1559fc7400a901494ad44bfd0e2ffb","abstract_canon_sha256":"85b8c6d9777b336ac5b857dc8d9a7faa8ce404cd121df73ca523513d25e975a1"},"schema_version":"1.0"},"canonical_sha256":"1884b198514a37e30bc73f1935b576417fefb2982da8dc3aafad23fade858478","source":{"kind":"arxiv","id":"1511.01661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01661","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01661v1","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01661","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"DCCLDGCRJI36","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DCCLDGCRJI36GC6H","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DCCLDGCR","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DCCLDGCRJI36GC6HH4MTLNLWIF","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:11:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d9ce7189646dbdaca20dfeef1011b614ef1559fc7400a901494ad44bfd0e2ffb","abstract_canon_sha256":"85b8c6d9777b336ac5b857dc8d9a7faa8ce404cd121df73ca523513d25e975a1"},"schema_version":"1.0"},"canonical_sha256":"1884b198514a37e30bc73f1935b576417fefb2982da8dc3aafad23fade858478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:44.892553Z","signature_b64":"sCudJn0Ox75E6DUcnqlpSqTwjDeeekCiL7jBJsQERL94AAnVkGdgcuuFE+v/Ogt8Mw3VUP6S3Et/wcxFoXZ2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1884b198514a37e30bc73f1935b576417fefb2982da8dc3aafad23fade858478","last_reissued_at":"2026-05-18T01:27:44.891957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:44.891957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01661","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:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEdEY7qsqL0FtX1L4lR6RIq9nPWtScijTRInwCVOkSO4dTIpt/K9J+DZ3U4z+xaQVclEMMOVDiTiYETWNgztAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:18:26.961353Z"},"content_sha256":"556e5c0c8675bdcec734f236c889f9bf996a74b5c4702e096258d69c89b92ed3","schema_version":"1.0","event_id":"sha256:556e5c0c8675bdcec734f236c889f9bf996a74b5c4702e096258d69c89b92ed3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DCCLDGCRJI36GC6HH4MTLNLWIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on Perfect Forests in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Anders Yeo, Gregory Gutin","submitted_at":"2015-11-05T09:11:14Z","abstract_excerpt":"A spanning subgraph $F$ of a graph $G$ is called {\\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. Alex Scott (Graphs \\& Combin., 2001) proved that every connected graph $G$ contains a perfect forest if and only if $G$ has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect forest. While the problem of existence of the most straightforward one is NP-hard, for the three others this problem is polynomial-time solvable. Moreover, every digraph with only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01661","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:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/9ClRjDT4ZdQh/fGOvLJd5DqINaRBHWiBa5xQvueDay454bUIvRNXXqPUVKWpvObXVSq8+VHYSUVRrCQ70uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:18:26.962053Z"},"content_sha256":"51bb7d7ab714ecddb3c06d7cfa1fd933ef9c9446e2422c654594dc284c097cfd","schema_version":"1.0","event_id":"sha256:51bb7d7ab714ecddb3c06d7cfa1fd933ef9c9446e2422c654594dc284c097cfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/bundle.json","state_url":"https://pith.science/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/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-01T00:18:26Z","links":{"resolver":"https://pith.science/pith/DCCLDGCRJI36GC6HH4MTLNLWIF","bundle":"https://pith.science/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/bundle.json","state":"https://pith.science/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCCLDGCRJI36GC6HH4MTLNLWIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DCCLDGCRJI36GC6HH4MTLNLWIF","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":"85b8c6d9777b336ac5b857dc8d9a7faa8ce404cd121df73ca523513d25e975a1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:11:14Z","title_canon_sha256":"d9ce7189646dbdaca20dfeef1011b614ef1559fc7400a901494ad44bfd0e2ffb"},"schema_version":"1.0","source":{"id":"1511.01661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01661","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01661v1","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01661","created_at":"2026-05-18T01:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"DCCLDGCRJI36","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DCCLDGCRJI36GC6H","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DCCLDGCR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:51bb7d7ab714ecddb3c06d7cfa1fd933ef9c9446e2422c654594dc284c097cfd","target":"graph","created_at":"2026-05-18T01:27:44Z","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 spanning subgraph $F$ of a graph $G$ is called {\\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. Alex Scott (Graphs \\& Combin., 2001) proved that every connected graph $G$ contains a perfect forest if and only if $G$ has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect forest. While the problem of existence of the most straightforward one is NP-hard, for the three others this problem is polynomial-time solvable. Moreover, every digraph with only","authors_text":"Anders Yeo, Gregory Gutin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:11:14Z","title":"Note on Perfect Forests in Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01661","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:556e5c0c8675bdcec734f236c889f9bf996a74b5c4702e096258d69c89b92ed3","target":"record","created_at":"2026-05-18T01:27:44Z","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":"85b8c6d9777b336ac5b857dc8d9a7faa8ce404cd121df73ca523513d25e975a1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-05T09:11:14Z","title_canon_sha256":"d9ce7189646dbdaca20dfeef1011b614ef1559fc7400a901494ad44bfd0e2ffb"},"schema_version":"1.0","source":{"id":"1511.01661","kind":"arxiv","version":1}},"canonical_sha256":"1884b198514a37e30bc73f1935b576417fefb2982da8dc3aafad23fade858478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1884b198514a37e30bc73f1935b576417fefb2982da8dc3aafad23fade858478","first_computed_at":"2026-05-18T01:27:44.891957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:44.891957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCudJn0Ox75E6DUcnqlpSqTwjDeeekCiL7jBJsQERL94AAnVkGdgcuuFE+v/Ogt8Mw3VUP6S3Et/wcxFoXZ2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:44.892553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:556e5c0c8675bdcec734f236c889f9bf996a74b5c4702e096258d69c89b92ed3","sha256:51bb7d7ab714ecddb3c06d7cfa1fd933ef9c9446e2422c654594dc284c097cfd"],"state_sha256":"975533e973b900b7a236966ed76b56832a89a0ef83609bc84ed6830a3cf2d3f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1L21g2816XLqlmHZaMO+bTuDBdoTE7QTZ4zsPY15Up9G/BA6ANm3lk0P+3G8O3ALX59jZk5/rY3nCQmGQ73Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:18:26.965564Z","bundle_sha256":"1abe6085fdb3868abb524c689736bf7b4792a01e201f1ff861c9709d22c792f9"}}