{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OEPJFZGHTYZBFMYSXHJIX35ZLP","short_pith_number":"pith:OEPJFZGH","schema_version":"1.0","canonical_sha256":"711e92e4c79e3212b312b9d28befb95bd585183be349aa7c87497f9b4de56384","source":{"kind":"arxiv","id":"1709.00829","version":1},"attestation_state":"computed","paper":{"title":"Using Session Types for Reasoning About Boundedness in the Pi-Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aalborg University, Denmark), Hans H\\\"uttel (Department of Computer Science","submitted_at":"2017-09-04T06:28:53Z","abstract_excerpt":"The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable. P is depth-bounded at level k if every reduction sequence for P contains successor processes with at most k active nested restrictions. P is name-bounded at level k if every reduction sequence for P contains successor processes with at most k active bound names. Membership of these classes of processes is undecidable. In this paper we use binary session types to decise two type systems that give a sound cha"},"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":"1709.00829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-04T06:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"512510a5a5cb00fc8ea3826753f5fcdc50c672e90d587997145b92df9c605ed4","abstract_canon_sha256":"944ad7cfa2ae04ea23d2f35359d7bcc4101e4665ee0922b56f46b2e9e89ba21b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.989938Z","signature_b64":"cah+ubIIT4+ErshpMVgpUaymhXGhIlYjZwdNZT7aFBexg3C6Z40cud7xtgmG9WgypkRk/iQTHiUYh92gA48CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"711e92e4c79e3212b312b9d28befb95bd585183be349aa7c87497f9b4de56384","last_reissued_at":"2026-05-18T00:36:04.989270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.989270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Session Types for Reasoning About Boundedness in the Pi-Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aalborg University, Denmark), Hans H\\\"uttel (Department of Computer Science","submitted_at":"2017-09-04T06:28:53Z","abstract_excerpt":"The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable. P is depth-bounded at level k if every reduction sequence for P contains successor processes with at most k active nested restrictions. P is name-bounded at level k if every reduction sequence for P contains successor processes with at most k active bound names. Membership of these classes of processes is undecidable. In this paper we use binary session types to decise two type systems that give a sound cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00829","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.00829","created_at":"2026-05-18T00:36:04.989395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00829v1","created_at":"2026-05-18T00:36:04.989395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00829","created_at":"2026-05-18T00:36:04.989395+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEPJFZGHTYZB","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEPJFZGHTYZBFMYS","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEPJFZGH","created_at":"2026-05-18T12:31:34.259226+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/OEPJFZGHTYZBFMYSXHJIX35ZLP","json":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP.json","graph_json":"https://pith.science/api/pith-number/OEPJFZGHTYZBFMYSXHJIX35ZLP/graph.json","events_json":"https://pith.science/api/pith-number/OEPJFZGHTYZBFMYSXHJIX35ZLP/events.json","paper":"https://pith.science/paper/OEPJFZGH"},"agent_actions":{"view_html":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP","download_json":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP.json","view_paper":"https://pith.science/paper/OEPJFZGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00829&json=true","fetch_graph":"https://pith.science/api/pith-number/OEPJFZGHTYZBFMYSXHJIX35ZLP/graph.json","fetch_events":"https://pith.science/api/pith-number/OEPJFZGHTYZBFMYSXHJIX35ZLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP/action/storage_attestation","attest_author":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP/action/author_attestation","sign_citation":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP/action/citation_signature","submit_replication":"https://pith.science/pith/OEPJFZGHTYZBFMYSXHJIX35ZLP/action/replication_record"}},"created_at":"2026-05-18T00:36:04.989395+00:00","updated_at":"2026-05-18T00:36:04.989395+00:00"}