{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3ANYUS3KQPI75474SSNI7S36CC","short_pith_number":"pith:3ANYUS3K","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"},"canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","source":{"kind":"arxiv","id":"1209.6570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6570","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6570v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6570","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"3ANYUS3KQPI7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3ANYUS3KQPI75474","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3ANYUS3K","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3ANYUS3KQPI75474SSNI7S36CC","target":"record","payload":{"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"},"canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","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"},"source_kind":"arxiv","source_id":"1209.6570","source_version":1,"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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK0BD9KDA/4tek+GvgDgGQy7q7X0xXBcAfWMixoPmrY4qqOIGUc0E8mbDDiGHZCuufFKZVGKuz7PAYnSHL0zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:25:21.038297Z"},"content_sha256":"22bc2bba96c7eaec862b75604a4a640d2ce4125d86e018d9fb1e6c27170c1838","schema_version":"1.0","event_id":"sha256:22bc2bba96c7eaec862b75604a4a640d2ce4125d86e018d9fb1e6c27170c1838"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3ANYUS3KQPI75474SSNI7S36CC","target":"graph","payload":{"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"},"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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qQ0P4iHkbTuERxCbyFVWSgxKbZz5ZpbIRYYg6/KJU/hlekJUuCRgz4/LKnbflMqxNwlCNi84OUlwZsnDLJMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:25:21.038698Z"},"content_sha256":"ee728735b3ff20d5b0f84aebe83fafbbe21bca3f1f943ed57ba4ea8f132504d3","schema_version":"1.0","event_id":"sha256:ee728735b3ff20d5b0f84aebe83fafbbe21bca3f1f943ed57ba4ea8f132504d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/bundle.json","state_url":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ANYUS3KQPI75474SSNI7S36CC/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-06-02T19:25:21Z","links":{"resolver":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC","bundle":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/bundle.json","state":"https://pith.science/pith/3ANYUS3KQPI75474SSNI7S36CC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ANYUS3KQPI75474SSNI7S36CC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3ANYUS3KQPI75474SSNI7S36CC","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":"08768b349e752a333aabf148648338b9531317c74a33dddbd318174bde168c5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T17:03:50Z","title_canon_sha256":"4650dc6e1c240d8e1fea90416130f9f5f24a186f74de7e28ed7ee3c916f26514"},"schema_version":"1.0","source":{"id":"1209.6570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6570","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6570v1","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6570","created_at":"2026-05-18T03:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"3ANYUS3KQPI7","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3ANYUS3KQPI75474","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3ANYUS3K","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:ee728735b3ff20d5b0f84aebe83fafbbe21bca3f1f943ed57ba4ea8f132504d3","target":"graph","created_at":"2026-05-18T03:44:25Z","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":"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}}$.","authors_text":"Alan Frieze, Deepak Bal, Patrick Bennett, Tom Bohman","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T17:03:50Z","title":"A greedy algorithm for finding a large 2-matching on a random cubic graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6570","kind":"arxiv","version":1},"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:22bc2bba96c7eaec862b75604a4a640d2ce4125d86e018d9fb1e6c27170c1838","target":"record","created_at":"2026-05-18T03:44:25Z","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":"08768b349e752a333aabf148648338b9531317c74a33dddbd318174bde168c5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-28T17:03:50Z","title_canon_sha256":"4650dc6e1c240d8e1fea90416130f9f5f24a186f74de7e28ed7ee3c916f26514"},"schema_version":"1.0","source":{"id":"1209.6570","kind":"arxiv","version":1}},"canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d81b8a4b6a83d1fef3fc949a8fcb7e10832b0310b34cd30d2bfb36549a909ea4","first_computed_at":"2026-05-18T03:44:25.151066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:25.151066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MZPC3C603H8aRnl3h4P+5dT6QyfhuarwOqTk4hJBhJXsHSSzjYTGU+5NnQbMSxaTrEM2eMxzq/oYIMCCkwqJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:25.151560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22bc2bba96c7eaec862b75604a4a640d2ce4125d86e018d9fb1e6c27170c1838","sha256:ee728735b3ff20d5b0f84aebe83fafbbe21bca3f1f943ed57ba4ea8f132504d3"],"state_sha256":"74d97826411fe688de17524b876ec81418f8d25287a2f8ed49eeae41e998dcf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOhNCA+gYuZPef8z6GBzSZw0B6WkExEEnQ3y/JYmkbYFSXtlOjksOG+1ExroX4x5tHSrR7e/VPHDfsOddUO8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:25:21.040672Z","bundle_sha256":"26a043c57713c530e285c7e1c0133eeb90d153e29746b5ded14af5a010c7c6ef"}}