{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TMXEWAUO4DKL263AJ4JJYTHFB4","short_pith_number":"pith:TMXEWAUO","canonical_record":{"source":{"id":"1502.05292","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T16:32:59Z","cross_cats_sorted":[],"title_canon_sha256":"bebecc016f6d50a2094393b4cb7e22a333c486344961298fa41c8f62c01569f0","abstract_canon_sha256":"9dbd2f711e543b2edefc2e1217cf32e65e2283edf5c5508e7936b42599487f06"},"schema_version":"1.0"},"canonical_sha256":"9b2e4b028ee0d4bd7b604f129c4ce50f24ee3fb2cc83671ebe19d6950550d7ba","source":{"kind":"arxiv","id":"1502.05292","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05292","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05292v3","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05292","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"TMXEWAUO4DKL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMXEWAUO4DKL263A","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMXEWAUO","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TMXEWAUO4DKL263AJ4JJYTHFB4","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05292","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T16:32:59Z","cross_cats_sorted":[],"title_canon_sha256":"bebecc016f6d50a2094393b4cb7e22a333c486344961298fa41c8f62c01569f0","abstract_canon_sha256":"9dbd2f711e543b2edefc2e1217cf32e65e2283edf5c5508e7936b42599487f06"},"schema_version":"1.0"},"canonical_sha256":"9b2e4b028ee0d4bd7b604f129c4ce50f24ee3fb2cc83671ebe19d6950550d7ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:30.199189Z","signature_b64":"fA2rLCsXCGiuXBWQFn9Hr0MBbivEAkkJOAae/a4FeXxUAfpNee4aQKmxHJrDa5d4E3VXBKDuWfuy/hkycgGLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b2e4b028ee0d4bd7b604f129c4ce50f24ee3fb2cc83671ebe19d6950550d7ba","last_reissued_at":"2026-05-18T01:32:30.198411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:30.198411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05292","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-18T01:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcrgdkLGhB6iBE9fIlC9i7OZSHl53qw6FRwVZIrO+LeYJH/NNinLvAUpwnWZML0JX9MStfNXA4nnoSCzjT2UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:30:35.077305Z"},"content_sha256":"a1094b5f72b157b8214b48e69a40d50c6cb651f55c0ecd90b958d940e8979854","schema_version":"1.0","event_id":"sha256:a1094b5f72b157b8214b48e69a40d50c6cb651f55c0ecd90b958d940e8979854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TMXEWAUO4DKL263AJ4JJYTHFB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic subtrees queries revisited: the Depth First Tour Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gabriele Farina, Luigi Laura","submitted_at":"2015-02-18T16:32:59Z","abstract_excerpt":"In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing edges. Depending on the application, information can be associated to nodes or edges (or both), and queries might require to combine values in path or (sub)trees.\n  In this paper we present a novel data structure, called the Depth First Tour Tree, based on a linearization of a DFS visit of the tree. Despite the simplicity of the approach, similar to the ET-Trees (based on a Euler Tour), our data structure is able to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05292","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-18T01:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFD+298bE5nHdAhTdsg0Cplf9zMZOn19+kbITwCl+kf+E1zhZsykdv3NOUNuv0Vgi5kmIpUkFhcpZ6M6Mu+hBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:30:35.077728Z"},"content_sha256":"d7af3318acfed141a48f69bd015b048b58e260bd84d95cc5f487934ead005a88","schema_version":"1.0","event_id":"sha256:d7af3318acfed141a48f69bd015b048b58e260bd84d95cc5f487934ead005a88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/bundle.json","state_url":"https://pith.science/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/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-29T17:30:35Z","links":{"resolver":"https://pith.science/pith/TMXEWAUO4DKL263AJ4JJYTHFB4","bundle":"https://pith.science/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/bundle.json","state":"https://pith.science/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMXEWAUO4DKL263AJ4JJYTHFB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TMXEWAUO4DKL263AJ4JJYTHFB4","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":"9dbd2f711e543b2edefc2e1217cf32e65e2283edf5c5508e7936b42599487f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T16:32:59Z","title_canon_sha256":"bebecc016f6d50a2094393b4cb7e22a333c486344961298fa41c8f62c01569f0"},"schema_version":"1.0","source":{"id":"1502.05292","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05292","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05292v3","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05292","created_at":"2026-05-18T01:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"TMXEWAUO4DKL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TMXEWAUO4DKL263A","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TMXEWAUO","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d7af3318acfed141a48f69bd015b048b58e260bd84d95cc5f487934ead005a88","target":"graph","created_at":"2026-05-18T01:32:30Z","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":"In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing edges. Depending on the application, information can be associated to nodes or edges (or both), and queries might require to combine values in path or (sub)trees.\n  In this paper we present a novel data structure, called the Depth First Tour Tree, based on a linearization of a DFS visit of the tree. Despite the simplicity of the approach, similar to the ET-Trees (based on a Euler Tour), our data structure is able to ","authors_text":"Gabriele Farina, Luigi Laura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T16:32:59Z","title":"Dynamic subtrees queries revisited: the Depth First Tour Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05292","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:a1094b5f72b157b8214b48e69a40d50c6cb651f55c0ecd90b958d940e8979854","target":"record","created_at":"2026-05-18T01:32:30Z","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":"9dbd2f711e543b2edefc2e1217cf32e65e2283edf5c5508e7936b42599487f06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T16:32:59Z","title_canon_sha256":"bebecc016f6d50a2094393b4cb7e22a333c486344961298fa41c8f62c01569f0"},"schema_version":"1.0","source":{"id":"1502.05292","kind":"arxiv","version":3}},"canonical_sha256":"9b2e4b028ee0d4bd7b604f129c4ce50f24ee3fb2cc83671ebe19d6950550d7ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b2e4b028ee0d4bd7b604f129c4ce50f24ee3fb2cc83671ebe19d6950550d7ba","first_computed_at":"2026-05-18T01:32:30.198411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:30.198411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fA2rLCsXCGiuXBWQFn9Hr0MBbivEAkkJOAae/a4FeXxUAfpNee4aQKmxHJrDa5d4E3VXBKDuWfuy/hkycgGLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:30.199189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05292","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1094b5f72b157b8214b48e69a40d50c6cb651f55c0ecd90b958d940e8979854","sha256:d7af3318acfed141a48f69bd015b048b58e260bd84d95cc5f487934ead005a88"],"state_sha256":"674b0f52ad7c93b1eb1125352ed27b5cdeef59f9234aec84d4763ae5d3242661"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fANeMUHo1qZbZR84qK6hiUQlo+GZ+nuoflkT5jIQ6P/nWlof/Lis8uiHWsZPjzQLxBkMEbIcDxlqzhxBj4ABAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:30:35.079834Z","bundle_sha256":"9b2cb384a0471109873520d55430fb2ce092e2a07dc31ee46033c408fe86cd78"}}