{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AV3CBABAGFHRXWF66QAQZGPA33","short_pith_number":"pith:AV3CBABA","canonical_record":{"source":{"id":"1502.00944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-03T18:02:32Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d80ab191f1596454c6aef47efefbaae4f141c75516f119ee04bf9ad63dae59b2","abstract_canon_sha256":"8584190e36e48edcdc4918034a55581dc476862bbca62c80979e4d9a1b186b11"},"schema_version":"1.0"},"canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","source":{"kind":"arxiv","id":"1502.00944","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00944","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00944v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00944","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"AV3CBABAGFHR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AV3CBABAGFHRXWF6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AV3CBABA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AV3CBABAGFHRXWF66QAQZGPA33","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-03T18:02:32Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d80ab191f1596454c6aef47efefbaae4f141c75516f119ee04bf9ad63dae59b2","abstract_canon_sha256":"8584190e36e48edcdc4918034a55581dc476862bbca62c80979e4d9a1b186b11"},"schema_version":"1.0"},"canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.359601Z","signature_b64":"l/MnZbXzlnjvdEMdTgdJ0womIjqnK2MEbvz+ta5pDdVNtco71xb7wUvn28h/H5nAIPkOoHxdCcW//BI6VTk3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","last_reissued_at":"2026-05-18T02:26:38.359215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.359215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00944","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6BilHLvH9TAz9IKdLJbqapWk0ZSG5LsgaZXMREkovtA+9WcPBcYg1wi92tNYhkJsTZvmd27jLAXfyIP3kABCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:44:56.071064Z"},"content_sha256":"bf6a88180a97b8e1f84f606fc11ac06df15c2d791a242538e098b0d2ccb15509","schema_version":"1.0","event_id":"sha256:bf6a88180a97b8e1f84f606fc11ac06df15c2d791a242538e098b0d2ccb15509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AV3CBABAGFHRXWF66QAQZGPA33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Type System for proving Depth Boundedness in the pi-calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Emanuele D'Osualdo, Luke Ong","submitted_at":"2015-02-03T18:02:32Z","abstract_excerpt":"The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system, parameterised over a finite forest, that formalises name usage by pi-terms in a manner that respects the forest. Type checking is decidable and type inference is computable; furthermore typable pi-terms are guaranteed to be depth bounded.\n  The second contribution of the paper is a proof of equivalence between the semantics of typable terms and nested data class mem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00944","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaZ8pDO+q2694SpFTGKuUMkQvNH7uMI4nQZMGQd6gmFecUdGNKv1RBwo4Wl+s2ElOcjCvpKcVUKpl+dTllZ7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:44:56.071430Z"},"content_sha256":"c9bc908863917484007822140fb7ad1152316d386cf3f8879c9616cc44c404ad","schema_version":"1.0","event_id":"sha256:c9bc908863917484007822140fb7ad1152316d386cf3f8879c9616cc44c404ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/bundle.json","state_url":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AV3CBABAGFHRXWF66QAQZGPA33/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-12T08:44:56Z","links":{"resolver":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33","bundle":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/bundle.json","state":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AV3CBABAGFHRXWF66QAQZGPA33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AV3CBABAGFHRXWF66QAQZGPA33","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":"8584190e36e48edcdc4918034a55581dc476862bbca62c80979e4d9a1b186b11","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-03T18:02:32Z","title_canon_sha256":"d80ab191f1596454c6aef47efefbaae4f141c75516f119ee04bf9ad63dae59b2"},"schema_version":"1.0","source":{"id":"1502.00944","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00944","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00944v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00944","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"AV3CBABAGFHR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AV3CBABAGFHRXWF6","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AV3CBABA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c9bc908863917484007822140fb7ad1152316d386cf3f8879c9616cc44c404ad","target":"graph","created_at":"2026-05-18T02:26:38Z","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 depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system, parameterised over a finite forest, that formalises name usage by pi-terms in a manner that respects the forest. Type checking is decidable and type inference is computable; furthermore typable pi-terms are guaranteed to be depth bounded.\n  The second contribution of the paper is a proof of equivalence between the semantics of typable terms and nested data class mem","authors_text":"Emanuele D'Osualdo, Luke Ong","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-03T18:02:32Z","title":"A Type System for proving Depth Boundedness in the pi-calculus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00944","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:bf6a88180a97b8e1f84f606fc11ac06df15c2d791a242538e098b0d2ccb15509","target":"record","created_at":"2026-05-18T02:26:38Z","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":"8584190e36e48edcdc4918034a55581dc476862bbca62c80979e4d9a1b186b11","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-03T18:02:32Z","title_canon_sha256":"d80ab191f1596454c6aef47efefbaae4f141c75516f119ee04bf9ad63dae59b2"},"schema_version":"1.0","source":{"id":"1502.00944","kind":"arxiv","version":2}},"canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","first_computed_at":"2026-05-18T02:26:38.359215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.359215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/MnZbXzlnjvdEMdTgdJ0womIjqnK2MEbvz+ta5pDdVNtco71xb7wUvn28h/H5nAIPkOoHxdCcW//BI6VTk3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.359601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00944","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf6a88180a97b8e1f84f606fc11ac06df15c2d791a242538e098b0d2ccb15509","sha256:c9bc908863917484007822140fb7ad1152316d386cf3f8879c9616cc44c404ad"],"state_sha256":"e47f246dfe3f07170b21ca80716a54b1f066b1f035140b684bb71d6136e7c468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73jZIb4meBG4MJXI9OLC1SscoWLYFD2u7OZKWYl4I6UXeWnepAt8vSPnTkH6fxN8tS5gUu7n7b89Uqyui6TWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:44:56.073862Z","bundle_sha256":"2b64f2a4fc2fdcab4fa3ac13ba71f9a9ebfb3e864dd487c93844504318e06cf9"}}