{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4E6WZWFFG3G4ES6X43NAVXW2AU","short_pith_number":"pith:4E6WZWFF","schema_version":"1.0","canonical_sha256":"e13d6cd8a536cdc24bd7e6da0adeda050fa8e492bc54e39c56e1df3be085162d","source":{"kind":"arxiv","id":"1609.08879","version":3},"attestation_state":"computed","paper":{"title":"The Power of Data Reduction for Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Rolf Niedermeier","submitted_at":"2016-09-28T12:16:53Z","abstract_excerpt":"Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For $m$-edge and $n$-vertex graphs, it is well-known to be solvable in $O(m\\sqrt{n})$ time; however, for several applications this running time is still too slow. We investigate how linear-time (and almost linear-time) data reduction (used as preprocessing) can alleviate the situation. More specifically, we focus on (almost) linear-time kernelization. We start a deeper and systematic study both for general graphs and for bipartite graphs. Our data reduction algorithms easily comply "},"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":"1609.08879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T12:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"27b40d8ee0a11169cea826291d662170305e46406c25ba58e45e1ff473c31179","abstract_canon_sha256":"66763416aa4aa123a4490e4e2d46af1360bd783f3219ed2002aa33fab7c4d9d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:32.673521Z","signature_b64":"JfjLdQlTw+nJHtqx0Ky3BRNx0WheJiBbYXDj5gB3STnPJo66qckzYlSHxnMZB1B2/oTD0vGMy4uQLWCW3UrdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13d6cd8a536cdc24bd7e6da0adeda050fa8e492bc54e39c56e1df3be085162d","last_reissued_at":"2026-07-05T01:21:32.673062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:32.673062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Data Reduction for Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, George B. Mertzios, Rolf Niedermeier","submitted_at":"2016-09-28T12:16:53Z","abstract_excerpt":"Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For $m$-edge and $n$-vertex graphs, it is well-known to be solvable in $O(m\\sqrt{n})$ time; however, for several applications this running time is still too slow. We investigate how linear-time (and almost linear-time) data reduction (used as preprocessing) can alleviate the situation. More specifically, we focus on (almost) linear-time kernelization. We start a deeper and systematic study both for general graphs and for bipartite graphs. Our data reduction algorithms easily comply "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08879","kind":"arxiv","version":3},"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/1609.08879/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":"1609.08879","created_at":"2026-07-05T01:21:32.673119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08879v3","created_at":"2026-07-05T01:21:32.673119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08879","created_at":"2026-07-05T01:21:32.673119+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E6WZWFFG3G4","created_at":"2026-07-05T01:21:32.673119+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E6WZWFFG3G4ES6X","created_at":"2026-07-05T01:21:32.673119+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E6WZWFF","created_at":"2026-07-05T01:21:32.673119+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/4E6WZWFFG3G4ES6X43NAVXW2AU","json":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU.json","graph_json":"https://pith.science/api/pith-number/4E6WZWFFG3G4ES6X43NAVXW2AU/graph.json","events_json":"https://pith.science/api/pith-number/4E6WZWFFG3G4ES6X43NAVXW2AU/events.json","paper":"https://pith.science/paper/4E6WZWFF"},"agent_actions":{"view_html":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU","download_json":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU.json","view_paper":"https://pith.science/paper/4E6WZWFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08879&json=true","fetch_graph":"https://pith.science/api/pith-number/4E6WZWFFG3G4ES6X43NAVXW2AU/graph.json","fetch_events":"https://pith.science/api/pith-number/4E6WZWFFG3G4ES6X43NAVXW2AU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU/action/storage_attestation","attest_author":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU/action/author_attestation","sign_citation":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU/action/citation_signature","submit_replication":"https://pith.science/pith/4E6WZWFFG3G4ES6X43NAVXW2AU/action/replication_record"}},"created_at":"2026-07-05T01:21:32.673119+00:00","updated_at":"2026-07-05T01:21:32.673119+00:00"}