{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UVIWBVSSP5H3J2R77O4G3ZAEDO","short_pith_number":"pith:UVIWBVSS","schema_version":"1.0","canonical_sha256":"a55160d6527f4fb4ea3ffbb86de4041bbd9b46acc381e28e93c5d3d859c1f32c","source":{"kind":"arxiv","id":"1612.01694","version":1},"attestation_state":"computed","paper":{"title":"Tree Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Roberts","submitted_at":"2016-12-06T08:04:32Z","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}."},"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":"1612.01694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-06T08:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"b301723322f3fad8ed349f0c96a350d18233e454e1ea20f6cb6b052d69291d35","abstract_canon_sha256":"a4d843268dd4a6894b105cfd03699a12491e4af9d563af557ab070fdce8413c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:47.814264Z","signature_b64":"7+cb4jJMMhuluTT24R7tohmcDQnvTl6j8Os3KO5XDVnheIN3u4UKsmS3vXhv4wi7xE1VcxIKICkSPV/SJ8xHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55160d6527f4fb4ea3ffbb86de4041bbd9b46acc381e28e93c5d3d859c1f32c","last_reissued_at":"2026-05-18T00:55:47.813711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:47.813711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Roberts","submitted_at":"2016-12-06T08:04:32Z","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}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01694","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":"1612.01694","created_at":"2026-05-18T00:55:47.813780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01694v1","created_at":"2026-05-18T00:55:47.813780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01694","created_at":"2026-05-18T00:55:47.813780+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVIWBVSSP5H3","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVIWBVSSP5H3J2R7","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVIWBVSS","created_at":"2026-05-18T12:30:46.583412+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/UVIWBVSSP5H3J2R77O4G3ZAEDO","json":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO.json","graph_json":"https://pith.science/api/pith-number/UVIWBVSSP5H3J2R77O4G3ZAEDO/graph.json","events_json":"https://pith.science/api/pith-number/UVIWBVSSP5H3J2R77O4G3ZAEDO/events.json","paper":"https://pith.science/paper/UVIWBVSS"},"agent_actions":{"view_html":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO","download_json":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO.json","view_paper":"https://pith.science/paper/UVIWBVSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01694&json=true","fetch_graph":"https://pith.science/api/pith-number/UVIWBVSSP5H3J2R77O4G3ZAEDO/graph.json","fetch_events":"https://pith.science/api/pith-number/UVIWBVSSP5H3J2R77O4G3ZAEDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO/action/storage_attestation","attest_author":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO/action/author_attestation","sign_citation":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO/action/citation_signature","submit_replication":"https://pith.science/pith/UVIWBVSSP5H3J2R77O4G3ZAEDO/action/replication_record"}},"created_at":"2026-05-18T00:55:47.813780+00:00","updated_at":"2026-05-18T00:55:47.813780+00:00"}