{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E54PEPJO6XX53P3NS4TNPGSYIH","short_pith_number":"pith:E54PEPJO","schema_version":"1.0","canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","source":{"kind":"arxiv","id":"1904.10210","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical b-Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mordechai Shalom, Shay Kutten, Shmuel Zaks, Yuval Emek","submitted_at":"2019-04-23T09:03:02Z","abstract_excerpt":"A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a $b$-matching every vertex $v$ has an associated bound $b_v$, and a maximum $b$-matching is a maximum set of edges, such that every vertex $v$ appears in at most $b_v$ of them. We study an extension of this problem, termed {\\em Hierarchical b-Matching}. In this extension, the vertices are arranged in a hierarchical manner. At the first level the vertices are partitioned into disjoint subsets, with a given bound for each subset. At the second level t"},"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":"1904.10210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-23T09:03:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2117cec928799ad76006c59db9a3757fe3351bd97411e374803c9c963ac5e361","abstract_canon_sha256":"5a041b1951bf4241fa31ed4437b3197fc19960caf1b4398af4619cf547e7bf66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.824026Z","signature_b64":"oWslsAmZuQqiJVzyPEp98YhX+TDXdabY9q62lhxf3iB02nFWPeV7JLDWYlZZ3/INZaW4ab6wE9rbakQjjZxgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","last_reissued_at":"2026-05-17T23:47:54.823448Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.823448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical b-Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mordechai Shalom, Shay Kutten, Shmuel Zaks, Yuval Emek","submitted_at":"2019-04-23T09:03:02Z","abstract_excerpt":"A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a $b$-matching every vertex $v$ has an associated bound $b_v$, and a maximum $b$-matching is a maximum set of edges, such that every vertex $v$ appears in at most $b_v$ of them. We study an extension of this problem, termed {\\em Hierarchical b-Matching}. In this extension, the vertices are arranged in a hierarchical manner. At the first level the vertices are partitioned into disjoint subsets, with a given bound for each subset. At the second level t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10210","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":"1904.10210","created_at":"2026-05-17T23:47:54.823532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10210v1","created_at":"2026-05-17T23:47:54.823532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10210","created_at":"2026-05-17T23:47:54.823532+00:00"},{"alias_kind":"pith_short_12","alias_value":"E54PEPJO6XX5","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E54PEPJO6XX53P3N","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E54PEPJO","created_at":"2026-05-18T12:33:15.570797+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/E54PEPJO6XX53P3NS4TNPGSYIH","json":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH.json","graph_json":"https://pith.science/api/pith-number/E54PEPJO6XX53P3NS4TNPGSYIH/graph.json","events_json":"https://pith.science/api/pith-number/E54PEPJO6XX53P3NS4TNPGSYIH/events.json","paper":"https://pith.science/paper/E54PEPJO"},"agent_actions":{"view_html":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH","download_json":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH.json","view_paper":"https://pith.science/paper/E54PEPJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10210&json=true","fetch_graph":"https://pith.science/api/pith-number/E54PEPJO6XX53P3NS4TNPGSYIH/graph.json","fetch_events":"https://pith.science/api/pith-number/E54PEPJO6XX53P3NS4TNPGSYIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/action/storage_attestation","attest_author":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/action/author_attestation","sign_citation":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/action/citation_signature","submit_replication":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/action/replication_record"}},"created_at":"2026-05-17T23:47:54.823532+00:00","updated_at":"2026-05-17T23:47:54.823532+00:00"}