{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6HORDXZVTK6B34CHRPKWZ7MJAB","short_pith_number":"pith:6HORDXZV","canonical_record":{"source":{"id":"2605.14029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-05-13T18:41:40Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b0fe02f85687f4bddf118b7a3a15c2ef9a3553bb935d763cf8e70a235d778a6f","abstract_canon_sha256":"c2212a6bcc0133dcb7d8f8d27a046660d5bfd16239a2c271be7d943047f007c4"},"schema_version":"1.0"},"canonical_sha256":"f1dd11df359abc1df0478bd56cfd890048f05bed530df659694009a1cbcd121d","source":{"kind":"arxiv","id":"2605.14029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14029","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14029v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14029","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"6HORDXZVTK6B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6HORDXZVTK6B34CH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6HORDXZV","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6HORDXZVTK6B34CHRPKWZ7MJAB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-05-13T18:41:40Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b0fe02f85687f4bddf118b7a3a15c2ef9a3553bb935d763cf8e70a235d778a6f","abstract_canon_sha256":"c2212a6bcc0133dcb7d8f8d27a046660d5bfd16239a2c271be7d943047f007c4"},"schema_version":"1.0"},"canonical_sha256":"f1dd11df359abc1df0478bd56cfd890048f05bed530df659694009a1cbcd121d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.868526Z","signature_b64":"YtPipXzXNfh+dcsmEgGzTvnmYQhG7KL/249ceZEwge0Lyd5m94yvpH3gO5cOX/uxW+HTi+fPj4KWApKtUmFsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1dd11df359abc1df0478bd56cfd890048f05bed530df659694009a1cbcd121d","last_reissued_at":"2026-05-17T23:39:12.867989Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.867989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14029","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-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phYMh4tSvcDBbxKBh3Do9ZbhpI7CCfonI9iDM3RZVtA7xN3jewC/ozOrv2sgAz3XNLwpa6/AoXSWLvJcmfUjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:39.290465Z"},"content_sha256":"c5f9ed8cdb568f7fd13521eab50938fd5775e0f9f541311e58ef742d69600a3a","schema_version":"1.0","event_id":"sha256:c5f9ed8cdb568f7fd13521eab50938fd5775e0f9f541311e58ef742d69600a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6HORDXZVTK6B34CHRPKWZ7MJAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Robust Mesh Simplification for Generated and Real-World 3D Assets","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches.","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Brojeshwar Bhowmick, Kunal Bhosikar, Lokender Tiwari, Preet Savalia","submitted_at":"2026-05-13T18:41:40Z","abstract_excerpt":"The rapid growth of 3D content from modern reconstruction and generative pipelines, such as neural rendering and large-scale 3D asset generation, has led to an abundance of dense, noisy, and often non-manifold meshes. While these representations achieve high visual fidelity, their complexity poses significant challenges for downstream applications in simulation, AR/VR, and scientific computing, where efficient and reliable geometry is essential. This necessitates mesh simplification methods that are not only fast and robust to \"in-the-wild\" inputs, but also capable of preserving fine geometric"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our approach introduces a novel multi-term quadric error formulation that jointly encodes geometric deviation, boundary curvature, and surface normal consistency, enabling optimal vertex placement that preserves sharp features even under aggressive simplification.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the added boundary curvature and normal consistency terms produce measurably better vertex placement and feature preservation than standard quadric error without introducing new artifacts or requiring per-mesh parameter tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FA-QEM extends quadric error metrics with multi-term penalties on geometry, boundaries, and normals to preserve sharp features during aggressive simplification of complex 3D assets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"10f7bc1c7ca71ea9c344c3049f918315feac2d5cc1410e7139fbdf57ad066908"},"source":{"id":"2605.14029","kind":"arxiv","version":1},"verdict":{"id":"5b1142e4-4498-4a08-8631-fb3e4f56ac3c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:45:30.406209Z","strongest_claim":"Our approach introduces a novel multi-term quadric error formulation that jointly encodes geometric deviation, boundary curvature, and surface normal consistency, enabling optimal vertex placement that preserves sharp features even under aggressive simplification.","one_line_summary":"FA-QEM extends quadric error metrics with multi-term penalties on geometry, boundaries, and normals to preserve sharp features during aggressive simplification of complex 3D assets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the added boundary curvature and normal consistency terms produce measurably better vertex placement and feature preservation than standard quadric error without introducing new artifacts or requiring per-mesh parameter tuning.","pith_extraction_headline":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches."},"references":{"count":41,"sample":[{"doi":"","year":2018,"title":"Designing and evaluating a mesh simplification algorithm for virtual reality.ACM Transac- tions on Multimedia Computing, Communications, and Ap- plications, 14:1–26, 2018","work_id":"c333d63d-4dc0-4a6c-90bb-5d8f171e82d1","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Robust low-poly meshing for general 3d mod- els.ACM Trans","work_id":"9e97e9fc-0491-4679-af90-8633ecb6abee","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"P. Cignoni, C. Montani, and R. Scopigno. A comparison of mesh simplification algorithms.Computers & Graphics, 22 (1):37–54, 1998. 2","work_id":"97c29ea7-cafd-442d-b870-3fefb6b0a49f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"M. Garland and P.S. Heckbert. Simplifying surfaces with color and texture using quadric error metrics. InProceed- ings Visualization ’98 (Cat. No.98CB36276), pages 263– 269, 1998. 2, 4","work_id":"768ef1da-a496-4aaf-931f-981eeafd8a82","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Heckbert.Surface Simplifica- tion Using Quadric Error Metrics","work_id":"57e16e46-d1a4-422a-959a-4231cb100d90","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":41,"snapshot_sha256":"146e75a9a00daf82a4d32cdf850b089f25ce285cb91e072a74470ce2a3fb6fab","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8131c2b9bcd19b5b4867e0bed68ef9b37a503f6b6f182882ef12a01231267438"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5b1142e4-4498-4a08-8631-fb3e4f56ac3c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PghgC5mUk1Hq1vGs+Kz9Bzvi2QksvLlFOQSNiMaatHPPKg5rjjzWJljzJDIzoZQHzFaFJywqyVXtOxRfaNpoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:39.291682Z"},"content_sha256":"aafa2c7202d8d796bcc9ed2b82b73f9d2e2935477bc374007978cb192c44cb1e","schema_version":"1.0","event_id":"sha256:aafa2c7202d8d796bcc9ed2b82b73f9d2e2935477bc374007978cb192c44cb1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/bundle.json","state_url":"https://pith.science/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/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-05-31T20:09:39Z","links":{"resolver":"https://pith.science/pith/6HORDXZVTK6B34CHRPKWZ7MJAB","bundle":"https://pith.science/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/bundle.json","state":"https://pith.science/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HORDXZVTK6B34CHRPKWZ7MJAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6HORDXZVTK6B34CHRPKWZ7MJAB","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":"c2212a6bcc0133dcb7d8f8d27a046660d5bfd16239a2c271be7d943047f007c4","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-05-13T18:41:40Z","title_canon_sha256":"b0fe02f85687f4bddf118b7a3a15c2ef9a3553bb935d763cf8e70a235d778a6f"},"schema_version":"1.0","source":{"id":"2605.14029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14029","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14029v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14029","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"6HORDXZVTK6B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6HORDXZVTK6B34CH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6HORDXZV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:aafa2c7202d8d796bcc9ed2b82b73f9d2e2935477bc374007978cb192c44cb1e","target":"graph","created_at":"2026-05-17T23:39:12Z","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":"Our approach introduces a novel multi-term quadric error formulation that jointly encodes geometric deviation, boundary curvature, and surface normal consistency, enabling optimal vertex placement that preserves sharp features even under aggressive simplification."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the added boundary curvature and normal consistency terms produce measurably better vertex placement and feature preservation than standard quadric error without introducing new artifacts or requiring per-mesh parameter tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FA-QEM extends quadric error metrics with multi-term penalties on geometry, boundaries, and normals to preserve sharp features during aggressive simplification of complex 3D assets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches."}],"snapshot_sha256":"10f7bc1c7ca71ea9c344c3049f918315feac2d5cc1410e7139fbdf57ad066908"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8131c2b9bcd19b5b4867e0bed68ef9b37a503f6b6f182882ef12a01231267438"},"paper":{"abstract_excerpt":"The rapid growth of 3D content from modern reconstruction and generative pipelines, such as neural rendering and large-scale 3D asset generation, has led to an abundance of dense, noisy, and often non-manifold meshes. While these representations achieve high visual fidelity, their complexity poses significant challenges for downstream applications in simulation, AR/VR, and scientific computing, where efficient and reliable geometry is essential. This necessitates mesh simplification methods that are not only fast and robust to \"in-the-wild\" inputs, but also capable of preserving fine geometric","authors_text":"Brojeshwar Bhowmick, Kunal Bhosikar, Lokender Tiwari, Preet Savalia","cross_cats":["cs.CG"],"headline":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-05-13T18:41:40Z","title":"Fast and Robust Mesh Simplification for Generated and Real-World 3D Assets"},"references":{"count":41,"internal_anchors":0,"resolved_work":41,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Designing and evaluating a mesh simplification algorithm for virtual reality.ACM Transac- tions on Multimedia Computing, Communications, and Ap- plications, 14:1–26, 2018","work_id":"c333d63d-4dc0-4a6c-90bb-5d8f171e82d1","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Robust low-poly meshing for general 3d mod- els.ACM Trans","work_id":"9e97e9fc-0491-4679-af90-8633ecb6abee","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"P. Cignoni, C. Montani, and R. Scopigno. A comparison of mesh simplification algorithms.Computers & Graphics, 22 (1):37–54, 1998. 2","work_id":"97c29ea7-cafd-442d-b870-3fefb6b0a49f","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"M. Garland and P.S. Heckbert. Simplifying surfaces with color and texture using quadric error metrics. InProceed- ings Visualization ’98 (Cat. No.98CB36276), pages 263– 269, 1998. 2, 4","work_id":"768ef1da-a496-4aaf-931f-981eeafd8a82","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Heckbert.Surface Simplifica- tion Using Quadric Error Metrics","work_id":"57e16e46-d1a4-422a-959a-4231cb100d90","year":2023}],"snapshot_sha256":"146e75a9a00daf82a4d32cdf850b089f25ce285cb91e072a74470ce2a3fb6fab"},"source":{"id":"2605.14029","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T05:45:30.406209Z","id":"5b1142e4-4498-4a08-8631-fb3e4f56ac3c","model_set":{"reader":"grok-4.3"},"one_line_summary":"FA-QEM extends quadric error metrics with multi-term penalties on geometry, boundaries, and normals to preserve sharp features during aggressive simplification of complex 3D assets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A multi-term quadric error metric simplifies noisy 3D meshes faster while preserving sharp features better than standard approaches.","strongest_claim":"Our approach introduces a novel multi-term quadric error formulation that jointly encodes geometric deviation, boundary curvature, and surface normal consistency, enabling optimal vertex placement that preserves sharp features even under aggressive simplification.","weakest_assumption":"That the added boundary curvature and normal consistency terms produce measurably better vertex placement and feature preservation than standard quadric error without introducing new artifacts or requiring per-mesh parameter tuning."}},"verdict_id":"5b1142e4-4498-4a08-8631-fb3e4f56ac3c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c5f9ed8cdb568f7fd13521eab50938fd5775e0f9f541311e58ef742d69600a3a","target":"record","created_at":"2026-05-17T23:39:12Z","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":"c2212a6bcc0133dcb7d8f8d27a046660d5bfd16239a2c271be7d943047f007c4","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-05-13T18:41:40Z","title_canon_sha256":"b0fe02f85687f4bddf118b7a3a15c2ef9a3553bb935d763cf8e70a235d778a6f"},"schema_version":"1.0","source":{"id":"2605.14029","kind":"arxiv","version":1}},"canonical_sha256":"f1dd11df359abc1df0478bd56cfd890048f05bed530df659694009a1cbcd121d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1dd11df359abc1df0478bd56cfd890048f05bed530df659694009a1cbcd121d","first_computed_at":"2026-05-17T23:39:12.867989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.867989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YtPipXzXNfh+dcsmEgGzTvnmYQhG7KL/249ceZEwge0Lyd5m94yvpH3gO5cOX/uxW+HTi+fPj4KWApKtUmFsAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.868526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5f9ed8cdb568f7fd13521eab50938fd5775e0f9f541311e58ef742d69600a3a","sha256:aafa2c7202d8d796bcc9ed2b82b73f9d2e2935477bc374007978cb192c44cb1e"],"state_sha256":"f71fd7c848ceff8846912501b8dfc6659f6952f9fff9290b217deadc4d3bee73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GUWGUJsXK8JL0r4YxKbwrk9sN4q2lYXlifkrkQxQLpzoBuVEPK3fukDZILbtynTEv/LFYhf3nlf1cvnGnFSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:39.297092Z","bundle_sha256":"188a201357f0440837d0d3b54155e76e05a7b2d81e039526b66798a152e231e0"}}