{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HOPPD4LWQWYRF2R6I3WXRYSYTR","short_pith_number":"pith:HOPPD4LW","canonical_record":{"source":{"id":"1803.01478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"84b7e7e8454b6485be30fbaf62845954d94216ab971806e214682b14d9966a20","abstract_canon_sha256":"eabf578dd31d954d7497f30b1f2c07eaf7e2a1ec49ba16c5e80ec936a9269b81"},"schema_version":"1.0"},"canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","source":{"kind":"arxiv","id":"1803.01478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01478","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01478v2","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01478","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"HOPPD4LWQWYR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOPPD4LWQWYRF2R6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOPPD4LW","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HOPPD4LWQWYRF2R6I3WXRYSYTR","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"84b7e7e8454b6485be30fbaf62845954d94216ab971806e214682b14d9966a20","abstract_canon_sha256":"eabf578dd31d954d7497f30b1f2c07eaf7e2a1ec49ba16c5e80ec936a9269b81"},"schema_version":"1.0"},"canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:34.012606Z","signature_b64":"X+VDkyQkLGHu96bzjr737VzRDROxNV8prjAbmFnymYU5h9k++CRNFLiTFISEjqpb1wPRelbE02GYg/A8Pky4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","last_reissued_at":"2026-05-18T00:21:34.011907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:34.011907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01478","source_version":2,"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-18T00:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibuCI1Uqp3dOB80YvNvdCNY9Pe0/kGjH4q/PHcz9tcSA7H0HJ/C6KzGos/1qhDW7xrXikmQRxHHUG0LtrCXzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:27.360009Z"},"content_sha256":"5c2ac8349640c5cc58b46c93fea9a2affabc1945f115f8093ea6f59816352532","schema_version":"1.0","event_id":"sha256:5c2ac8349640c5cc58b46c93fea9a2affabc1945f115f8093ea6f59816352532"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HOPPD4LWQWYRF2R6I3WXRYSYTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Vladlena Powers, Xingyu Zhang, Yuri Faenza","submitted_at":"2018-03-05T03:07:07Z","abstract_excerpt":"Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fairness condition. In fact, stable matchings are popular matchings of minimum size, and a maximum size popular matching can be as large as twice the size of a(ny) stable matching in a given instance. The st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01478","kind":"arxiv","version":2},"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-18T00:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fNSQVQY6OMPChohlnfs3f9NM0UPnLvsSS+MFCvbZAAzpmFwdhhLUBGeqgFXTNkeP1OnPa7VaUcLheDOG1JMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:27.360377Z"},"content_sha256":"b7197f37a2b0dd672c596f0101b144bb702139570cb56e3feda01f0c02b9684f","schema_version":"1.0","event_id":"sha256:b7197f37a2b0dd672c596f0101b144bb702139570cb56e3feda01f0c02b9684f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/bundle.json","state_url":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/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-31T03:17:27Z","links":{"resolver":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR","bundle":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/bundle.json","state":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HOPPD4LWQWYRF2R6I3WXRYSYTR","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":"eabf578dd31d954d7497f30b1f2c07eaf7e2a1ec49ba16c5e80ec936a9269b81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","title_canon_sha256":"84b7e7e8454b6485be30fbaf62845954d94216ab971806e214682b14d9966a20"},"schema_version":"1.0","source":{"id":"1803.01478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01478","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01478v2","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01478","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"HOPPD4LWQWYR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOPPD4LWQWYRF2R6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOPPD4LW","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b7197f37a2b0dd672c596f0101b144bb702139570cb56e3feda01f0c02b9684f","target":"graph","created_at":"2026-05-18T00:21:34Z","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":"Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fairness condition. In fact, stable matchings are popular matchings of minimum size, and a maximum size popular matching can be as large as twice the size of a(ny) stable matching in a given instance. The st","authors_text":"Vladlena Powers, Xingyu Zhang, Yuri Faenza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","title":"Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01478","kind":"arxiv","version":2},"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:5c2ac8349640c5cc58b46c93fea9a2affabc1945f115f8093ea6f59816352532","target":"record","created_at":"2026-05-18T00:21:34Z","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":"eabf578dd31d954d7497f30b1f2c07eaf7e2a1ec49ba16c5e80ec936a9269b81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","title_canon_sha256":"84b7e7e8454b6485be30fbaf62845954d94216ab971806e214682b14d9966a20"},"schema_version":"1.0","source":{"id":"1803.01478","kind":"arxiv","version":2}},"canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","first_computed_at":"2026-05-18T00:21:34.011907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:34.011907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X+VDkyQkLGHu96bzjr737VzRDROxNV8prjAbmFnymYU5h9k++CRNFLiTFISEjqpb1wPRelbE02GYg/A8Pky4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:34.012606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c2ac8349640c5cc58b46c93fea9a2affabc1945f115f8093ea6f59816352532","sha256:b7197f37a2b0dd672c596f0101b144bb702139570cb56e3feda01f0c02b9684f"],"state_sha256":"abb0eaef00a9d70c35f246c015d411d2654f5e66c3020b0351cb2ca4edb5b134"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdVPCCwv7CEvqZIHJefY8JRnb0qO/pubsormK9v5PqThflMQEIuW9/oGKWAVs/gHsYR3URGE/KVQUgs80SEtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:17:27.362505Z","bundle_sha256":"f467e7677da1f59e454acbd26fadc945329583953be829d42cbb2894795c9a6e"}}