{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VAAG4FGKOOD5QI4NV2S332HONO","short_pith_number":"pith:VAAG4FGK","schema_version":"1.0","canonical_sha256":"a8006e14ca7387d8238daea5bde8ee6bb13e9b3ba0d280bbe640d4de01edacdf","source":{"kind":"arxiv","id":"1406.4005","version":2},"attestation_state":"computed","paper":{"title":"Maintaining Contour Trees of Dynamic Terrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jungwoo Yang, Lars Arge, Morten Revsb{\\ae}k, Pankaj K. Agarwal, Thomas M{\\o}lhave","submitted_at":"2014-06-16T13:19:22Z","abstract_excerpt":"We consider maintaining the contour tree $\\mathbb{T}$ of a piecewise-linear triangulation $\\mathbb{M}$ that is the graph of a time varying height function $h: \\mathbb{R}^2 \\rightarrow \\mathbb{R}$. We carefully describe the combinatorial change in $\\mathbb{T}$ that happen as $h$ varies over time and how these changes relate to topological changes in $\\mathbb{M}$. We present a kinetic data structure that maintains the contour tree of $h$ over time. Our data structure maintains certificates that fail only when $h(v)=h(u)$ for two adjacent vertices $v$ and $u$ in $\\mathbb{M}$, or when two saddle v"},"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":"1406.4005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-16T13:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"6f254c601101f879302612542cee85bd07ddc63e2ffa0f149a7e1a21b7a81482","abstract_canon_sha256":"338f17a1fe085908c5ab63e967af39f5aeefd782432c782c22d31ab5aa9e1b4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:02.967754Z","signature_b64":"X/jiFilZ+hYlQGdWiUcH101J2OvLMncoPi00R17ZzeKdirONCXEaqHN4Ru/wOtNPWFHDxuoq/ZCTQPVzOCEvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8006e14ca7387d8238daea5bde8ee6bb13e9b3ba0d280bbe640d4de01edacdf","last_reissued_at":"2026-05-18T02:49:02.967279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:02.967279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maintaining Contour Trees of Dynamic Terrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jungwoo Yang, Lars Arge, Morten Revsb{\\ae}k, Pankaj K. Agarwal, Thomas M{\\o}lhave","submitted_at":"2014-06-16T13:19:22Z","abstract_excerpt":"We consider maintaining the contour tree $\\mathbb{T}$ of a piecewise-linear triangulation $\\mathbb{M}$ that is the graph of a time varying height function $h: \\mathbb{R}^2 \\rightarrow \\mathbb{R}$. We carefully describe the combinatorial change in $\\mathbb{T}$ that happen as $h$ varies over time and how these changes relate to topological changes in $\\mathbb{M}$. We present a kinetic data structure that maintains the contour tree of $h$ over time. Our data structure maintains certificates that fail only when $h(v)=h(u)$ for two adjacent vertices $v$ and $u$ in $\\mathbb{M}$, or when two saddle v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4005","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":"1406.4005","created_at":"2026-05-18T02:49:02.967360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4005v2","created_at":"2026-05-18T02:49:02.967360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4005","created_at":"2026-05-18T02:49:02.967360+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAAG4FGKOOD5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAAG4FGKOOD5QI4N","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAAG4FGK","created_at":"2026-05-18T12:28:52.271510+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/VAAG4FGKOOD5QI4NV2S332HONO","json":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO.json","graph_json":"https://pith.science/api/pith-number/VAAG4FGKOOD5QI4NV2S332HONO/graph.json","events_json":"https://pith.science/api/pith-number/VAAG4FGKOOD5QI4NV2S332HONO/events.json","paper":"https://pith.science/paper/VAAG4FGK"},"agent_actions":{"view_html":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO","download_json":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO.json","view_paper":"https://pith.science/paper/VAAG4FGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4005&json=true","fetch_graph":"https://pith.science/api/pith-number/VAAG4FGKOOD5QI4NV2S332HONO/graph.json","fetch_events":"https://pith.science/api/pith-number/VAAG4FGKOOD5QI4NV2S332HONO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO/action/storage_attestation","attest_author":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO/action/author_attestation","sign_citation":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO/action/citation_signature","submit_replication":"https://pith.science/pith/VAAG4FGKOOD5QI4NV2S332HONO/action/replication_record"}},"created_at":"2026-05-18T02:49:02.967360+00:00","updated_at":"2026-05-18T02:49:02.967360+00:00"}