{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UVIWBVSSP5H3J2R77O4G3ZAEDO","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":"a4d843268dd4a6894b105cfd03699a12491e4af9d563af557ab070fdce8413c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-06T08:04:32Z","title_canon_sha256":"b301723322f3fad8ed349f0c96a350d18233e454e1ea20f6cb6b052d69291d35"},"schema_version":"1.0","source":{"id":"1612.01694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01694","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01694v1","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01694","created_at":"2026-05-18T00:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"UVIWBVSSP5H3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVIWBVSSP5H3J2R7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVIWBVSS","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fe05789fbc3051837872bc7104ce91298cfb4c7aae4f821ebf206059ba9a9418","target":"graph","created_at":"2026-05-18T00:55:47Z","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 $(s,t)$-matching in a bipartite graph $G=(U,V,E)$ is a subset of the edges $F$ such that each component of $G[F]$ is a tree with at most $t$ edges and each vertex in $U$ has $s$ neighbours in $G[H]$. We give sharp conditions for a bipartite graph to contain an $(s,t)$-matching. As a special case, we prove a conjecture of Bonacina, Galesi, Huynh and Wollan \\cite{CNF}.","authors_text":"Alexander Roberts","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-06T08:04:32Z","title":"Tree Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01694","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:73a16fac80826a17118d5448cfbf04053c881f399df81924bb697da13947c53d","target":"record","created_at":"2026-05-18T00:55:47Z","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":"a4d843268dd4a6894b105cfd03699a12491e4af9d563af557ab070fdce8413c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-06T08:04:32Z","title_canon_sha256":"b301723322f3fad8ed349f0c96a350d18233e454e1ea20f6cb6b052d69291d35"},"schema_version":"1.0","source":{"id":"1612.01694","kind":"arxiv","version":1}},"canonical_sha256":"a55160d6527f4fb4ea3ffbb86de4041bbd9b46acc381e28e93c5d3d859c1f32c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a55160d6527f4fb4ea3ffbb86de4041bbd9b46acc381e28e93c5d3d859c1f32c","first_computed_at":"2026-05-18T00:55:47.813711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:47.813711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7+cb4jJMMhuluTT24R7tohmcDQnvTl6j8Os3KO5XDVnheIN3u4UKsmS3vXhv4wi7xE1VcxIKICkSPV/SJ8xHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:47.814264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73a16fac80826a17118d5448cfbf04053c881f399df81924bb697da13947c53d","sha256:fe05789fbc3051837872bc7104ce91298cfb4c7aae4f821ebf206059ba9a9418"],"state_sha256":"afe9a32999d3d96a55746ca9d0f1424cfc93dcd337aa66455c47685a0669a2cd"}