{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AV3CBABAGFHRXWF66QAQZGPA33","short_pith_number":"pith:AV3CBABA","schema_version":"1.0","canonical_sha256":"0576208020314f1bd8bef4010c99e0decfb12f2dbdaf6d420954e932da1e969a","source":{"kind":"arxiv","id":"1502.00944","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00944","created_at":"2026-05-18T02:26:38.359271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00944v2","created_at":"2026-05-18T02:26:38.359271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00944","created_at":"2026-05-18T02:26:38.359271+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV3CBABAGFHR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV3CBABAGFHRXWF6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV3CBABA","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33","json":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33.json","graph_json":"https://pith.science/api/pith-number/AV3CBABAGFHRXWF66QAQZGPA33/graph.json","events_json":"https://pith.science/api/pith-number/AV3CBABAGFHRXWF66QAQZGPA33/events.json","paper":"https://pith.science/paper/AV3CBABA"},"agent_actions":{"view_html":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33","download_json":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33.json","view_paper":"https://pith.science/paper/AV3CBABA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00944&json=true","fetch_graph":"https://pith.science/api/pith-number/AV3CBABAGFHRXWF66QAQZGPA33/graph.json","fetch_events":"https://pith.science/api/pith-number/AV3CBABAGFHRXWF66QAQZGPA33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/action/storage_attestation","attest_author":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/action/author_attestation","sign_citation":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/action/citation_signature","submit_replication":"https://pith.science/pith/AV3CBABAGFHRXWF66QAQZGPA33/action/replication_record"}},"created_at":"2026-05-18T02:26:38.359271+00:00","updated_at":"2026-05-18T02:26:38.359271+00:00"}