{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QONK5S4V64URXMYGO4ANEAEBHR","short_pith_number":"pith:QONK5S4V","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"},"canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","source":{"kind":"arxiv","id":"1205.3081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3081","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3081v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3081","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"QONK5S4V64UR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QONK5S4V64URXMYG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QONK5S4V","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QONK5S4V64URXMYGO4ANEAEBHR","target":"record","payload":{"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"},"canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","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"},"source_kind":"arxiv","source_id":"1205.3081","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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3bH22t6quqQSIdaoq8nh1HhgdWCST1I8fs/KsanuENyqrLHZ2Gxs/i12WKISWbgl/MCkA+zwxpSFh22XevfUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:05:35.559225Z"},"content_sha256":"cbdb2d913263dfb8b872aebe655f56eaf9ed403120ac3007bae58694b422eeea","schema_version":"1.0","event_id":"sha256:cbdb2d913263dfb8b872aebe655f56eaf9ed403120ac3007bae58694b422eeea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QONK5S4V64URXMYGO4ANEAEBHR","target":"graph","payload":{"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"},"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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tT+DyCZvAaUJ6OIFLUp/08PCLXy0rp25TCVsVLJjleqX657wB0eQvJ7ur83FX/jUHgFDBklUS4Bjh3cJ872KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:05:35.559892Z"},"content_sha256":"4d8221b4e03c05c0c4673fce9f83acdf2ff111e5be38381ec928509f6b08ce26","schema_version":"1.0","event_id":"sha256:4d8221b4e03c05c0c4673fce9f83acdf2ff111e5be38381ec928509f6b08ce26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/bundle.json","state_url":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QONK5S4V64URXMYGO4ANEAEBHR/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-30T18:05:35Z","links":{"resolver":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR","bundle":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/bundle.json","state":"https://pith.science/pith/QONK5S4V64URXMYGO4ANEAEBHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QONK5S4V64URXMYGO4ANEAEBHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QONK5S4V64URXMYGO4ANEAEBHR","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":"3e35fe96fc7304c2ff88df80a2a217ad8721428894d5bec307cc3412bd890b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T16:19:29Z","title_canon_sha256":"4f9df37291394a73802836dcb3546d6841f1ff06a1984b03af5dd838cd9fbfdb"},"schema_version":"1.0","source":{"id":"1205.3081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3081","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3081v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3081","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"QONK5S4V64UR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QONK5S4V64URXMYG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QONK5S4V","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:4d8221b4e03c05c0c4673fce9f83acdf2ff111e5be38381ec928509f6b08ce26","target":"graph","created_at":"2026-05-18T03:55:45Z","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 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","authors_text":"Anders Logg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T16:19:29Z","title":"Efficient Representation of Computational Meshes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3081","kind":"arxiv","version":1},"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:cbdb2d913263dfb8b872aebe655f56eaf9ed403120ac3007bae58694b422eeea","target":"record","created_at":"2026-05-18T03:55:45Z","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":"3e35fe96fc7304c2ff88df80a2a217ad8721428894d5bec307cc3412bd890b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-05-14T16:19:29Z","title_canon_sha256":"4f9df37291394a73802836dcb3546d6841f1ff06a1984b03af5dd838cd9fbfdb"},"schema_version":"1.0","source":{"id":"1205.3081","kind":"arxiv","version":1}},"canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"839aaecb95f7291bb3067700d200813c562a78f038a6386c521ea2c76c442288","first_computed_at":"2026-05-18T03:55:45.319754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:45.319754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AIbgxN++rk7pH2ZCAq0sO2jTZuj2oifhFrB5YHU3+YenHLLszs0dGM3qtIVfrwQsCQdr2m0a21LLZbIqd41bCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:45.320200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbdb2d913263dfb8b872aebe655f56eaf9ed403120ac3007bae58694b422eeea","sha256:4d8221b4e03c05c0c4673fce9f83acdf2ff111e5be38381ec928509f6b08ce26"],"state_sha256":"bd1999ceceaa740de327d0539939221d357921cfaf8a8d9df3b4e780218a9d1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYwWN++vhf1AilzkBV7YWvdxKpaMbjQjPjOAhSibTB9JrTqdm20Lq1peLyMel7l0YJimvuKiX7JPPvzjSe4FAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:05:35.563585Z","bundle_sha256":"97f4983db19a5d475dc2eb3571c177fbd25935c76fbdc7c6bd0043438b84162e"}}