{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E54PEPJO6XX53P3NS4TNPGSYIH","short_pith_number":"pith:E54PEPJO","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"},"canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","source":{"kind":"arxiv","id":"1904.10210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10210","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10210v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10210","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"E54PEPJO6XX5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E54PEPJO6XX53P3N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E54PEPJO","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E54PEPJO6XX53P3NS4TNPGSYIH","target":"record","payload":{"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"},"canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","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"},"source_kind":"arxiv","source_id":"1904.10210","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRjoEkg5adKI+0Z3aGr+sAY4COQAdGa3OI+UjJG1+Lg4RuyxQZDkjaiayYm8lg/wFg+jjdaLA7UtfxYqbn2tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:54:10.924635Z"},"content_sha256":"6a8bcc7a5f8d8d200f7f378f7f53993b34877b778e68fa919ac80951ce695436","schema_version":"1.0","event_id":"sha256:6a8bcc7a5f8d8d200f7f378f7f53993b34877b778e68fa919ac80951ce695436"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E54PEPJO6XX53P3NS4TNPGSYIH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ka+1+/osxbhoZ2fBslTJyzSvR8fr3Y6YLoUAXP+gte/C2mIklkDIj5dx6SzA0mG32DEIlBzxmn/eTaNvFjGcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:54:10.925273Z"},"content_sha256":"f123c09ce5c62b3e3e79615354c8fdaeb366f9349f917fd42744843ba14e317b","schema_version":"1.0","event_id":"sha256:f123c09ce5c62b3e3e79615354c8fdaeb366f9349f917fd42744843ba14e317b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/bundle.json","state_url":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E54PEPJO6XX53P3NS4TNPGSYIH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T05:54:10Z","links":{"resolver":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH","bundle":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/bundle.json","state":"https://pith.science/pith/E54PEPJO6XX53P3NS4TNPGSYIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E54PEPJO6XX53P3NS4TNPGSYIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E54PEPJO6XX53P3NS4TNPGSYIH","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":"5a041b1951bf4241fa31ed4437b3197fc19960caf1b4398af4619cf547e7bf66","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-23T09:03:02Z","title_canon_sha256":"2117cec928799ad76006c59db9a3757fe3351bd97411e374803c9c963ac5e361"},"schema_version":"1.0","source":{"id":"1904.10210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10210","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10210v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10210","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"E54PEPJO6XX5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E54PEPJO6XX53P3N","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E54PEPJO","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:f123c09ce5c62b3e3e79615354c8fdaeb366f9349f917fd42744843ba14e317b","target":"graph","created_at":"2026-05-17T23:47:54Z","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":"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","authors_text":"Mordechai Shalom, Shay Kutten, Shmuel Zaks, Yuval Emek","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-23T09:03:02Z","title":"Hierarchical b-Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10210","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:6a8bcc7a5f8d8d200f7f378f7f53993b34877b778e68fa919ac80951ce695436","target":"record","created_at":"2026-05-17T23:47:54Z","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":"5a041b1951bf4241fa31ed4437b3197fc19960caf1b4398af4619cf547e7bf66","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-23T09:03:02Z","title_canon_sha256":"2117cec928799ad76006c59db9a3757fe3351bd97411e374803c9c963ac5e361"},"schema_version":"1.0","source":{"id":"1904.10210","kind":"arxiv","version":1}},"canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2778f23d2ef5efddbf6d9726d79a5841cc3887a064f056387d15175e33e2a13a","first_computed_at":"2026-05-17T23:47:54.823448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:54.823448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oWslsAmZuQqiJVzyPEp98YhX+TDXdabY9q62lhxf3iB02nFWPeV7JLDWYlZZ3/INZaW4ab6wE9rbakQjjZxgBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:54.824026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a8bcc7a5f8d8d200f7f378f7f53993b34877b778e68fa919ac80951ce695436","sha256:f123c09ce5c62b3e3e79615354c8fdaeb366f9349f917fd42744843ba14e317b"],"state_sha256":"2e8d6a7beba1d8ce3cb0dd11f605ff53d24010d9b2a0fc798b012660309cdfca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poPKQ4WGEB5clJzCN+7dEGTe520W0y5g5hcAxknnKEE0EH6HxVLftSeIekrwCfhxKu7XTs75hOLNgxzlzUFOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:54:10.928715Z","bundle_sha256":"d36810b85b51748f3f2d9f473ef78b2bcf076a772bc34655b65b227cd377e153"}}