{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:R3CPNY7QPSH6SP4EZALGMLIEQ4","short_pith_number":"pith:R3CPNY7Q","canonical_record":{"source":{"id":"1104.2293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-04-12T18:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"5d1701d31aebed010b57802f6c1a308ae56ef5d4303c9c361070134f1d5a1404","abstract_canon_sha256":"c4e53dcf3b092bfcd6d1e32a73416d92ddd7d2015c8a0f66f3ba1207f06c2f4c"},"schema_version":"1.0"},"canonical_sha256":"8ec4f6e3f07c8fe93f84c816662d0487254ff6812f9df2af82407ce1bca4a0da","source":{"kind":"arxiv","id":"1104.2293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2293","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2293v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2293","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"R3CPNY7QPSH6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"R3CPNY7QPSH6SP4E","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"R3CPNY7Q","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:R3CPNY7QPSH6SP4EZALGMLIEQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-04-12T18:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"5d1701d31aebed010b57802f6c1a308ae56ef5d4303c9c361070134f1d5a1404","abstract_canon_sha256":"c4e53dcf3b092bfcd6d1e32a73416d92ddd7d2015c8a0f66f3ba1207f06c2f4c"},"schema_version":"1.0"},"canonical_sha256":"8ec4f6e3f07c8fe93f84c816662d0487254ff6812f9df2af82407ce1bca4a0da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.522947Z","signature_b64":"g3kr5mXOSYi1JXv9JUQ723nstoOorfGn94qoIxl7owZ470sAzu5Rn8FRev9bJA4NgkBd24vNtU2ih3eadr4YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec4f6e3f07c8fe93f84c816662d0487254ff6812f9df2af82407ce1bca4a0da","last_reissued_at":"2026-05-18T04:24:35.522527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.522527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2293","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5v0K/P3rb6HbYfNmpC2ACI8lhs/ky85uEl/mrGbD48ooM2QLT9eOycjOl677LQ8cSrQPC/o6Mn+OJ/kqzGZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:45:08.706377Z"},"content_sha256":"6fa6d32bd9546b6c49a564d5ff7650381df0448a8cb2b5798c63f7fa7a6d4858","schema_version":"1.0","event_id":"sha256:6fa6d32bd9546b6c49a564d5ff7650381df0448a8cb2b5798c63f7fa7a6d4858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:R3CPNY7QPSH6SP4EZALGMLIEQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reactive Imperative Programming with Dataflow Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andrea Ribichini, Camil Demetrescu, Irene Finocchi","submitted_at":"2011-04-12T18:31:17Z","abstract_excerpt":"Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2293","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzlbdxN0EsPXe4xzabcCUKa8dE5CMcyQ2U8qAbJaiw6TyeCdBv0Uxzqi6b/nCco9gSU9aOEYTDJZcmuG0hBpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:45:08.706727Z"},"content_sha256":"860c60f90017f5483cdac05ca4e38be8f37b1301bfdae618d574ebd17ae83754","schema_version":"1.0","event_id":"sha256:860c60f90017f5483cdac05ca4e38be8f37b1301bfdae618d574ebd17ae83754"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/bundle.json","state_url":"https://pith.science/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/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-06-02T21:45:08Z","links":{"resolver":"https://pith.science/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4","bundle":"https://pith.science/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/bundle.json","state":"https://pith.science/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3CPNY7QPSH6SP4EZALGMLIEQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:R3CPNY7QPSH6SP4EZALGMLIEQ4","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":"c4e53dcf3b092bfcd6d1e32a73416d92ddd7d2015c8a0f66f3ba1207f06c2f4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-04-12T18:31:17Z","title_canon_sha256":"5d1701d31aebed010b57802f6c1a308ae56ef5d4303c9c361070134f1d5a1404"},"schema_version":"1.0","source":{"id":"1104.2293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2293","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2293v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2293","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"R3CPNY7QPSH6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"R3CPNY7QPSH6SP4E","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"R3CPNY7Q","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:860c60f90017f5483cdac05ca4e38be8f37b1301bfdae618d574ebd17ae83754","target":"graph","created_at":"2026-05-18T04:24:35Z","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":"Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on","authors_text":"Andrea Ribichini, Camil Demetrescu, Irene Finocchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-04-12T18:31:17Z","title":"Reactive Imperative Programming with Dataflow Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2293","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:6fa6d32bd9546b6c49a564d5ff7650381df0448a8cb2b5798c63f7fa7a6d4858","target":"record","created_at":"2026-05-18T04:24:35Z","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":"c4e53dcf3b092bfcd6d1e32a73416d92ddd7d2015c8a0f66f3ba1207f06c2f4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-04-12T18:31:17Z","title_canon_sha256":"5d1701d31aebed010b57802f6c1a308ae56ef5d4303c9c361070134f1d5a1404"},"schema_version":"1.0","source":{"id":"1104.2293","kind":"arxiv","version":1}},"canonical_sha256":"8ec4f6e3f07c8fe93f84c816662d0487254ff6812f9df2af82407ce1bca4a0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ec4f6e3f07c8fe93f84c816662d0487254ff6812f9df2af82407ce1bca4a0da","first_computed_at":"2026-05-18T04:24:35.522527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:35.522527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3kr5mXOSYi1JXv9JUQ723nstoOorfGn94qoIxl7owZ470sAzu5Rn8FRev9bJA4NgkBd24vNtU2ih3eadr4YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:35.522947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fa6d32bd9546b6c49a564d5ff7650381df0448a8cb2b5798c63f7fa7a6d4858","sha256:860c60f90017f5483cdac05ca4e38be8f37b1301bfdae618d574ebd17ae83754"],"state_sha256":"3145b4dab1bfa903a29231e563f54a1aecc48c2a0414a618147d84082d510148"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CATf2P6Znb8VVg4O+Xa2lNiW3JE/8B9tod5Yi7BqRdZHVj4cZNruwJX6cd92KgDgr4kXzHtRFMYQOEhA6eUaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:45:08.708710Z","bundle_sha256":"0284e5402a52e4e8b2fa5c3e1fb50b97e8e52f3395b8924f9144595e087adaf8"}}