{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3VJRCOXMLXCZALEZVCWSL636MF","short_pith_number":"pith:3VJRCOXM","canonical_record":{"source":{"id":"1209.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-04T14:59:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"988aa948d4ff3875c17b73fe83f4e091f284b7f968c281385bc0f3ba0f68b2b3","abstract_canon_sha256":"2edcf011e5fdd66a2e9e2b9b677e2fc35f3623197ea941b62047016201236b3e"},"schema_version":"1.0"},"canonical_sha256":"dd53113aec5dc5902c99a8ad25fb7e615db4f9d77503410323c0c5e6cb643b56","source":{"kind":"arxiv","id":"1209.0663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0663","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0663v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0663","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"3VJRCOXMLXCZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VJRCOXMLXCZALEZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VJRCOXM","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3VJRCOXMLXCZALEZVCWSL636MF","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-04T14:59:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"988aa948d4ff3875c17b73fe83f4e091f284b7f968c281385bc0f3ba0f68b2b3","abstract_canon_sha256":"2edcf011e5fdd66a2e9e2b9b677e2fc35f3623197ea941b62047016201236b3e"},"schema_version":"1.0"},"canonical_sha256":"dd53113aec5dc5902c99a8ad25fb7e615db4f9d77503410323c0c5e6cb643b56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.543881Z","signature_b64":"+HTcRBN3t2/qC+Nzvox5Oo1O6I8s4sFX9s19ExAH+P2fAw/P0sRNs28Hjip1ShM5u7SZKQVL1UsE9+z7Oe0jDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd53113aec5dc5902c99a8ad25fb7e615db4f9d77503410323c0c5e6cb643b56","last_reissued_at":"2026-05-18T03:46:17.543177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.543177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0663","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYXb6OT1OWeIe9niCUgBI9bMcexlGP74KWRvV8e2xnI01wpS2Wl4spUvejYq5FTIgIgsgj4bkNLIovSWFK3+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:05:00.201689Z"},"content_sha256":"51953e9fc050b6a4aab810e648997406fb889a6f1eb37b813e85242133dd2d61","schema_version":"1.0","event_id":"sha256:51953e9fc050b6a4aab810e648997406fb889a6f1eb37b813e85242133dd2d61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3VJRCOXMLXCZALEZVCWSL636MF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Interactive Behaviors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Damiano Mazza, Daniele Varacca, Tobias Heindel, Ugo Dal Lago","submitted_at":"2012-09-04T14:59:08Z","abstract_excerpt":"The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing the intrinsic difficulty of fully general interactive behaviors. To this extent, we use standard tools from concurrency theory, including labelled transition systems (formalizing behaviors) and their asynchronous extension (providing causality information). Behaviors are implemented by means of a multiprocessor machine executing CCS-like processes. The resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0663","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CepadBmfv7rH262EX/cQ6/+GmmNoeXVsYw++1oYc+vB5Ni0UvqKmkr2B8ZN1bUYLJYystAQreNknCQMMZsJcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:05:00.202036Z"},"content_sha256":"9223b299f6dd56aefaa46239554d91f0fe8ae8d1ac109f0e542cddefe7a22543","schema_version":"1.0","event_id":"sha256:9223b299f6dd56aefaa46239554d91f0fe8ae8d1ac109f0e542cddefe7a22543"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VJRCOXMLXCZALEZVCWSL636MF/bundle.json","state_url":"https://pith.science/pith/3VJRCOXMLXCZALEZVCWSL636MF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VJRCOXMLXCZALEZVCWSL636MF/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-20T14:05:00Z","links":{"resolver":"https://pith.science/pith/3VJRCOXMLXCZALEZVCWSL636MF","bundle":"https://pith.science/pith/3VJRCOXMLXCZALEZVCWSL636MF/bundle.json","state":"https://pith.science/pith/3VJRCOXMLXCZALEZVCWSL636MF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VJRCOXMLXCZALEZVCWSL636MF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3VJRCOXMLXCZALEZVCWSL636MF","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":"2edcf011e5fdd66a2e9e2b9b677e2fc35f3623197ea941b62047016201236b3e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-04T14:59:08Z","title_canon_sha256":"988aa948d4ff3875c17b73fe83f4e091f284b7f968c281385bc0f3ba0f68b2b3"},"schema_version":"1.0","source":{"id":"1209.0663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0663","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0663v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0663","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"3VJRCOXMLXCZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VJRCOXMLXCZALEZ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VJRCOXM","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:9223b299f6dd56aefaa46239554d91f0fe8ae8d1ac109f0e542cddefe7a22543","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing the intrinsic difficulty of fully general interactive behaviors. To this extent, we use standard tools from concurrency theory, including labelled transition systems (formalizing behaviors) and their asynchronous extension (providing causality information). Behaviors are implemented by means of a multiprocessor machine executing CCS-like processes. The resul","authors_text":"Damiano Mazza, Daniele Varacca, Tobias Heindel, Ugo Dal Lago","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-04T14:59:08Z","title":"Computational Complexity of Interactive Behaviors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0663","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:51953e9fc050b6a4aab810e648997406fb889a6f1eb37b813e85242133dd2d61","target":"record","created_at":"2026-05-18T03:46:17Z","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":"2edcf011e5fdd66a2e9e2b9b677e2fc35f3623197ea941b62047016201236b3e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-04T14:59:08Z","title_canon_sha256":"988aa948d4ff3875c17b73fe83f4e091f284b7f968c281385bc0f3ba0f68b2b3"},"schema_version":"1.0","source":{"id":"1209.0663","kind":"arxiv","version":1}},"canonical_sha256":"dd53113aec5dc5902c99a8ad25fb7e615db4f9d77503410323c0c5e6cb643b56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd53113aec5dc5902c99a8ad25fb7e615db4f9d77503410323c0c5e6cb643b56","first_computed_at":"2026-05-18T03:46:17.543177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.543177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+HTcRBN3t2/qC+Nzvox5Oo1O6I8s4sFX9s19ExAH+P2fAw/P0sRNs28Hjip1ShM5u7SZKQVL1UsE9+z7Oe0jDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.543881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51953e9fc050b6a4aab810e648997406fb889a6f1eb37b813e85242133dd2d61","sha256:9223b299f6dd56aefaa46239554d91f0fe8ae8d1ac109f0e542cddefe7a22543"],"state_sha256":"34f5760e5c8ca6de40cec39f1cc0734328bb1a6018670f9baff3d00dd09f2139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3IIww6DUSjlAVGcu5AmAolZXMuRVaX3VF4NOaRUb8YPzkrKTlskWmnr+yGZi6Khj+RmDYbdl/Q5n0io9pLENBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:05:00.203988Z","bundle_sha256":"9966b6adef74d9739f88e848fadf3b30704c2614365eb752925c6fe200e81da0"}}