{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N6GU4YCX3RAQ56FBKSRTZXLY73","short_pith_number":"pith:N6GU4YCX","canonical_record":{"source":{"id":"2605.13264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"747c6329186ea98414002dbbc467e4de09f1f5f2f37dd0c1f9e5365be78953b6","abstract_canon_sha256":"89893655d03c07aab82e493ed435ec0132af8e91be3b7db8b3482b23b997ce8c"},"schema_version":"1.0"},"canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","source":{"kind":"arxiv","id":"2605.13264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13264","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13264v1","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13264","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"N6GU4YCX3RAQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"N6GU4YCX3RAQ56FB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"N6GU4YCX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N6GU4YCX3RAQ56FBKSRTZXLY73","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"747c6329186ea98414002dbbc467e4de09f1f5f2f37dd0c1f9e5365be78953b6","abstract_canon_sha256":"89893655d03c07aab82e493ed435ec0132af8e91be3b7db8b3482b23b997ce8c"},"schema_version":"1.0"},"canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:49.328349Z","signature_b64":"jyXvZN9kv5lesyI9IwmVK2fVKHLqsDcW8y1Tixfy4TOoHiN+GhhVAYVwawVH95Kwd1RoJzI9ttFZYQgXRslUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","last_reissued_at":"2026-05-18T02:44:49.327891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:49.327891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13264","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-18T02:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2ubLPGSgoyo8xZ0+0/s5AIseqyPTw/+/WwWt9HiDe5n3NdKJZrGFJSUr7BzDfs4DElIRtdKWmzEBObipJxzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:10:50.119426Z"},"content_sha256":"c43669950fa1a46f24fee7d84dd8e6656ccc5434ee1d3e0b0269255238b1240b","schema_version":"1.0","event_id":"sha256:c43669950fa1a46f24fee7d84dd8e6656ccc5434ee1d3e0b0269255238b1240b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N6GU4YCX3RAQ56FBKSRTZXLY73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Davies-Peck","submitted_at":"2026-05-13T09:45:29Z","abstract_excerpt":"The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\\Omega(\\min\\{\\sqrt{\\frac{\\log n}{\\log\\log n}}, \\frac{\\log \\Delta}{\\log\\log \\Delta}\\})$ rounds, for any polylogarithmic or smaller approximation ratio. As a function of $\\Delta$, this complexity was subsequently matched for constant-approximate weighted vertex cover [Bar-Yehuda, Censor-Hillel and Schwartzman, JACM 2017] and constant-approximate maximum matching [Bar-Yehuda, Censor-Hillel, Ghaffari and Sch"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91664b3890cefacf4aced56d95d9fe3e9ac1b093ec7a27209d890cdccd6ab5a0"},"source":{"id":"2605.13264","kind":"arxiv","version":1},"verdict":{"id":"0f44f64b-cb96-464a-8218-d83ed0f5468d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:54:30.384808Z","strongest_claim":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds.","one_line_summary":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model.","pith_extraction_headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model."},"references":{"count":23,"sample":[{"doi":"","year":1989,"title":"B. Awerbuch, M. Luby, A.V. Goldberg, and S.A. Plotkin. Network decomposition and locality in distributed computation. In30th Annual Symposium on Foundations of Computer Science, pages 364– 369, 1989","work_id":"1a10d076-efec-488c-b4df-0dc5451c09c9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Massively parallel minimum spanning tree in general metric spaces","work_id":"48be5ec4-a716-4560-b4ce-e2bd8efdea18","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Distributed approximation of maximum independent set and maximum matching","work_id":"925adcc0-7778-4c31-9e6d-01fe1140478d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"A distributed(2 +ε)- approximation for vertex cover inO(log ∆/εlog log ∆)rounds.J","work_id":"2170eafe-fd17-44ce-8cda-5330beddbaa4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"The locality of distributed symmetry breaking","work_id":"7bdf13b3-86be-4a41-8a48-ca67ffd38dda","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"472c27fd45f1f7a047a3fbe456c080337a08d75eac54cd8999d7d480d3394b12","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":"0f44f64b-cb96-464a-8218-d83ed0f5468d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/XTVSxTJjKcWwIU7InlcbUcrPmAhEf2jeURLyx7lcf8a/P366BITLf/tosIYoFy4VgPFcqxj1G9FTWO5wkrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:10:50.120537Z"},"content_sha256":"2a2db11b63e95420beaa318bded856f08ae577b75e47c88bcf8700d78647cc00","schema_version":"1.0","event_id":"sha256:2a2db11b63e95420beaa318bded856f08ae577b75e47c88bcf8700d78647cc00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/bundle.json","state_url":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/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-11T01:10:50Z","links":{"resolver":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73","bundle":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/bundle.json","state":"https://pith.science/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6GU4YCX3RAQ56FBKSRTZXLY73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N6GU4YCX3RAQ56FBKSRTZXLY73","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":"89893655d03c07aab82e493ed435ec0132af8e91be3b7db8b3482b23b997ce8c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","title_canon_sha256":"747c6329186ea98414002dbbc467e4de09f1f5f2f37dd0c1f9e5365be78953b6"},"schema_version":"1.0","source":{"id":"2605.13264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13264","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13264v1","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13264","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"N6GU4YCX3RAQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"N6GU4YCX3RAQ56FB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"N6GU4YCX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2a2db11b63e95420beaa318bded856f08ae577b75e47c88bcf8700d78647cc00","target":"graph","created_at":"2026-05-18T02:44:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model."}],"snapshot_sha256":"91664b3890cefacf4aced56d95d9fe3e9ac1b093ec7a27209d890cdccd6ab5a0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\\Omega(\\min\\{\\sqrt{\\frac{\\log n}{\\log\\log n}}, \\frac{\\log \\Delta}{\\log\\log \\Delta}\\})$ rounds, for any polylogarithmic or smaller approximation ratio. As a function of $\\Delta$, this complexity was subsequently matched for constant-approximate weighted vertex cover [Bar-Yehuda, Censor-Hillel and Schwartzman, JACM 2017] and constant-approximate maximum matching [Bar-Yehuda, Censor-Hillel, Ghaffari and Sch","authors_text":"Peter Davies-Peck","cross_cats":[],"headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","title":"Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition"},"references":{"count":23,"internal_anchors":0,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"B. Awerbuch, M. Luby, A.V. Goldberg, and S.A. Plotkin. Network decomposition and locality in distributed computation. In30th Annual Symposium on Foundations of Computer Science, pages 364– 369, 1989","work_id":"1a10d076-efec-488c-b4df-0dc5451c09c9","year":1989},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Massively parallel minimum spanning tree in general metric spaces","work_id":"48be5ec4-a716-4560-b4ce-e2bd8efdea18","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Distributed approximation of maximum independent set and maximum matching","work_id":"925adcc0-7778-4c31-9e6d-01fe1140478d","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A distributed(2 +ε)- approximation for vertex cover inO(log ∆/εlog log ∆)rounds.J","work_id":"2170eafe-fd17-44ce-8cda-5330beddbaa4","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The locality of distributed symmetry breaking","work_id":"7bdf13b3-86be-4a41-8a48-ca67ffd38dda","year":2016}],"snapshot_sha256":"472c27fd45f1f7a047a3fbe456c080337a08d75eac54cd8999d7d480d3394b12"},"source":{"id":"2605.13264","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:54:30.384808Z","id":"0f44f64b-cb96-464a-8218-d83ed0f5468d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Randomized algorithms achieve 2+ε-approximate maximum matching and approximate weighted minimum vertex cover in O(log n / log² log n) rounds in the LOCAL model.","strongest_claim":"We show randomized algorithms for 2+ε-approximate maximum matching and approximate (weighted) minimum vertex cover taking O(log n / log² log n) rounds.","weakest_assumption":"The novel graph decomposition generalizing Miller, Peng and Xu works as claimed to reduce the effective degree of high-degree graphs in the LOCAL model."}},"verdict_id":"0f44f64b-cb96-464a-8218-d83ed0f5468d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c43669950fa1a46f24fee7d84dd8e6656ccc5434ee1d3e0b0269255238b1240b","target":"record","created_at":"2026-05-18T02:44:49Z","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":"89893655d03c07aab82e493ed435ec0132af8e91be3b7db8b3482b23b997ce8c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T09:45:29Z","title_canon_sha256":"747c6329186ea98414002dbbc467e4de09f1f5f2f37dd0c1f9e5365be78953b6"},"schema_version":"1.0","source":{"id":"2605.13264","kind":"arxiv","version":1}},"canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f8d4e6057dc410ef8a154a33cdd78fec0d56b159e69a643ef0e6dae34a4d73c","first_computed_at":"2026-05-18T02:44:49.327891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:49.327891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jyXvZN9kv5lesyI9IwmVK2fVKHLqsDcW8y1Tixfy4TOoHiN+GhhVAYVwawVH95Kwd1RoJzI9ttFZYQgXRslUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:49.328349Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c43669950fa1a46f24fee7d84dd8e6656ccc5434ee1d3e0b0269255238b1240b","sha256:2a2db11b63e95420beaa318bded856f08ae577b75e47c88bcf8700d78647cc00"],"state_sha256":"1e64ab7874e79d7282c0be99aec455fe12874db880079b307b94a222e1d1707c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKwS3+zam2Rw7acdR36MTQ816P6lfcvjVdFIeEpxqJNaMJX/5tf5TxaCxcICh/WiAfQkkQuUf637mv+Vry0oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:10:50.125818Z","bundle_sha256":"5797a369e246c9f87c89bcc2dddf73e8816034484d3328b79bb65957860c8aac"}}