{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VNKTR56Z2ZJWNAHUASKCHFTV3W","short_pith_number":"pith:VNKTR56Z","schema_version":"1.0","canonical_sha256":"ab5538f7d9d6536680f40494239675ddbeb8385baa1459f8eb76f17d8b7d93a2","source":{"kind":"arxiv","id":"1808.09650","version":1},"attestation_state":"computed","paper":{"title":"The matching number of tree and bipartite degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, F. Bock","submitted_at":"2018-08-29T06:11:03Z","abstract_excerpt":"We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible values. For bipartite degree sequences, we show the existence of realizations with a restricted structure, which allows to derive an analogue of the Gale-Ryser Theorem characterizing bipartite degree sequences. More precisely, we show that a bipartite degree sequence has a realization with a certain matching number if and only if a cubic number of inequalitie"},"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":"1808.09650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T06:11:03Z","cross_cats_sorted":[],"title_canon_sha256":"dd0eb410177cb171e91750376fccfb537948e4b18d50ec15d5e7a7709693d2a2","abstract_canon_sha256":"0fdfd9575f81ec71510b010fa86b1a58315ab0ab9f8bf5ef34c830ff70521372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.889492Z","signature_b64":"J0HgRCWgkQm149hT+q1jSm+I1oDrWmp7+6jsfEi5MvuajPz3Fh52cCBQ863v8DDVWCcKoha8ovlVcmyKVZEPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5538f7d9d6536680f40494239675ddbeb8385baa1459f8eb76f17d8b7d93a2","last_reissued_at":"2026-05-18T00:06:54.888947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.888947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The matching number of tree and bipartite degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, F. Bock","submitted_at":"2018-08-29T06:11:03Z","abstract_excerpt":"We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible values. For bipartite degree sequences, we show the existence of realizations with a restricted structure, which allows to derive an analogue of the Gale-Ryser Theorem characterizing bipartite degree sequences. More precisely, we show that a bipartite degree sequence has a realization with a certain matching number if and only if a cubic number of inequalitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09650","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":"1808.09650","created_at":"2026-05-18T00:06:54.889036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09650v1","created_at":"2026-05-18T00:06:54.889036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09650","created_at":"2026-05-18T00:06:54.889036+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNKTR56Z2ZJW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNKTR56Z2ZJWNAHU","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNKTR56Z","created_at":"2026-05-18T12:32:59.047623+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/VNKTR56Z2ZJWNAHUASKCHFTV3W","json":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W.json","graph_json":"https://pith.science/api/pith-number/VNKTR56Z2ZJWNAHUASKCHFTV3W/graph.json","events_json":"https://pith.science/api/pith-number/VNKTR56Z2ZJWNAHUASKCHFTV3W/events.json","paper":"https://pith.science/paper/VNKTR56Z"},"agent_actions":{"view_html":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W","download_json":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W.json","view_paper":"https://pith.science/paper/VNKTR56Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09650&json=true","fetch_graph":"https://pith.science/api/pith-number/VNKTR56Z2ZJWNAHUASKCHFTV3W/graph.json","fetch_events":"https://pith.science/api/pith-number/VNKTR56Z2ZJWNAHUASKCHFTV3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W/action/storage_attestation","attest_author":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W/action/author_attestation","sign_citation":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W/action/citation_signature","submit_replication":"https://pith.science/pith/VNKTR56Z2ZJWNAHUASKCHFTV3W/action/replication_record"}},"created_at":"2026-05-18T00:06:54.889036+00:00","updated_at":"2026-05-18T00:06:54.889036+00:00"}