{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4YJCNS7U2VD6F27GAANXEBLTIE","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":"8538a770afbea97e0a0703edaf3df2774ef00f20c4d96148a15bd912c0c81130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T19:43:29Z","title_canon_sha256":"76fff2dfd0825421b1671db68458375c5092c01e2e97f95923eb4979db8bf7b2"},"schema_version":"1.0","source":{"id":"1806.09683","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09683","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09683v3","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09683","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"4YJCNS7U2VD6","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"4YJCNS7U2VD6F27G","created_at":"2026-07-05T02:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"4YJCNS7U","created_at":"2026-07-05T02:38:11Z"}],"graph_snapshots":[{"event_id":"sha256:ce27e3edec855a1ba37394949bb39eb01acf2648a036f9ede68c96461d2e62e9","target":"graph","created_at":"2026-07-05T02:38:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1806.09683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For $n$-vertex and $m$-edge graphs, the best known algorithms run in $\\widetilde{O}(m\\sqrt{n})$ time. We build on recent theoretical work focusing on linear-time data reduction rules for finding maximum-cardinality matchings and complement the theoretical results by presenting and analyzing (thereby employing the kernelization methodology of parameterized complexity analysis) new (near-)linear-time data reduction rules for both the unwe","authors_text":"Andr\\'e Nichterlein, Philipp Zschoche, Rolf Niedermeier, Tomohiro Koana, Viatcheslav Korenwein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T19:43:29Z","title":"Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09683","kind":"arxiv","version":3},"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:0cf7063f4ac4ec8139fd6baaf907f44da4401641e9c4acfc78a5cfb5085cd92f","target":"record","created_at":"2026-07-05T02:38:11Z","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":"8538a770afbea97e0a0703edaf3df2774ef00f20c4d96148a15bd912c0c81130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T19:43:29Z","title_canon_sha256":"76fff2dfd0825421b1671db68458375c5092c01e2e97f95923eb4979db8bf7b2"},"schema_version":"1.0","source":{"id":"1806.09683","kind":"arxiv","version":3}},"canonical_sha256":"e61226cbf4d547e2ebe6001b72057341170dc8f152891c7ab41a9c6168c49817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e61226cbf4d547e2ebe6001b72057341170dc8f152891c7ab41a9c6168c49817","first_computed_at":"2026-07-05T02:38:11.723579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:11.723579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hyInurRbboLbkwgNLdQe52WdPzyjpqCyUmtwMEk4z1RF4t+EP771r8dCQO0SgiyPGIj/EC7zv/pDe+i/JDwXBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:11.724254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09683","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cf7063f4ac4ec8139fd6baaf907f44da4401641e9c4acfc78a5cfb5085cd92f","sha256:ce27e3edec855a1ba37394949bb39eb01acf2648a036f9ede68c96461d2e62e9"],"state_sha256":"4d33157c69e11633e86d00e9f4c2f2f00ad04930659f184a18e2561f0f30afb4"}