{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LY53VEKOQS355PRTPVQKGH3DPP","short_pith_number":"pith:LY53VEKO","canonical_record":{"source":{"id":"1803.05501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20ad3386b5c6cd5b19d3b024e3fb7983ef1201cd85d207f56aff110a4d4f7c31","abstract_canon_sha256":"24147a361d9f49fce199e34e53afb825bf4cc26398c6cc4b965939f779434069"},"schema_version":"1.0"},"canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","source":{"kind":"arxiv","id":"1803.05501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05501","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05501v1","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05501","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"LY53VEKOQS35","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LY53VEKOQS355PRT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LY53VEKO","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LY53VEKOQS355PRTPVQKGH3DPP","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20ad3386b5c6cd5b19d3b024e3fb7983ef1201cd85d207f56aff110a4d4f7c31","abstract_canon_sha256":"24147a361d9f49fce199e34e53afb825bf4cc26398c6cc4b965939f779434069"},"schema_version":"1.0"},"canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.282412Z","signature_b64":"Ub7GkMLWmP1wOF8qSyDH1YUunKeIn2bb6K5b1nfgzmmNqD4A9h87brweaXfEEUSB0VnUi12E2+PPW2hyK3e6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","last_reissued_at":"2026-05-18T00:20:55.281954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.281954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05501","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-18T00:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3J5Mr/HbvN2CEdR+Eb+oD98GTvB9lX9H0Rjl3FcmtKQAeSR2A4oMDaJryy5C+vkTw26O5oZBPUJiJM8ETkmrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:01:17.906056Z"},"content_sha256":"c7815f322389b52515c11ea29772e7043226783a90e24b92dba52325e33721e1","schema_version":"1.0","event_id":"sha256:c7815f322389b52515c11ea29772e7043226783a90e24b92dba52325e33721e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LY53VEKOQS355PRTPVQKGH3DPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Min Greedy Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Alon Eden, Michal Feldman, Uriel Feige","submitted_at":"2018-03-14T20:28:59Z","abstract_excerpt":"A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\\pi$ over $V$, the other player imposes a permutation $\\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in order $\\sigma$ and each vertex is matched to the lowest (under $\\pi$) yet unmatched neighbor in $V$ (or left unmatched, if all its neighbors are already matched). The obtained matching is maximal, thus matches at least a half of the vertices. The max-min greedy matching problem asks: suppose the first (max) player reveals $\\pi$, and the second (min) player resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05501","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-18T00:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+XusZAHn+JVEHexKHTlBqb+GzzIJ6Iyunk9jqxb7+Fh3pndlW9UkALI6J0xhj8iERTS6h9fiwkpi3vKCBQACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:01:17.906431Z"},"content_sha256":"0c1e8553e326c32d7c15dd6545a2e4a6c81d5510c0b0dd0c02be012b2e0986ab","schema_version":"1.0","event_id":"sha256:0c1e8553e326c32d7c15dd6545a2e4a6c81d5510c0b0dd0c02be012b2e0986ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/bundle.json","state_url":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY53VEKOQS355PRTPVQKGH3DPP/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-20T10:01:17Z","links":{"resolver":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP","bundle":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/bundle.json","state":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY53VEKOQS355PRTPVQKGH3DPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LY53VEKOQS355PRTPVQKGH3DPP","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":"24147a361d9f49fce199e34e53afb825bf4cc26398c6cc4b965939f779434069","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","title_canon_sha256":"20ad3386b5c6cd5b19d3b024e3fb7983ef1201cd85d207f56aff110a4d4f7c31"},"schema_version":"1.0","source":{"id":"1803.05501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05501","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05501v1","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05501","created_at":"2026-05-18T00:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"LY53VEKOQS35","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LY53VEKOQS355PRT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LY53VEKO","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:0c1e8553e326c32d7c15dd6545a2e4a6c81d5510c0b0dd0c02be012b2e0986ab","target":"graph","created_at":"2026-05-18T00:20:55Z","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 bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\\pi$ over $V$, the other player imposes a permutation $\\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in order $\\sigma$ and each vertex is matched to the lowest (under $\\pi$) yet unmatched neighbor in $V$ (or left unmatched, if all its neighbors are already matched). The obtained matching is maximal, thus matches at least a half of the vertices. The max-min greedy matching problem asks: suppose the first (max) player reveals $\\pi$, and the second (min) player resp","authors_text":"Alon Eden, Michal Feldman, Uriel Feige","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","title":"Max-Min Greedy Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05501","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:c7815f322389b52515c11ea29772e7043226783a90e24b92dba52325e33721e1","target":"record","created_at":"2026-05-18T00:20:55Z","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":"24147a361d9f49fce199e34e53afb825bf4cc26398c6cc4b965939f779434069","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","title_canon_sha256":"20ad3386b5c6cd5b19d3b024e3fb7983ef1201cd85d207f56aff110a4d4f7c31"},"schema_version":"1.0","source":{"id":"1803.05501","kind":"arxiv","version":1}},"canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","first_computed_at":"2026-05-18T00:20:55.281954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:55.281954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ub7GkMLWmP1wOF8qSyDH1YUunKeIn2bb6K5b1nfgzmmNqD4A9h87brweaXfEEUSB0VnUi12E2+PPW2hyK3e6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:55.282412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7815f322389b52515c11ea29772e7043226783a90e24b92dba52325e33721e1","sha256:0c1e8553e326c32d7c15dd6545a2e4a6c81d5510c0b0dd0c02be012b2e0986ab"],"state_sha256":"f68ceb065df644e5b05c60e4287742a08d0e6ad8a8260bcd40c952598944291c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1upfEMGY0UO7xQsOdjCk4lUVET9UlOSGhUYE5EcXUNeIosIM5LjW9kzAK48qsU+0V6FQ8o3ii5/EvgRfJnYRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:01:17.908371Z","bundle_sha256":"f48bf7509888ff2636e36d0cada0c5d053d731d94f117b7d57616314a8d1322e"}}