{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ML34WDD3L3ZSTSAIK72RITWSJU","short_pith_number":"pith:ML34WDD3","canonical_record":{"source":{"id":"1511.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-16T19:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"c7c2ef22820cad289158117d33914839d6dd4e3ccd249051460a3d6bf17af8a1","abstract_canon_sha256":"7cf026caa9a71327fc9a131c0962f168c47b1d8d5cb53cc31a30a29ab631edae"},"schema_version":"1.0"},"canonical_sha256":"62f7cb0c7b5ef329c80857f5144ed24d1418a3057e8bfa54dc968d06b48239b5","source":{"kind":"arxiv","id":"1511.05104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05104","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05104v1","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05104","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"ML34WDD3L3ZS","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"ML34WDD3L3ZSTSAI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"ML34WDD3","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ML34WDD3L3ZSTSAIK72RITWSJU","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-16T19:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"c7c2ef22820cad289158117d33914839d6dd4e3ccd249051460a3d6bf17af8a1","abstract_canon_sha256":"7cf026caa9a71327fc9a131c0962f168c47b1d8d5cb53cc31a30a29ab631edae"},"schema_version":"1.0"},"canonical_sha256":"62f7cb0c7b5ef329c80857f5144ed24d1418a3057e8bfa54dc968d06b48239b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:50.851853Z","signature_b64":"p5aKIg6AUOyqa72HQSfooqJyd7XaCzsTO7RkboTudI57Ri4KMJh03Ii2pUj7OdtekTaeeH86M48af4WtpCx+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62f7cb0c7b5ef329c80857f5144ed24d1418a3057e8bfa54dc968d06b48239b5","last_reissued_at":"2026-05-18T01:26:50.851053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:50.851053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05104","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:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5J/QAAhbAHSGN23GqIHpJwqQ2hcjYPpbfGmZX4Zb0fInFz7DaHZvyquOUdgZvfCr4IirPEvbum1No5qgETI2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:51.855204Z"},"content_sha256":"ca120ea0e814b493fc31e9600ddb232b28f8858a6f29ececbe42921b95594268","schema_version":"1.0","event_id":"sha256:ca120ea0e814b493fc31e9600ddb232b28f8858a6f29ececbe42921b95594268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ML34WDD3L3ZSTSAIK72RITWSJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time complexity of concurrent programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Cosimo Laneve (DISI, Einar Broch Johnsen, Elena Giachino (DISI, FOCUS), Ka I Pun","submitted_at":"2015-11-16T19:48:48Z","abstract_excerpt":"We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost of statements, creations of objects, and concurrent operations), called behavioural types. Then, we define a translation function that takes behavioural types and makes the parallelism explicit into so-called cost equations, which are fed to an automatic off-the-shelf solver for obtaining the time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05104","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:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BBzqsMYIQJDKq7j0uhjSem4LbsPYclCeF7kKhoAcSLDXn+MxNaNq3WP+mCoYWG9/2DPVWNjfp3ZXi66EEaTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:51.855571Z"},"content_sha256":"f9d21c6816413815f070185df1a4c15ce8a8487c9ba29abc24149ada40cf463d","schema_version":"1.0","event_id":"sha256:f9d21c6816413815f070185df1a4c15ce8a8487c9ba29abc24149ada40cf463d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ML34WDD3L3ZSTSAIK72RITWSJU/bundle.json","state_url":"https://pith.science/pith/ML34WDD3L3ZSTSAIK72RITWSJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ML34WDD3L3ZSTSAIK72RITWSJU/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-30T12:05:51Z","links":{"resolver":"https://pith.science/pith/ML34WDD3L3ZSTSAIK72RITWSJU","bundle":"https://pith.science/pith/ML34WDD3L3ZSTSAIK72RITWSJU/bundle.json","state":"https://pith.science/pith/ML34WDD3L3ZSTSAIK72RITWSJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ML34WDD3L3ZSTSAIK72RITWSJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ML34WDD3L3ZSTSAIK72RITWSJU","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":"7cf026caa9a71327fc9a131c0962f168c47b1d8d5cb53cc31a30a29ab631edae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-16T19:48:48Z","title_canon_sha256":"c7c2ef22820cad289158117d33914839d6dd4e3ccd249051460a3d6bf17af8a1"},"schema_version":"1.0","source":{"id":"1511.05104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05104","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05104v1","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05104","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"ML34WDD3L3ZS","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"ML34WDD3L3ZSTSAI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"ML34WDD3","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:f9d21c6816413815f070185df1a4c15ce8a8487c9ba29abc24149ada40cf463d","target":"graph","created_at":"2026-05-18T01:26:50Z","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":"We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost of statements, creations of objects, and concurrent operations), called behavioural types. Then, we define a translation function that takes behavioural types and makes the parallelism explicit into so-called cost equations, which are fed to an automatic off-the-shelf solver for obtaining the time complexity.","authors_text":"Cosimo Laneve (DISI, Einar Broch Johnsen, Elena Giachino (DISI, FOCUS), Ka I Pun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-16T19:48:48Z","title":"Time complexity of concurrent programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05104","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:ca120ea0e814b493fc31e9600ddb232b28f8858a6f29ececbe42921b95594268","target":"record","created_at":"2026-05-18T01:26:50Z","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":"7cf026caa9a71327fc9a131c0962f168c47b1d8d5cb53cc31a30a29ab631edae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-16T19:48:48Z","title_canon_sha256":"c7c2ef22820cad289158117d33914839d6dd4e3ccd249051460a3d6bf17af8a1"},"schema_version":"1.0","source":{"id":"1511.05104","kind":"arxiv","version":1}},"canonical_sha256":"62f7cb0c7b5ef329c80857f5144ed24d1418a3057e8bfa54dc968d06b48239b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62f7cb0c7b5ef329c80857f5144ed24d1418a3057e8bfa54dc968d06b48239b5","first_computed_at":"2026-05-18T01:26:50.851053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:50.851053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p5aKIg6AUOyqa72HQSfooqJyd7XaCzsTO7RkboTudI57Ri4KMJh03Ii2pUj7OdtekTaeeH86M48af4WtpCx+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:50.851853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca120ea0e814b493fc31e9600ddb232b28f8858a6f29ececbe42921b95594268","sha256:f9d21c6816413815f070185df1a4c15ce8a8487c9ba29abc24149ada40cf463d"],"state_sha256":"23ff50235a38fb9a647042b495e46383ff9921f79cf6fa09ffc2824950e2e06a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsiWalLPr41xunMMtS1jS6AMJh99au/tnilNeaEV1TTcMGig6NkXafpogKBlM2MQ3qRh/Do/yBcS0UAN3Q8uBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:51.857489Z","bundle_sha256":"209a38ed587ce748807011fc92f0da77b33ca5504f83e5f43843fd825d7f0301"}}