{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3ANYUS3KQPI75474SSNI7S36CC","short_pith_number":"pith:3ANYUS3K","schema_version":"1.0","canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","source":{"kind":"arxiv","id":"1209.6570","version":1},"attestation_state":"computed","paper":{"title":"A greedy algorithm for finding a large 2-matching on a random cubic graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Patrick Bennett, Tom Bohman","submitted_at":"2012-09-28T17:03:50Z","abstract_excerpt":"A 2-matching of a graph $G$ is a spanning subgraph with maximum degree two. The size of a 2-matching $U$ is the number of edges in $U$ and this is at least $n-\\k(U)$ where $n$ is the number of vertices of $G$ and $\\k$ denotes the number of components. In this paper, we analyze the performance of a greedy algorithm \\textsc{2greedy} for finding a large 2-matching on a random 3-regular graph. We prove that with high probability, the algorithm outputs a 2-matching $U$ with $\\k(U) = \\tilde{\\Theta}\\of{n^{1/5}}$."},"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":"1209.6570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T17:03:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4650dc6e1c240d8e1fea90416130f9f5f24a186f74de7e28ed7ee3c916f26514","abstract_canon_sha256":"08768b349e752a333aabf148648338b9531317c74a33dddbd318174bde168c5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:25.151560Z","signature_b64":"MZPC3C603H8aRnl3h4P+5dT6QyfhuarwOqTk4hJBhJXsHSSzjYTGU+5NnQbMSxaTrEM2eMxzq/oYIMCCkwqJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","last_reissued_at":"2026-05-18T03:44:25.151066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:25.151066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A greedy algorithm for finding a large 2-matching on a random cubic graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Patrick Bennett, Tom Bohman","submitted_at":"2012-09-28T17:03:50Z","abstract_excerpt":"A 2-matching of a graph $G$ is a spanning subgraph with maximum degree two. The size of a 2-matching $U$ is the number of edges in $U$ and this is at least $n-\\k(U)$ where $n$ is the number of vertices of $G$ and $\\k$ denotes the number of components. In this paper, we analyze the performance of a greedy algorithm \\textsc{2greedy} for finding a large 2-matching on a random 3-regular graph. We prove that with high probability, the algorithm outputs a 2-matching $U$ with $\\k(U) = \\tilde{\\Theta}\\of{n^{1/5}}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6570","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.6570","created_at":"2026-05-18T03:44:25.151136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.6570v1","created_at":"2026-05-18T03:44:25.151136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6570","created_at":"2026-05-18T03:44:25.151136+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ANYUS3KQPI7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ANYUS3KQPI75474","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ANYUS3K","created_at":"2026-05-18T12:26:50.516681+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/3ANYUS3KQPI75474SSNI7S36CC","json":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC.json","graph_json":"https://pith.science/api/pith-number/3ANYUS3KQPI75474SSNI7S36CC/graph.json","events_json":"https://pith.science/api/pith-number/3ANYUS3KQPI75474SSNI7S36CC/events.json","paper":"https://pith.science/paper/3ANYUS3K"},"agent_actions":{"view_html":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC","download_json":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC.json","view_paper":"https://pith.science/paper/3ANYUS3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.6570&json=true","fetch_graph":"https://pith.science/api/pith-number/3ANYUS3KQPI75474SSNI7S36CC/graph.json","fetch_events":"https://pith.science/api/pith-number/3ANYUS3KQPI75474SSNI7S36CC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/action/storage_attestation","attest_author":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/action/author_attestation","sign_citation":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/action/citation_signature","submit_replication":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/action/replication_record"}},"created_at":"2026-05-18T03:44:25.151136+00:00","updated_at":"2026-05-18T03:44:25.151136+00:00"}