{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6ATGYAVLPMWZRFVMAQLCMNJ3FH","short_pith_number":"pith:6ATGYAVL","canonical_record":{"source":{"id":"1905.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-21T14:08:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a7fb51abade7c6234afbdf715ff677747d9361c39ebd24419548b5192db7ebdd","abstract_canon_sha256":"5170f25d21e2b1604f32e9baa588d7ca7808796920248b6cb41d9a04383cbf63"},"schema_version":"1.0"},"canonical_sha256":"f0266c02ab7b2d9896ac041626353b29c548758b53ac87e951df94e0c9769c0b","source":{"kind":"arxiv","id":"1905.08658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08658","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08658v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08658","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"6ATGYAVLPMWZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6ATGYAVLPMWZRFVM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6ATGYAVL","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6ATGYAVLPMWZRFVMAQLCMNJ3FH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-21T14:08:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a7fb51abade7c6234afbdf715ff677747d9361c39ebd24419548b5192db7ebdd","abstract_canon_sha256":"5170f25d21e2b1604f32e9baa588d7ca7808796920248b6cb41d9a04383cbf63"},"schema_version":"1.0"},"canonical_sha256":"f0266c02ab7b2d9896ac041626353b29c548758b53ac87e951df94e0c9769c0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:42.491420Z","signature_b64":"L0ev/gGxCyH6UAhgLgE+uIo3SSNRKftM+Lqden6H9A7NPEtZJJ46/pW0oGHHUzxdQ2T9fkfp9wEEhGDtXTPNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0266c02ab7b2d9896ac041626353b29c548758b53ac87e951df94e0c9769c0b","last_reissued_at":"2026-05-17T23:45:42.490808Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:42.490808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08658","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:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Q43/bKxRlzI4Cvy3PGtlGpuv2KfUFChPrRF66DQiT4BFirD7felmwpJ6nmsXCLf2sz5Hhn7GsJV6+pBUKw9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:04:37.879891Z"},"content_sha256":"30956f9c00cb1869f4b145978a36bb03c20ac6b5ee38355347f8ccbe502bb3d4","schema_version":"1.0","event_id":"sha256:30956f9c00cb1869f4b145978a36bb03c20ac6b5ee38355347f8ccbe502bb3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6ATGYAVLPMWZRFVMAQLCMNJ3FH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Rico Zenklusen, Simon Bruggmann","submitted_at":"2019-05-21T14:08:21Z","abstract_excerpt":"Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes round a fractional point by first rounding each coordinate independently, and then dropping some elements to reach a feasible set. Also the second step, where elements are dropped, is typically randomized. This leads to an additional source of randomization within the procedure, which can complicate the analysis. We suggest a different, polyhedral viewpoint t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08658","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:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWKQiMoEtx4EFUg787xE1y2a9uDGl7PtmisQeEONYGmLpTYhNKbzdKHzlFIzbKzsKwBuikHyzfy5l9vaEkbaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:04:37.880428Z"},"content_sha256":"3589962d1283ffa021b165d0bcc242f01d5d46bf1b2275f4a0f470330c82f0d4","schema_version":"1.0","event_id":"sha256:3589962d1283ffa021b165d0bcc242f01d5d46bf1b2275f4a0f470330c82f0d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/bundle.json","state_url":"https://pith.science/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/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-05-31T05:04:37Z","links":{"resolver":"https://pith.science/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH","bundle":"https://pith.science/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/bundle.json","state":"https://pith.science/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ATGYAVLPMWZRFVMAQLCMNJ3FH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6ATGYAVLPMWZRFVMAQLCMNJ3FH","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":"5170f25d21e2b1604f32e9baa588d7ca7808796920248b6cb41d9a04383cbf63","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-21T14:08:21Z","title_canon_sha256":"a7fb51abade7c6234afbdf715ff677747d9361c39ebd24419548b5192db7ebdd"},"schema_version":"1.0","source":{"id":"1905.08658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08658","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08658v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08658","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"6ATGYAVLPMWZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6ATGYAVLPMWZRFVM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6ATGYAVL","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3589962d1283ffa021b165d0bcc242f01d5d46bf1b2275f4a0f470330c82f0d4","target":"graph","created_at":"2026-05-17T23:45:42Z","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":"Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes round a fractional point by first rounding each coordinate independently, and then dropping some elements to reach a feasible set. Also the second step, where elements are dropped, is typically randomized. This leads to an additional source of randomization within the procedure, which can complicate the analysis. We suggest a different, polyhedral viewpoint t","authors_text":"Rico Zenklusen, Simon Bruggmann","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-21T14:08:21Z","title":"An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08658","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:30956f9c00cb1869f4b145978a36bb03c20ac6b5ee38355347f8ccbe502bb3d4","target":"record","created_at":"2026-05-17T23:45:42Z","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":"5170f25d21e2b1604f32e9baa588d7ca7808796920248b6cb41d9a04383cbf63","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-21T14:08:21Z","title_canon_sha256":"a7fb51abade7c6234afbdf715ff677747d9361c39ebd24419548b5192db7ebdd"},"schema_version":"1.0","source":{"id":"1905.08658","kind":"arxiv","version":1}},"canonical_sha256":"f0266c02ab7b2d9896ac041626353b29c548758b53ac87e951df94e0c9769c0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0266c02ab7b2d9896ac041626353b29c548758b53ac87e951df94e0c9769c0b","first_computed_at":"2026-05-17T23:45:42.490808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:42.490808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L0ev/gGxCyH6UAhgLgE+uIo3SSNRKftM+Lqden6H9A7NPEtZJJ46/pW0oGHHUzxdQ2T9fkfp9wEEhGDtXTPNAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:42.491420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30956f9c00cb1869f4b145978a36bb03c20ac6b5ee38355347f8ccbe502bb3d4","sha256:3589962d1283ffa021b165d0bcc242f01d5d46bf1b2275f4a0f470330c82f0d4"],"state_sha256":"c3c7e11ae163920f4c0a18de88203e39fab2a0ae79f63ce489439989d25143af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vy0MTgPC1Ot+frgkW+Bw2jOtPnv36udMVML/OY2mQtO9Yms8ZmagX2vAljD9OieIeQ+8eqNOOCGVfhv+//ydAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:04:37.883348Z","bundle_sha256":"009351a3680e734ba5594a4af6cf0bd9d12192120c05bcbda88c56ed868ea9ad"}}