{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Z7FT2ORZA4N3Y46PLEAVVELSYS","short_pith_number":"pith:Z7FT2ORZ","canonical_record":{"source":{"id":"1004.3363","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T07:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"58fa0ce90beeb6656f29bb132c044fa192079359a9743c3c06a2d115ef8d3234","abstract_canon_sha256":"e7145225b164d8924a540f1e4f4f33bac7ccd6fad44bd5a1600b1df3229a6455"},"schema_version":"1.0"},"canonical_sha256":"cfcb3d3a39071bbc73cf59015a9172c4838cc86c9912c30e583722634be57e87","source":{"kind":"arxiv","id":"1004.3363","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3363","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3363v5","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3363","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"pith_short_12","alias_value":"Z7FT2ORZA4N3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Z7FT2ORZA4N3Y46P","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Z7FT2ORZ","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Z7FT2ORZA4N3Y46PLEAVVELSYS","target":"record","payload":{"canonical_record":{"source":{"id":"1004.3363","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T07:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"58fa0ce90beeb6656f29bb132c044fa192079359a9743c3c06a2d115ef8d3234","abstract_canon_sha256":"e7145225b164d8924a540f1e4f4f33bac7ccd6fad44bd5a1600b1df3229a6455"},"schema_version":"1.0"},"canonical_sha256":"cfcb3d3a39071bbc73cf59015a9172c4838cc86c9912c30e583722634be57e87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:42.659354Z","signature_b64":"qpA1auM0qAT6ax4w5uiOYUYRaPt8HFbkU5E6qea/cB0nGxVYUY2u5H+sGKCqZIdzPWFRzWxO0A6T6XTW3CJMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcb3d3a39071bbc73cf59015a9172c4838cc86c9912c30e583722634be57e87","last_reissued_at":"2026-05-18T03:53:42.658817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:42.658817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.3363","source_version":5,"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-18T03:53:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoXHG0jNTzFaXU/dt6+NxksCxQun04vx6lAb+EmSqqqcEy+UvRupPlrsc4OOLRPOf1jEo7UZMEgnFRqOxZLOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:12:45.984585Z"},"content_sha256":"2499603c3d70a1b881a98508039f9cbac6d59b29174e76f73a880f0bc29697cd","schema_version":"1.0","event_id":"sha256:2499603c3d70a1b881a98508039f9cbac6d59b29174e76f73a880f0bc29697cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Z7FT2ORZA4N3Y46PLEAVVELSYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Semi-Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Jittat Fakcharoenphol","submitted_at":"2010-04-20T07:06:38Z","abstract_excerpt":"We consider the problem of finding \\textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case.\n  For the weighted case, we give an $O(nm\\log n)$-time algorithm, where $n$ is the number of vertices and $m$ is the number of edges, by exploiting the geometric structure of the problem. This improves the classical $O(n^3)$ algorithms by Horn [Operations Research 1973] and Bruno, Coffman and Sethi [Communications of the ACM 1974].\n  For the unweighted case, the bound co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3363","kind":"arxiv","version":5},"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-18T03:53:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x0BQausAV8z8Kbf8ZfqImNWSUmaJHPbgItqKvSC90KAuPSS8DUJdmOJLwBqy1q2B66zyMIQa9Uevi32hMI7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:12:45.985202Z"},"content_sha256":"9ee92001e72015ca241bdfe10d5153f166f5a277c027d12bac50a3e249090767","schema_version":"1.0","event_id":"sha256:9ee92001e72015ca241bdfe10d5153f166f5a277c027d12bac50a3e249090767"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/bundle.json","state_url":"https://pith.science/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/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-27T12:12:45Z","links":{"resolver":"https://pith.science/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS","bundle":"https://pith.science/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/bundle.json","state":"https://pith.science/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7FT2ORZA4N3Y46PLEAVVELSYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Z7FT2ORZA4N3Y46PLEAVVELSYS","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":"e7145225b164d8924a540f1e4f4f33bac7ccd6fad44bd5a1600b1df3229a6455","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T07:06:38Z","title_canon_sha256":"58fa0ce90beeb6656f29bb132c044fa192079359a9743c3c06a2d115ef8d3234"},"schema_version":"1.0","source":{"id":"1004.3363","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3363","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3363v5","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3363","created_at":"2026-05-18T03:53:42Z"},{"alias_kind":"pith_short_12","alias_value":"Z7FT2ORZA4N3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Z7FT2ORZA4N3Y46P","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Z7FT2ORZ","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:9ee92001e72015ca241bdfe10d5153f166f5a277c027d12bac50a3e249090767","target":"graph","created_at":"2026-05-18T03:53: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":"We consider the problem of finding \\textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted case.\n  For the weighted case, we give an $O(nm\\log n)$-time algorithm, where $n$ is the number of vertices and $m$ is the number of edges, by exploiting the geometric structure of the problem. This improves the classical $O(n^3)$ algorithms by Horn [Operations Research 1973] and Bruno, Coffman and Sethi [Communications of the ACM 1974].\n  For the unweighted case, the bound co","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Jittat Fakcharoenphol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T07:06:38Z","title":"Faster Algorithms for Semi-Matching Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3363","kind":"arxiv","version":5},"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:2499603c3d70a1b881a98508039f9cbac6d59b29174e76f73a880f0bc29697cd","target":"record","created_at":"2026-05-18T03:53: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":"e7145225b164d8924a540f1e4f4f33bac7ccd6fad44bd5a1600b1df3229a6455","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T07:06:38Z","title_canon_sha256":"58fa0ce90beeb6656f29bb132c044fa192079359a9743c3c06a2d115ef8d3234"},"schema_version":"1.0","source":{"id":"1004.3363","kind":"arxiv","version":5}},"canonical_sha256":"cfcb3d3a39071bbc73cf59015a9172c4838cc86c9912c30e583722634be57e87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfcb3d3a39071bbc73cf59015a9172c4838cc86c9912c30e583722634be57e87","first_computed_at":"2026-05-18T03:53:42.658817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:42.658817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qpA1auM0qAT6ax4w5uiOYUYRaPt8HFbkU5E6qea/cB0nGxVYUY2u5H+sGKCqZIdzPWFRzWxO0A6T6XTW3CJMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:42.659354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3363","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2499603c3d70a1b881a98508039f9cbac6d59b29174e76f73a880f0bc29697cd","sha256:9ee92001e72015ca241bdfe10d5153f166f5a277c027d12bac50a3e249090767"],"state_sha256":"447bdb80442dffead546ac8b4c8ce2c32aaa97b427834e980fb298ecd504b639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITqibNQysAL12GJ9XoH4TyPsYdk4C31TqbWiXuJXwlkz/d8GYaDH1Oh1KRlYGF1DelZx8DXEMR782u2/001FAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:12:45.988262Z","bundle_sha256":"76d1b88e93cc532efdd36a8b3b863071a4f4dd8383e206c73224a9b87a7efc83"}}