{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MCJAIGWSW7A3EWNGEA3JDMGQYP","short_pith_number":"pith:MCJAIGWS","schema_version":"1.0","canonical_sha256":"6092041ad2b7c1b259a6203691b0d0c3c82d01a39072cdb6606ae4301beaf0d9","source":{"kind":"arxiv","id":"1808.07990","version":1},"attestation_state":"computed","paper":{"title":"Making Bubbling Practical","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sergio Antoy, Steven Libby","submitted_at":"2018-08-24T03:06:57Z","abstract_excerpt":"Bubbling is a run-time graph transformation studied for the execution of non-deterministic steps in functional logic computations. This transformation has been proven correct, but as currently formulated it requires information about the entire context of a step, even when the step affects only a handful of nodes. Therefore, despite some advantages, it does not appear to be competitive with approaches that require only localized information, such as backtracking and pull-tabbing. We propose a novel algorithm that executes bubbling steps accessing only local information. To this aim, we define "},"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":"1808.07990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-24T03:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"1bb3bc4b08c36e4e0f0f0c4cfb509f4a48e6b59df3b45179396a738cb01ae4a1","abstract_canon_sha256":"126efaf274fd5cd702d7b1229241b9ada8d1aa1e1da1b3a1ece0fa2bcfc6d817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:22.841653Z","signature_b64":"qahMle1kvFeBda8/GazuhrrgChSiXccnbPfuFO6f1PuaafUGX4wFahfsdlEesMfAhhFUvIzZMb4n5ihIxDMrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6092041ad2b7c1b259a6203691b0d0c3c82d01a39072cdb6606ae4301beaf0d9","last_reissued_at":"2026-05-18T00:07:22.841002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:22.841002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making Bubbling Practical","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sergio Antoy, Steven Libby","submitted_at":"2018-08-24T03:06:57Z","abstract_excerpt":"Bubbling is a run-time graph transformation studied for the execution of non-deterministic steps in functional logic computations. This transformation has been proven correct, but as currently formulated it requires information about the entire context of a step, even when the step affects only a handful of nodes. Therefore, despite some advantages, it does not appear to be competitive with approaches that require only localized information, such as backtracking and pull-tabbing. We propose a novel algorithm that executes bubbling steps accessing only local information. To this aim, we define "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07990","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":"1808.07990","created_at":"2026-05-18T00:07:22.841109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07990v1","created_at":"2026-05-18T00:07:22.841109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07990","created_at":"2026-05-18T00:07:22.841109+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCJAIGWSW7A3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCJAIGWSW7A3EWNG","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCJAIGWS","created_at":"2026-05-18T12:32:37.024351+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/MCJAIGWSW7A3EWNGEA3JDMGQYP","json":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP.json","graph_json":"https://pith.science/api/pith-number/MCJAIGWSW7A3EWNGEA3JDMGQYP/graph.json","events_json":"https://pith.science/api/pith-number/MCJAIGWSW7A3EWNGEA3JDMGQYP/events.json","paper":"https://pith.science/paper/MCJAIGWS"},"agent_actions":{"view_html":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP","download_json":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP.json","view_paper":"https://pith.science/paper/MCJAIGWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07990&json=true","fetch_graph":"https://pith.science/api/pith-number/MCJAIGWSW7A3EWNGEA3JDMGQYP/graph.json","fetch_events":"https://pith.science/api/pith-number/MCJAIGWSW7A3EWNGEA3JDMGQYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP/action/storage_attestation","attest_author":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP/action/author_attestation","sign_citation":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP/action/citation_signature","submit_replication":"https://pith.science/pith/MCJAIGWSW7A3EWNGEA3JDMGQYP/action/replication_record"}},"created_at":"2026-05-18T00:07:22.841109+00:00","updated_at":"2026-05-18T00:07:22.841109+00:00"}