{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GIEOEUE2FPRQUYRUOX6HC7NH4D","short_pith_number":"pith:GIEOEUE2","canonical_record":{"source":{"id":"1310.2828","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-10T14:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"12a123216760a6f491bd77aedda4cc6e4566a72dea29e8f9e42d451e08bec66a","abstract_canon_sha256":"45d7af668067293c6fab0761a4fc90ac989543827e3ec90bb87834500a762206"},"schema_version":"1.0"},"canonical_sha256":"3208e2509a2be30a623475fc717da7e0dc872c55976e97f67b174b93fec40f45","source":{"kind":"arxiv","id":"1310.2828","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2828","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2828v3","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2828","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"GIEOEUE2FPRQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GIEOEUE2FPRQUYRU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GIEOEUE2","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GIEOEUE2FPRQUYRUOX6HC7NH4D","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2828","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-10T14:18:38Z","cross_cats_sorted":[],"title_canon_sha256":"12a123216760a6f491bd77aedda4cc6e4566a72dea29e8f9e42d451e08bec66a","abstract_canon_sha256":"45d7af668067293c6fab0761a4fc90ac989543827e3ec90bb87834500a762206"},"schema_version":"1.0"},"canonical_sha256":"3208e2509a2be30a623475fc717da7e0dc872c55976e97f67b174b93fec40f45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.643298Z","signature_b64":"5o39SUlY5cyNVO0B7/EJZYhLviTECqlyXX5DKVy9x0U8aPtyASlgMzE+8/p2Kl/DyjJxOvct9sxKWcR4Jn/MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3208e2509a2be30a623475fc717da7e0dc872c55976e97f67b174b93fec40f45","last_reissued_at":"2026-05-18T02:40:18.642587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.642587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2828","source_version":3,"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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrGq4FTGf3coCtUMPEC5ZIQB2XTvkc9b9/IrC29lo8XwiYrUrhZbACBSIDujRo+w7ISfhzfplH51tedbq/r8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:36:54.170090Z"},"content_sha256":"a995bd1b85779cea92a9a51ffdd1624ab9a87110836b0c27f75887d3cb5a1292","schema_version":"1.0","event_id":"sha256:a995bd1b85779cea92a9a51ffdd1624ab9a87110836b0c27f75887d3cb5a1292"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GIEOEUE2FPRQUYRUOX6HC7NH4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Level Method for Mimetic Finite Difference Discretizations of Elliptic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ludmil Zikatanov, Marco Verani, Paola F. Antonietti","submitted_at":"2013-10-10T14:18:38Z","abstract_excerpt":"We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to achieve convergence is uniformly bounded independently of the characteristic size of the underling partition. We also show that the resulting scheme provides a uniform preconditioner with respect to the number of degrees of freedom. Numerical results that validate the theory are also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2828","kind":"arxiv","version":3},"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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDGWZ9JxkfXWbI5YzHDCHC6WlQVDpyaFiKqjIsAQt0s8CgQdXWXKrp2j8obwFpF6aBLwAsLmV1VvRHzu/YeEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:36:54.170949Z"},"content_sha256":"05f838f04c8d3ffba0d59ca7df7d4fda6bb97b7c46eefc9965142c0da8c6e023","schema_version":"1.0","event_id":"sha256:05f838f04c8d3ffba0d59ca7df7d4fda6bb97b7c46eefc9965142c0da8c6e023"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/bundle.json","state_url":"https://pith.science/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/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-23T23:36:54Z","links":{"resolver":"https://pith.science/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D","bundle":"https://pith.science/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/bundle.json","state":"https://pith.science/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIEOEUE2FPRQUYRUOX6HC7NH4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GIEOEUE2FPRQUYRUOX6HC7NH4D","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":"45d7af668067293c6fab0761a4fc90ac989543827e3ec90bb87834500a762206","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-10T14:18:38Z","title_canon_sha256":"12a123216760a6f491bd77aedda4cc6e4566a72dea29e8f9e42d451e08bec66a"},"schema_version":"1.0","source":{"id":"1310.2828","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2828","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2828v3","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2828","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"GIEOEUE2FPRQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GIEOEUE2FPRQUYRU","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GIEOEUE2","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:05f838f04c8d3ffba0d59ca7df7d4fda6bb97b7c46eefc9965142c0da8c6e023","target":"graph","created_at":"2026-05-18T02:40:18Z","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":"We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to achieve convergence is uniformly bounded independently of the characteristic size of the underling partition. We also show that the resulting scheme provides a uniform preconditioner with respect to the number of degrees of freedom. Numerical results that validate the theory are also presented.","authors_text":"Ludmil Zikatanov, Marco Verani, Paola F. Antonietti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-10T14:18:38Z","title":"A Two-Level Method for Mimetic Finite Difference Discretizations of Elliptic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2828","kind":"arxiv","version":3},"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:a995bd1b85779cea92a9a51ffdd1624ab9a87110836b0c27f75887d3cb5a1292","target":"record","created_at":"2026-05-18T02:40:18Z","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":"45d7af668067293c6fab0761a4fc90ac989543827e3ec90bb87834500a762206","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-10T14:18:38Z","title_canon_sha256":"12a123216760a6f491bd77aedda4cc6e4566a72dea29e8f9e42d451e08bec66a"},"schema_version":"1.0","source":{"id":"1310.2828","kind":"arxiv","version":3}},"canonical_sha256":"3208e2509a2be30a623475fc717da7e0dc872c55976e97f67b174b93fec40f45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3208e2509a2be30a623475fc717da7e0dc872c55976e97f67b174b93fec40f45","first_computed_at":"2026-05-18T02:40:18.642587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:18.642587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5o39SUlY5cyNVO0B7/EJZYhLviTECqlyXX5DKVy9x0U8aPtyASlgMzE+8/p2Kl/DyjJxOvct9sxKWcR4Jn/MBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:18.643298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2828","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a995bd1b85779cea92a9a51ffdd1624ab9a87110836b0c27f75887d3cb5a1292","sha256:05f838f04c8d3ffba0d59ca7df7d4fda6bb97b7c46eefc9965142c0da8c6e023"],"state_sha256":"95f11462dadc94b2fe41336ae516e3d08d4ac4686fbbccdce01861673016eb81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+tqOVpxqm6CxvDcHBNlN8wRfVbBXbSzt8cbODTlmuSS1dbfUCbN9Tl8MukP9kAZjCUKMhlAX/kZ2DRee25gAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:36:54.175177Z","bundle_sha256":"d379c50ef9207411f193926927cdec32b505505f6ec473a40649ceb2836589da"}}