{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QWUYKFOXYPDONJ6LOQPGE35YGG","short_pith_number":"pith:QWUYKFOX","canonical_record":{"source":{"id":"1611.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-11-24T17:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"1cca1280927f8287d7c49d85ecbd6f123d5df6a147d26c3462bcfe1070d609a3","abstract_canon_sha256":"22954c78b765357c97dea792356e55935beccf60f7f0fff8d41ce10985fe48c8"},"schema_version":"1.0"},"canonical_sha256":"85a98515d7c3c6e6a7cb741e626fb831a9787ffdc01c29af021d67a998593fe7","source":{"kind":"arxiv","id":"1611.08266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08266","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08266v1","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08266","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"QWUYKFOXYPDO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWUYKFOXYPDONJ6L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWUYKFOX","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QWUYKFOXYPDONJ6LOQPGE35YGG","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-11-24T17:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"1cca1280927f8287d7c49d85ecbd6f123d5df6a147d26c3462bcfe1070d609a3","abstract_canon_sha256":"22954c78b765357c97dea792356e55935beccf60f7f0fff8d41ce10985fe48c8"},"schema_version":"1.0"},"canonical_sha256":"85a98515d7c3c6e6a7cb741e626fb831a9787ffdc01c29af021d67a998593fe7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:39.664628Z","signature_b64":"Hdq6vyet84Up/uQjCunmv2CbhueCuS/RJj4pOB6cA4MUzqXROtan28lXwgFgqfM/tK1s8CGQUx297N4+MrPVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85a98515d7c3c6e6a7cb741e626fb831a9787ffdc01c29af021d67a998593fe7","last_reissued_at":"2026-05-18T00:56:39.663876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:39.663876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08266","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-18T00:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tA8dMWZ19519KOyv55T9pCsB+lDv6WAQp7oj1sZpuXl6q3btFPg5XUvDZ61YOadGsEEm0NKVUTAsQPRPrIA9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:00:16.042145Z"},"content_sha256":"5148cba0945c2556c369dc26f7dd9d229797c81023c7a38fa14b1bd4110b7163","schema_version":"1.0","event_id":"sha256:5148cba0945c2556c369dc26f7dd9d229797c81023c7a38fa14b1bd4110b7163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QWUYKFOXYPDONJ6LOQPGE35YGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Researches on Dynamic Load Balancing Algorithms and hp-Adaptivity in 3-D Parallel Adaptive Finite Element Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Hui Liu","submitted_at":"2016-11-24T17:31:41Z","abstract_excerpt":"This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The main results of this work are as follows.\n  1) For the tetrahedral meshes used in PHG, under reasonable assumptions, we proved the existence of through-vertex Hamiltonian paths between arbitrary two vertices, as well as the existence of through-vertex Hamiltonian cycles, and designed an efficient algorithm with linear complexity for constructing through-vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08266","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-18T00:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLTolo2QXUx+eN5/2KnkHqhxohhWP1veJ5vJfUHw/+g+YAYppYu6klSa8vYyE0aHOJfJmCt8fs72YbyaeEk3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:00:16.042795Z"},"content_sha256":"12d2f2d14a58d8684c544fcd0d5b1ec1b52a97b0a3510760aa5f076289405db6","schema_version":"1.0","event_id":"sha256:12d2f2d14a58d8684c544fcd0d5b1ec1b52a97b0a3510760aa5f076289405db6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/bundle.json","state_url":"https://pith.science/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/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-27T03:00:16Z","links":{"resolver":"https://pith.science/pith/QWUYKFOXYPDONJ6LOQPGE35YGG","bundle":"https://pith.science/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/bundle.json","state":"https://pith.science/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWUYKFOXYPDONJ6LOQPGE35YGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QWUYKFOXYPDONJ6LOQPGE35YGG","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":"22954c78b765357c97dea792356e55935beccf60f7f0fff8d41ce10985fe48c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-11-24T17:31:41Z","title_canon_sha256":"1cca1280927f8287d7c49d85ecbd6f123d5df6a147d26c3462bcfe1070d609a3"},"schema_version":"1.0","source":{"id":"1611.08266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08266","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08266v1","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08266","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"QWUYKFOXYPDO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QWUYKFOXYPDONJ6L","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QWUYKFOX","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:12d2f2d14a58d8684c544fcd0d5b1ec1b52a97b0a3510760aa5f076289405db6","target":"graph","created_at":"2026-05-18T00:56:39Z","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":"This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The main results of this work are as follows.\n  1) For the tetrahedral meshes used in PHG, under reasonable assumptions, we proved the existence of through-vertex Hamiltonian paths between arbitrary two vertices, as well as the existence of through-vertex Hamiltonian cycles, and designed an efficient algorithm with linear complexity for constructing through-vert","authors_text":"Hui Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-11-24T17:31:41Z","title":"Researches on Dynamic Load Balancing Algorithms and hp-Adaptivity in 3-D Parallel Adaptive Finite Element Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08266","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:5148cba0945c2556c369dc26f7dd9d229797c81023c7a38fa14b1bd4110b7163","target":"record","created_at":"2026-05-18T00:56:39Z","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":"22954c78b765357c97dea792356e55935beccf60f7f0fff8d41ce10985fe48c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2016-11-24T17:31:41Z","title_canon_sha256":"1cca1280927f8287d7c49d85ecbd6f123d5df6a147d26c3462bcfe1070d609a3"},"schema_version":"1.0","source":{"id":"1611.08266","kind":"arxiv","version":1}},"canonical_sha256":"85a98515d7c3c6e6a7cb741e626fb831a9787ffdc01c29af021d67a998593fe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85a98515d7c3c6e6a7cb741e626fb831a9787ffdc01c29af021d67a998593fe7","first_computed_at":"2026-05-18T00:56:39.663876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:39.663876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hdq6vyet84Up/uQjCunmv2CbhueCuS/RJj4pOB6cA4MUzqXROtan28lXwgFgqfM/tK1s8CGQUx297N4+MrPVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:39.664628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5148cba0945c2556c369dc26f7dd9d229797c81023c7a38fa14b1bd4110b7163","sha256:12d2f2d14a58d8684c544fcd0d5b1ec1b52a97b0a3510760aa5f076289405db6"],"state_sha256":"b1686b849d2e905e265e11bfcf1e005db18bae14e05699f2559f8921b0af8b8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYMT5FZhznK6KL8MxetLhGzJ+e8z1QueJSt4GH6ioULdrh9QsC6mbYnGxuCKi3W9MA7QY4TT0MZeOeZK6YHSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:00:16.046101Z","bundle_sha256":"7ea48eac943bc1de8ed662a7a78c56963b7bfbc1553d4a74da3d3f451ff367fc"}}