{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HMP2HJFDUTOFZ3KUGEM2N2MWMS","short_pith_number":"pith:HMP2HJFD","schema_version":"1.0","canonical_sha256":"3b1fa3a4a3a4dc5ced543119a6e99664b4942a274ab605b88cebb600b00d5804","source":{"kind":"arxiv","id":"2412.00704","version":1},"attestation_state":"computed","paper":{"title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Huang, Bopin Ran, Guang Wu, Xinbiao Gan, Zhengbin Pang","submitted_at":"2024-12-01T07:01:06Z","abstract_excerpt":"Finding the maximum matching in bipartite graphs is a fundamental graph operation widely used in various fields. To expedite the acquisition of the maximum matching, Karp and Sipser introduced two data reduction rules aimed at decreasing the input size. However, the KaSi algorithm, which implements the two data reduction rules, has several drawbacks: a high upper bound on time complexity and inefficient storage structure. The poor upper bound on time complexity makes the algorithm lack robustness when dealing with extreme cases, and the inefficient storage structure struggles to balance vertex"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.00704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-01T07:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"e64de531d2724d45df2cf76916df4f53ef41003c5a3ac2b915689da9a488ba3c","abstract_canon_sha256":"dcf1dc79c8bfbf9f814848d9169848841ac2434090aced0ae3e64009820b9f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:45.529687Z","signature_b64":"snRXHpRiMW97W53fpZe2CmFZOsE/5HLdWB2ImHDRFh8dt1Cxi4r8QH6JtF8Y5zWCSP16icnNXGj1xuLrtMLMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b1fa3a4a3a4dc5ced543119a6e99664b4942a274ab605b88cebb600b00d5804","last_reissued_at":"2026-07-05T09:42:45.529234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:45.529234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Huang, Bopin Ran, Guang Wu, Xinbiao Gan, Zhengbin Pang","submitted_at":"2024-12-01T07:01:06Z","abstract_excerpt":"Finding the maximum matching in bipartite graphs is a fundamental graph operation widely used in various fields. To expedite the acquisition of the maximum matching, Karp and Sipser introduced two data reduction rules aimed at decreasing the input size. However, the KaSi algorithm, which implements the two data reduction rules, has several drawbacks: a high upper bound on time complexity and inefficient storage structure. The poor upper bound on time complexity makes the algorithm lack robustness when dealing with extreme cases, and the inefficient storage structure struggles to balance vertex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00704","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.00704/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.00704","created_at":"2026-07-05T09:42:45.529303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00704v1","created_at":"2026-07-05T09:42:45.529303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00704","created_at":"2026-07-05T09:42:45.529303+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMP2HJFDUTOF","created_at":"2026-07-05T09:42:45.529303+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMP2HJFDUTOFZ3KU","created_at":"2026-07-05T09:42:45.529303+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMP2HJFD","created_at":"2026-07-05T09:42:45.529303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS","json":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS.json","graph_json":"https://pith.science/api/pith-number/HMP2HJFDUTOFZ3KUGEM2N2MWMS/graph.json","events_json":"https://pith.science/api/pith-number/HMP2HJFDUTOFZ3KUGEM2N2MWMS/events.json","paper":"https://pith.science/paper/HMP2HJFD"},"agent_actions":{"view_html":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS","download_json":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS.json","view_paper":"https://pith.science/paper/HMP2HJFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00704&json=true","fetch_graph":"https://pith.science/api/pith-number/HMP2HJFDUTOFZ3KUGEM2N2MWMS/graph.json","fetch_events":"https://pith.science/api/pith-number/HMP2HJFDUTOFZ3KUGEM2N2MWMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS/action/storage_attestation","attest_author":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS/action/author_attestation","sign_citation":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS/action/citation_signature","submit_replication":"https://pith.science/pith/HMP2HJFDUTOFZ3KUGEM2N2MWMS/action/replication_record"}},"created_at":"2026-07-05T09:42:45.529303+00:00","updated_at":"2026-07-05T09:42:45.529303+00:00"}