{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N5BOMZG6ZWW3Q5PODCAX2S34XD","short_pith_number":"pith:N5BOMZG6","canonical_record":{"source":{"id":"1510.02834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-09T21:53:12Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"535775b91ee8da7f52124222dc5c993253e67473f62a2b85705f2a3e2c8f95fb","abstract_canon_sha256":"4b1f047792a0b0619e19b082141686634d61dcd6495cec7c0b3908508cb958ac"},"schema_version":"1.0"},"canonical_sha256":"6f42e664decdadb875ee18817d4b7cb8c54c530ca2fc0bb5b558e0d6b186b54d","source":{"kind":"arxiv","id":"1510.02834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02834","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02834v1","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02834","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"N5BOMZG6ZWW3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5BOMZG6ZWW3Q5PO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5BOMZG6","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N5BOMZG6ZWW3Q5PODCAX2S34XD","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-09T21:53:12Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"535775b91ee8da7f52124222dc5c993253e67473f62a2b85705f2a3e2c8f95fb","abstract_canon_sha256":"4b1f047792a0b0619e19b082141686634d61dcd6495cec7c0b3908508cb958ac"},"schema_version":"1.0"},"canonical_sha256":"6f42e664decdadb875ee18817d4b7cb8c54c530ca2fc0bb5b558e0d6b186b54d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.658378Z","signature_b64":"5hQ8PdLY7XJ0h4ypU91kRkxveuLQJ3R8R8n0lj4CoGzekEWqjuMsVWMwGHoxkn9xnZ16L2g83KcWCbSrBIZOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f42e664decdadb875ee18817d4b7cb8c54c530ca2fc0bb5b558e0d6b186b54d","last_reissued_at":"2026-05-18T01:30:33.657838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.657838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02834","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45+mq8VlNU9B/hRvQHjpHSHuUOWPjU9FfIE7otYNwChfR7NIsa2dnCrJkiMPhyV1uTL2dHM7bFXKOpg65XTCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:37:49.357241Z"},"content_sha256":"460988e99f10db3e58521381ce4394cef0dd1b82fc17bc555347aa8581ce3899","schema_version":"1.0","event_id":"sha256:460988e99f10db3e58521381ce4394cef0dd1b82fc17bc555347aa8581ce3899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N5BOMZG6ZWW3Q5PODCAX2S34XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NTCCRT: A concurrent constraint framework for real-time interaction (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.LO","authors_text":"Camilo Rueda, Carlos Ag\\'on, G\\'erard Assayag, Mauricio Toro","submitted_at":"2015-10-09T21:53:12Z","abstract_excerpt":"Writing multimedia interaction systems is not easy. Their concurrent processes usually access shared resources in a non-deterministic order, often leading to unpredictable behavior. Using Pure Data (Pd) and Max/MSP is possible to program concurrency, however, it is difficult to synchronize processes based on multiple criteria. Process calculi such as the Non-deterministic Timed Concurrent Constraint (ntcc) calculus, overcome that problem by representing multiple criteria as constraints. We propose using our framework Ntccrt to manage concurrency in Pd and Max. Ntccrt is a real-time capable int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02834","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-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYxNAmjQkp02ARfUYCyNzt72ySbckpP+j+D1y+oCrMZV1xx/w0H+qkTogs7LbShbK5HYgV7q57nL+7jthd5sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:37:49.357808Z"},"content_sha256":"0df93e918c429128dd70831e670a8525583321fc53979120a690a94b30a10f79","schema_version":"1.0","event_id":"sha256:0df93e918c429128dd70831e670a8525583321fc53979120a690a94b30a10f79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/bundle.json","state_url":"https://pith.science/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/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-30T16:37:49Z","links":{"resolver":"https://pith.science/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD","bundle":"https://pith.science/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/bundle.json","state":"https://pith.science/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5BOMZG6ZWW3Q5PODCAX2S34XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N5BOMZG6ZWW3Q5PODCAX2S34XD","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":"4b1f047792a0b0619e19b082141686634d61dcd6495cec7c0b3908508cb958ac","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-09T21:53:12Z","title_canon_sha256":"535775b91ee8da7f52124222dc5c993253e67473f62a2b85705f2a3e2c8f95fb"},"schema_version":"1.0","source":{"id":"1510.02834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02834","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02834v1","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02834","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"N5BOMZG6ZWW3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N5BOMZG6ZWW3Q5PO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N5BOMZG6","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:0df93e918c429128dd70831e670a8525583321fc53979120a690a94b30a10f79","target":"graph","created_at":"2026-05-18T01:30:33Z","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":"Writing multimedia interaction systems is not easy. Their concurrent processes usually access shared resources in a non-deterministic order, often leading to unpredictable behavior. Using Pure Data (Pd) and Max/MSP is possible to program concurrency, however, it is difficult to synchronize processes based on multiple criteria. Process calculi such as the Non-deterministic Timed Concurrent Constraint (ntcc) calculus, overcome that problem by representing multiple criteria as constraints. We propose using our framework Ntccrt to manage concurrency in Pd and Max. Ntccrt is a real-time capable int","authors_text":"Camilo Rueda, Carlos Ag\\'on, G\\'erard Assayag, Mauricio Toro","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-09T21:53:12Z","title":"NTCCRT: A concurrent constraint framework for real-time interaction (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02834","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:460988e99f10db3e58521381ce4394cef0dd1b82fc17bc555347aa8581ce3899","target":"record","created_at":"2026-05-18T01:30:33Z","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":"4b1f047792a0b0619e19b082141686634d61dcd6495cec7c0b3908508cb958ac","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-09T21:53:12Z","title_canon_sha256":"535775b91ee8da7f52124222dc5c993253e67473f62a2b85705f2a3e2c8f95fb"},"schema_version":"1.0","source":{"id":"1510.02834","kind":"arxiv","version":1}},"canonical_sha256":"6f42e664decdadb875ee18817d4b7cb8c54c530ca2fc0bb5b558e0d6b186b54d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f42e664decdadb875ee18817d4b7cb8c54c530ca2fc0bb5b558e0d6b186b54d","first_computed_at":"2026-05-18T01:30:33.657838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:33.657838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hQ8PdLY7XJ0h4ypU91kRkxveuLQJ3R8R8n0lj4CoGzekEWqjuMsVWMwGHoxkn9xnZ16L2g83KcWCbSrBIZOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:33.658378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:460988e99f10db3e58521381ce4394cef0dd1b82fc17bc555347aa8581ce3899","sha256:0df93e918c429128dd70831e670a8525583321fc53979120a690a94b30a10f79"],"state_sha256":"0abc974c45cebe61054af7a02c617a2478e7379ffa51bb5425f699fa9472c108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHjBBc9IVl+NxNU+3DT8SgNGm5bDMJdD4/samPAG+3viMhtaZHb2hbj6R1YtvZID3RRM6rZwlviVPmDRNZDfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:37:49.360292Z","bundle_sha256":"4e25277e06417d9417b63a52ae3d2629055d1d7524528bc91a5bff85764b7913"}}