{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B7ZBBQPJB6LVIRHL7V4XSORZVC","short_pith_number":"pith:B7ZBBQPJ","canonical_record":{"source":{"id":"1405.6100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-23T15:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"39b70061a9934b19f800c48b99b3e2daffaffdf11caf3a5c722f9a9911b55820","abstract_canon_sha256":"539af51db812cb9a424dc69843d305f353e437b1fb06fcf649d36fbdded1e3fa"},"schema_version":"1.0"},"canonical_sha256":"0ff210c1e90f975444ebfd79793a39a8bfa060de4805fb609af0ab150acc8dff","source":{"kind":"arxiv","id":"1405.6100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6100","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6100v2","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6100","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"B7ZBBQPJB6LV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B7ZBBQPJB6LVIRHL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B7ZBBQPJ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B7ZBBQPJB6LVIRHL7V4XSORZVC","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-23T15:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"39b70061a9934b19f800c48b99b3e2daffaffdf11caf3a5c722f9a9911b55820","abstract_canon_sha256":"539af51db812cb9a424dc69843d305f353e437b1fb06fcf649d36fbdded1e3fa"},"schema_version":"1.0"},"canonical_sha256":"0ff210c1e90f975444ebfd79793a39a8bfa060de4805fb609af0ab150acc8dff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.797286Z","signature_b64":"GhJXp9/rZQeCroF6RS04yDvgAmeo9BKneT9dTKJsLbcBV8QwHqhBSDz3B3ISGLl4uqIIaYceJ75dRnkGXSh3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff210c1e90f975444ebfd79793a39a8bfa060de4805fb609af0ab150acc8dff","last_reissued_at":"2026-05-18T01:37:35.796833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.796833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6100","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-18T01:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1v3kxuP0AzagxWVNjgbdd9Y+kfMwrOYt5/8sKhO2w1qN6yaibU7Ea63GjNicxqeHB0l1iiTleqU20p3ll5SEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:09:15.625773Z"},"content_sha256":"5ec3cdaed6190aeb7b6a26ee4fe5b3e7099cd7c9af337024e6b875a3f16a9c36","schema_version":"1.0","event_id":"sha256:5ec3cdaed6190aeb7b6a26ee4fe5b3e7099cd7c9af337024e6b875a3f16a9c36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B7ZBBQPJB6LVIRHL7V4XSORZVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adrian Francalanza (University of Malta), Edsko DeVries (Well-Typed LLP), Ireland), Matthew Hennessy (Trinity College Dublin","submitted_at":"2014-05-23T15:38:17Z","abstract_excerpt":"We define a pi-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof techniques for comparing behaviour and resource usage efficiency of concurrent processes. We establish full abstraction results between our coinductive definitions and a contextual behavioural preorder describing a notion of process efficiency w.r.t. its management of resources. We also justify these defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6100","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-18T01:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caLVzE5Gvsh0wycjBxDbOYBWye62M8q5BHlZDZfpcI3UokIGmR0JD6GhzGXRmQaTr5riADWXsTYIW8w9febDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:09:15.626129Z"},"content_sha256":"3c2f7c3d077cf136f27097a5126f4c63803b2e9a88053fd862cb86e55befc896","schema_version":"1.0","event_id":"sha256:3c2f7c3d077cf136f27097a5126f4c63803b2e9a88053fd862cb86e55befc896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/bundle.json","state_url":"https://pith.science/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/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-29T14:09:15Z","links":{"resolver":"https://pith.science/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC","bundle":"https://pith.science/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/bundle.json","state":"https://pith.science/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7ZBBQPJB6LVIRHL7V4XSORZVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B7ZBBQPJB6LVIRHL7V4XSORZVC","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":"539af51db812cb9a424dc69843d305f353e437b1fb06fcf649d36fbdded1e3fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-23T15:38:17Z","title_canon_sha256":"39b70061a9934b19f800c48b99b3e2daffaffdf11caf3a5c722f9a9911b55820"},"schema_version":"1.0","source":{"id":"1405.6100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6100","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6100v2","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6100","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"B7ZBBQPJB6LV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B7ZBBQPJB6LVIRHL","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B7ZBBQPJ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:3c2f7c3d077cf136f27097a5126f4c63803b2e9a88053fd862cb86e55befc896","target":"graph","created_at":"2026-05-18T01:37: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":"We define a pi-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof techniques for comparing behaviour and resource usage efficiency of concurrent processes. We establish full abstraction results between our coinductive definitions and a contextual behavioural preorder describing a notion of process efficiency w.r.t. its management of resources. We also justify these defi","authors_text":"Adrian Francalanza (University of Malta), Edsko DeVries (Well-Typed LLP), Ireland), Matthew Hennessy (Trinity College Dublin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-23T15:38:17Z","title":"Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6100","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:5ec3cdaed6190aeb7b6a26ee4fe5b3e7099cd7c9af337024e6b875a3f16a9c36","target":"record","created_at":"2026-05-18T01:37: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":"539af51db812cb9a424dc69843d305f353e437b1fb06fcf649d36fbdded1e3fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-23T15:38:17Z","title_canon_sha256":"39b70061a9934b19f800c48b99b3e2daffaffdf11caf3a5c722f9a9911b55820"},"schema_version":"1.0","source":{"id":"1405.6100","kind":"arxiv","version":2}},"canonical_sha256":"0ff210c1e90f975444ebfd79793a39a8bfa060de4805fb609af0ab150acc8dff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ff210c1e90f975444ebfd79793a39a8bfa060de4805fb609af0ab150acc8dff","first_computed_at":"2026-05-18T01:37:35.796833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:35.796833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GhJXp9/rZQeCroF6RS04yDvgAmeo9BKneT9dTKJsLbcBV8QwHqhBSDz3B3ISGLl4uqIIaYceJ75dRnkGXSh3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:35.797286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec3cdaed6190aeb7b6a26ee4fe5b3e7099cd7c9af337024e6b875a3f16a9c36","sha256:3c2f7c3d077cf136f27097a5126f4c63803b2e9a88053fd862cb86e55befc896"],"state_sha256":"f57a15d60bf0d0d81cd6c176ee8835564c12ea332c255f32074667d94c3b7db3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAJny+v1ZvXBMZuUCkufcudJ+LmmdtmSXxK2n0SwA6Bt4b9/d5ufIsfhF1Ucu8Ujk6Rxtta/Tn2FhsPi9Cm5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:09:15.627960Z","bundle_sha256":"db42b3eb56340e9e5cf980b2167998a754a4d7d36451acaadd4d3f7182446d18"}}