{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RPHQKTP63HAJWKC2DBPVOMSDAQ","short_pith_number":"pith:RPHQKTP6","schema_version":"1.0","canonical_sha256":"8bcf054dfed9c09b285a185f573243041fd9cff1407d1c01778e480c7da967e0","source":{"kind":"arxiv","id":"1509.07384","version":2},"attestation_state":"computed","paper":{"title":"A Hybrid High-Order method for the Cahn-Hilliard problem in mixed form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniele A. Di Pietro, Fabien Marche, Florent Chave, Franck Pigeonneau","submitted_at":"2015-09-24T14:18:13Z","abstract_excerpt":"In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The proposed method has several assets: (i) It supports fairly general meshes possibly containing polygonal elements and nonmatching interfaces, (ii) it allows arbitrary approximation orders, (iii) it has a moderate computational cost thanks to the possibility of locally eliminating element-based unknowns by static condensation. We perform a detailed stability a"},"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":"1509.07384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-24T14:18:13Z","cross_cats_sorted":[],"title_canon_sha256":"e10196b69aec099187479a04fd7689bb6d942ba5b604c7746bf31d32a382f3e7","abstract_canon_sha256":"58eeb5b39aabf5d272b3c1782e14349d384b06ef342cfe9f1645af84b9e800da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:41.318054Z","signature_b64":"ryBjxxsU8gmDWzL2onG/ijBWj4J86ky5e+aUp/1OSgICl/p2IyfONyRbuvLkxT/ODcu+jyRSJD1VQDH6ZGeYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bcf054dfed9c09b285a185f573243041fd9cff1407d1c01778e480c7da967e0","last_reissued_at":"2026-05-18T01:11:41.317721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:41.317721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid High-Order method for the Cahn-Hilliard problem in mixed form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniele A. Di Pietro, Fabien Marche, Florent Chave, Franck Pigeonneau","submitted_at":"2015-09-24T14:18:13Z","abstract_excerpt":"In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The proposed method has several assets: (i) It supports fairly general meshes possibly containing polygonal elements and nonmatching interfaces, (ii) it allows arbitrary approximation orders, (iii) it has a moderate computational cost thanks to the possibility of locally eliminating element-based unknowns by static condensation. We perform a detailed stability a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07384","kind":"arxiv","version":2},"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":"1509.07384","created_at":"2026-05-18T01:11:41.317776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07384v2","created_at":"2026-05-18T01:11:41.317776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07384","created_at":"2026-05-18T01:11:41.317776+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPHQKTP63HAJ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPHQKTP63HAJWKC2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPHQKTP6","created_at":"2026-05-18T12:29:39.896362+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/RPHQKTP63HAJWKC2DBPVOMSDAQ","json":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ.json","graph_json":"https://pith.science/api/pith-number/RPHQKTP63HAJWKC2DBPVOMSDAQ/graph.json","events_json":"https://pith.science/api/pith-number/RPHQKTP63HAJWKC2DBPVOMSDAQ/events.json","paper":"https://pith.science/paper/RPHQKTP6"},"agent_actions":{"view_html":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ","download_json":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ.json","view_paper":"https://pith.science/paper/RPHQKTP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07384&json=true","fetch_graph":"https://pith.science/api/pith-number/RPHQKTP63HAJWKC2DBPVOMSDAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RPHQKTP63HAJWKC2DBPVOMSDAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ/action/storage_attestation","attest_author":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ/action/author_attestation","sign_citation":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ/action/citation_signature","submit_replication":"https://pith.science/pith/RPHQKTP63HAJWKC2DBPVOMSDAQ/action/replication_record"}},"created_at":"2026-05-18T01:11:41.317776+00:00","updated_at":"2026-05-18T01:11:41.317776+00:00"}