{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WHAFJHUQECBI6GRM3PA3MCZEZP","short_pith_number":"pith:WHAFJHUQ","canonical_record":{"source":{"id":"1101.3356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-01-17T23:51:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"21ced891e1085c4698fb09e4811ab02905d3db57425346125e66e19d0226bb88","abstract_canon_sha256":"72ada640fb18d7688fc52e2a9e79b638b8fd1fad451bb970fd710e747aa5b6de"},"schema_version":"1.0"},"canonical_sha256":"b1c0549e9020828f1a2cdbc1b60b24cbc064727236c0a271ab70fb4446f38a57","source":{"kind":"arxiv","id":"1101.3356","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3356","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3356v2","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3356","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"WHAFJHUQECBI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WHAFJHUQECBI6GRM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WHAFJHUQ","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WHAFJHUQECBI6GRM3PA3MCZEZP","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-01-17T23:51:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"21ced891e1085c4698fb09e4811ab02905d3db57425346125e66e19d0226bb88","abstract_canon_sha256":"72ada640fb18d7688fc52e2a9e79b638b8fd1fad451bb970fd710e747aa5b6de"},"schema_version":"1.0"},"canonical_sha256":"b1c0549e9020828f1a2cdbc1b60b24cbc064727236c0a271ab70fb4446f38a57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:21.978158Z","signature_b64":"NqeaB33FadRT/gpBUz1XdLdMkgElvGhV1BkLihgzdTooLLMdstdWYZ462EqalbBwTgyAV4J7F7Tgprp6hidTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1c0549e9020828f1a2cdbc1b60b24cbc064727236c0a271ab70fb4446f38a57","last_reissued_at":"2026-05-18T04:31:21.977677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:21.977677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3356","source_version":2,"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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yk8S2k0eEMotkifCGZYUyIM5rlO+6MGLEWJsV9Z2GSCS7cQC9YWRRh3ybhiNgz0DavoE3UqpUikJBEw9o0viBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:10:09.431628Z"},"content_sha256":"2a7ab4645278ae107c47f13b34041961023baff4001c4d2392b862745be06ab4","schema_version":"1.0","event_id":"sha256:2a7ab4645278ae107c47f13b34041961023baff4001c4d2392b862745be06ab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WHAFJHUQECBI6GRM3PA3MCZEZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CAL: A Language for Aggregating Functional and Extrafunctional Constraints in Streaming Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Alex Shafarenko, Raimund Kirner","submitted_at":"2011-01-17T23:51:59Z","abstract_excerpt":"In this article we present the {\\em Constraint Aggregation Language} (CAL), a declarative language for describing properties of stateless program components that interact by exchanging messages. CAL allows one to describe functional as well as extra-functional behaviours, such as computation latency. The CAL language intention is to be able to describe the behaviour of so-called boxes in the context of S-Net. However, the language would find application in other coordination models based on stateless components."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3356","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"},"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:31:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8913KERjskpUYPWS27DAEbZyIwAuQJRPSdqjJ3g8+UQFbCANz/ZqdnRNoFLasHVdDPJJBv9ShSlPFR9pRkpHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:10:09.431967Z"},"content_sha256":"8f9a33fc4ff5321a4040b36845109d5b90dc783cfb79a3eae237f00cd9616ce9","schema_version":"1.0","event_id":"sha256:8f9a33fc4ff5321a4040b36845109d5b90dc783cfb79a3eae237f00cd9616ce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/bundle.json","state_url":"https://pith.science/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/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-27T18:10:09Z","links":{"resolver":"https://pith.science/pith/WHAFJHUQECBI6GRM3PA3MCZEZP","bundle":"https://pith.science/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/bundle.json","state":"https://pith.science/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHAFJHUQECBI6GRM3PA3MCZEZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WHAFJHUQECBI6GRM3PA3MCZEZP","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":"72ada640fb18d7688fc52e2a9e79b638b8fd1fad451bb970fd710e747aa5b6de","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-01-17T23:51:59Z","title_canon_sha256":"21ced891e1085c4698fb09e4811ab02905d3db57425346125e66e19d0226bb88"},"schema_version":"1.0","source":{"id":"1101.3356","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3356","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3356v2","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3356","created_at":"2026-05-18T04:31:21Z"},{"alias_kind":"pith_short_12","alias_value":"WHAFJHUQECBI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WHAFJHUQECBI6GRM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WHAFJHUQ","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:8f9a33fc4ff5321a4040b36845109d5b90dc783cfb79a3eae237f00cd9616ce9","target":"graph","created_at":"2026-05-18T04:31:21Z","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 this article we present the {\\em Constraint Aggregation Language} (CAL), a declarative language for describing properties of stateless program components that interact by exchanging messages. CAL allows one to describe functional as well as extra-functional behaviours, such as computation latency. The CAL language intention is to be able to describe the behaviour of so-called boxes in the context of S-Net. However, the language would find application in other coordination models based on stateless components.","authors_text":"Alex Shafarenko, Raimund Kirner","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-01-17T23:51:59Z","title":"CAL: A Language for Aggregating Functional and Extrafunctional Constraints in Streaming Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3356","kind":"arxiv","version":2},"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:2a7ab4645278ae107c47f13b34041961023baff4001c4d2392b862745be06ab4","target":"record","created_at":"2026-05-18T04:31:21Z","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":"72ada640fb18d7688fc52e2a9e79b638b8fd1fad451bb970fd710e747aa5b6de","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-01-17T23:51:59Z","title_canon_sha256":"21ced891e1085c4698fb09e4811ab02905d3db57425346125e66e19d0226bb88"},"schema_version":"1.0","source":{"id":"1101.3356","kind":"arxiv","version":2}},"canonical_sha256":"b1c0549e9020828f1a2cdbc1b60b24cbc064727236c0a271ab70fb4446f38a57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1c0549e9020828f1a2cdbc1b60b24cbc064727236c0a271ab70fb4446f38a57","first_computed_at":"2026-05-18T04:31:21.977677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:21.977677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NqeaB33FadRT/gpBUz1XdLdMkgElvGhV1BkLihgzdTooLLMdstdWYZ462EqalbBwTgyAV4J7F7Tgprp6hidTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:21.978158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3356","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a7ab4645278ae107c47f13b34041961023baff4001c4d2392b862745be06ab4","sha256:8f9a33fc4ff5321a4040b36845109d5b90dc783cfb79a3eae237f00cd9616ce9"],"state_sha256":"3b5b09f53cc5b127c054292f8c8955aedc5ef967710e820b0ea1b680a14b774f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxKza4BziYVzSDkb4MSGuUZvYj9WarOSz7Y5Y3928ZOgIqBpCJw2yx2UzgfVeOSCYGFWargcSC5vjLzqjsHPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:10:09.433828Z","bundle_sha256":"c699b4ac624667416969ab72ca8900b77552b1f6fe825026503ea1d6a5c6986d"}}