{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MGF65TSWCPZWOTM2OYMZQFU5EA","short_pith_number":"pith:MGF65TSW","schema_version":"1.0","canonical_sha256":"618beece5613f3674d9a761998169d20145229d8ec0815d9bf8820add3a47eca","source":{"kind":"arxiv","id":"1904.07061","version":1},"attestation_state":"computed","paper":{"title":"Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.PL","authors_text":"Kirshanthan Sundararajah, Laith Sakka, Milind Kulkarni, Ryan R. Newton","submitted_at":"2019-04-11T18:36:58Z","abstract_excerpt":"Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a common, important optimization technique. In applications such as compilers and render trees, these trees are heterogeneous: different nodes of the tree have different types. Unfortunately, prior work for fusing traversals falls short in different ways: they do not handle heterogeneity; they require using domain-specific languages to express an application; they rely on the programmer to aver that fusing traversals is "},"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":"1904.07061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-11T18:36:58Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"c7ab9132440e79e33c517576745724a8f1b07869130b313d3ae9d47ed61a65c6","abstract_canon_sha256":"ebdc863f83633ca48d3bc0614402def8a7cd6e862d6a32484cb332c4259246c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:08.961582Z","signature_b64":"5VPfcQHqnkVXOlUBnPz1Aa4cbkEOvvYdjbYRB8fdDB4WQ2qbWdxJtAe8jeqGr//HnvAyCf+Wp7rRK0eV0oS8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618beece5613f3674d9a761998169d20145229d8ec0815d9bf8820add3a47eca","last_reissued_at":"2026-05-17T23:48:08.961078Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:08.961078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.PL","authors_text":"Kirshanthan Sundararajah, Laith Sakka, Milind Kulkarni, Ryan R. Newton","submitted_at":"2019-04-11T18:36:58Z","abstract_excerpt":"Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a common, important optimization technique. In applications such as compilers and render trees, these trees are heterogeneous: different nodes of the tree have different types. Unfortunately, prior work for fusing traversals falls short in different ways: they do not handle heterogeneity; they require using domain-specific languages to express an application; they rely on the programmer to aver that fusing traversals is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07061","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":"1904.07061","created_at":"2026-05-17T23:48:08.961157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07061v1","created_at":"2026-05-17T23:48:08.961157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07061","created_at":"2026-05-17T23:48:08.961157+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGF65TSWCPZW","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGF65TSWCPZWOTM2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGF65TSW","created_at":"2026-05-18T12:33:21.387695+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/MGF65TSWCPZWOTM2OYMZQFU5EA","json":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA.json","graph_json":"https://pith.science/api/pith-number/MGF65TSWCPZWOTM2OYMZQFU5EA/graph.json","events_json":"https://pith.science/api/pith-number/MGF65TSWCPZWOTM2OYMZQFU5EA/events.json","paper":"https://pith.science/paper/MGF65TSW"},"agent_actions":{"view_html":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA","download_json":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA.json","view_paper":"https://pith.science/paper/MGF65TSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07061&json=true","fetch_graph":"https://pith.science/api/pith-number/MGF65TSWCPZWOTM2OYMZQFU5EA/graph.json","fetch_events":"https://pith.science/api/pith-number/MGF65TSWCPZWOTM2OYMZQFU5EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA/action/storage_attestation","attest_author":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA/action/author_attestation","sign_citation":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA/action/citation_signature","submit_replication":"https://pith.science/pith/MGF65TSWCPZWOTM2OYMZQFU5EA/action/replication_record"}},"created_at":"2026-05-17T23:48:08.961157+00:00","updated_at":"2026-05-17T23:48:08.961157+00:00"}