{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YXKF2M6VVXN74LBPTQGHWCJYNL","short_pith_number":"pith:YXKF2M6V","schema_version":"1.0","canonical_sha256":"c5d45d33d5addbfe2c2f9c0c7b09386aef4cbfec98be5a8acea80cf7817f568f","source":{"kind":"arxiv","id":"1705.01648","version":1},"attestation_state":"computed","paper":{"title":"Decomposing graphs into forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Lisa Sauermann","submitted_at":"2017-05-03T22:54:09Z","abstract_excerpt":"We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this statement where some edges are preassigned to distinct forests."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.01648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-03T22:54:09Z","cross_cats_sorted":[],"title_canon_sha256":"110fcc6185943bfc5cabc672f8e821ca959557851dfcfa7ff44a6ab0e4bcf11c","abstract_canon_sha256":"c894c47bf90b1ffdb5ca9c9e1ab9776c36a52db6cc945ee439fd62821b294f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.479732Z","signature_b64":"QHsxcs7Q1dMdxJZ93qH2dANT652FuMCp23BH3CNhDtokgJq6trO5FaWAa6J40ExgxII4VtCQ4dx8CSiqpr+7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5d45d33d5addbfe2c2f9c0c7b09386aef4cbfec98be5a8acea80cf7817f568f","last_reissued_at":"2026-05-18T00:45:04.479268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.479268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing graphs into forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Lisa Sauermann","submitted_at":"2017-05-03T22:54:09Z","abstract_excerpt":"We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this statement where some edges are preassigned to distinct forests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01648","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.01648","created_at":"2026-05-18T00:45:04.479371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01648v1","created_at":"2026-05-18T00:45:04.479371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01648","created_at":"2026-05-18T00:45:04.479371+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXKF2M6VVXN7","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXKF2M6VVXN74LBP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXKF2M6V","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL","json":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL.json","graph_json":"https://pith.science/api/pith-number/YXKF2M6VVXN74LBPTQGHWCJYNL/graph.json","events_json":"https://pith.science/api/pith-number/YXKF2M6VVXN74LBPTQGHWCJYNL/events.json","paper":"https://pith.science/paper/YXKF2M6V"},"agent_actions":{"view_html":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL","download_json":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL.json","view_paper":"https://pith.science/paper/YXKF2M6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01648&json=true","fetch_graph":"https://pith.science/api/pith-number/YXKF2M6VVXN74LBPTQGHWCJYNL/graph.json","fetch_events":"https://pith.science/api/pith-number/YXKF2M6VVXN74LBPTQGHWCJYNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL/action/storage_attestation","attest_author":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL/action/author_attestation","sign_citation":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL/action/citation_signature","submit_replication":"https://pith.science/pith/YXKF2M6VVXN74LBPTQGHWCJYNL/action/replication_record"}},"created_at":"2026-05-18T00:45:04.479371+00:00","updated_at":"2026-05-18T00:45:04.479371+00:00"}