{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QONK5S4V64URXMYGO4ANEAEBHR","short_pith_number":"pith:QONK5S4V","schema_version":"1.0","canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","source":{"kind":"arxiv","id":"1205.3081","version":1},"attestation_state":"computed","paper":{"title":"Efficient Representation of Computational Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anders Logg","submitted_at":"2012-05-14T16:19:29Z","abstract_excerpt":"We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a straightforward and efficient storage scheme for such mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations. The general representation may harbor a wide range of computational meshes, and may also be specialized to provide simple user interfaces for particular meshes, inc"},"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":"1205.3081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T16:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"4f9df37291394a73802836dcb3546d6841f1ff06a1984b03af5dd838cd9fbfdb","abstract_canon_sha256":"3e35fe96fc7304c2ff88df80a2a217ad8721428894d5bec307cc3412bd890b06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:45.320200Z","signature_b64":"AIbgxN++rk7pH2ZCAq0sO2jTZuj2oifhFrB5YHU3+YenHLLszs0dGM3qtIVfrwQsCQdr2m0a21LLZbIqd41bCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","last_reissued_at":"2026-05-18T03:55:45.319754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:45.319754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Representation of Computational Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anders Logg","submitted_at":"2012-05-14T16:19:29Z","abstract_excerpt":"We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a straightforward and efficient storage scheme for such mesh representations and efficient algorithms for computation of arbitrary incidence relations from a given initial and minimal set of incidence relations. The general representation may harbor a wide range of computational meshes, and may also be specialized to provide simple user interfaces for particular meshes, inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3081","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.3081","created_at":"2026-05-18T03:55:45.319814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3081v1","created_at":"2026-05-18T03:55:45.319814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3081","created_at":"2026-05-18T03:55:45.319814+00:00"},{"alias_kind":"pith_short_12","alias_value":"QONK5S4V64UR","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QONK5S4V64URXMYG","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QONK5S4V","created_at":"2026-05-18T12:27:18.751474+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/QONK5S4V64URXMYGO4ANEAEBHR","json":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR.json","graph_json":"https://pith.science/api/pith-number/QONK5S4V64URXMYGO4ANEAEBHR/graph.json","events_json":"https://pith.science/api/pith-number/QONK5S4V64URXMYGO4ANEAEBHR/events.json","paper":"https://pith.science/paper/QONK5S4V"},"agent_actions":{"view_html":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR","download_json":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR.json","view_paper":"https://pith.science/paper/QONK5S4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3081&json=true","fetch_graph":"https://pith.science/api/pith-number/QONK5S4V64URXMYGO4ANEAEBHR/graph.json","fetch_events":"https://pith.science/api/pith-number/QONK5S4V64URXMYGO4ANEAEBHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/action/storage_attestation","attest_author":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/action/author_attestation","sign_citation":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/action/citation_signature","submit_replication":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/action/replication_record"}},"created_at":"2026-05-18T03:55:45.319814+00:00","updated_at":"2026-05-18T03:55:45.319814+00:00"}