{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OG66TOZ4J3333THC347JDH6STE","short_pith_number":"pith:OG66TOZ4","schema_version":"1.0","canonical_sha256":"71bde9bb3c4ef7bdcce2df3e919fd299327c718e9ce9ef03bd93b8b27b5f9458","source":{"kind":"arxiv","id":"2411.08847","version":2},"attestation_state":"computed","paper":{"title":"Proofs as Execution Trees for the {\\pi}-Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Giulia Manara, Matteo Acclavio","submitted_at":"2024-11-13T18:29:11Z","abstract_excerpt":"In this paper, we establish the foundations of a novel logical framework for the {\\pi}-calculus, based on the deduction-as-computation paradigm. Following the standard proof-theoretic interpretation of logic programming, we represent processes as formulas, and we interpret proofs as computations.\n  For this purpose, we define a cut-free sequent calculus for an extension of first-order multiplicative and additive linear logic. This extension includes a non-commutative and non-associative connective to faithfully model the prefix operator, and nominal quantifiers to represent name restriction. F"},"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":"2411.08847","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-13T18:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"f140d1649061e92194cd7808f9fc635b96cc4d160b9b553fbe0106fb28010085","abstract_canon_sha256":"358b235393785b5018752211df511825eb30f7bbad5fc71e53d903a956a2e89e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:37.851204Z","signature_b64":"hH+FgJt8nhS/VgdS7qNHlqb8kkNvo5IscULFNaAs1M2mVQLYA25dtD8B4C27qLwCbuwCmnn+E+gz4onWClEkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71bde9bb3c4ef7bdcce2df3e919fd299327c718e9ce9ef03bd93b8b27b5f9458","last_reissued_at":"2026-07-05T10:01:37.850792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:37.850792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proofs as Execution Trees for the {\\pi}-Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Giulia Manara, Matteo Acclavio","submitted_at":"2024-11-13T18:29:11Z","abstract_excerpt":"In this paper, we establish the foundations of a novel logical framework for the {\\pi}-calculus, based on the deduction-as-computation paradigm. Following the standard proof-theoretic interpretation of logic programming, we represent processes as formulas, and we interpret proofs as computations.\n  For this purpose, we define a cut-free sequent calculus for an extension of first-order multiplicative and additive linear logic. This extension includes a non-commutative and non-associative connective to faithfully model the prefix operator, and nominal quantifiers to represent name restriction. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08847","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.08847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.08847","created_at":"2026-07-05T10:01:37.850850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08847v2","created_at":"2026-07-05T10:01:37.850850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08847","created_at":"2026-07-05T10:01:37.850850+00:00"},{"alias_kind":"pith_short_12","alias_value":"OG66TOZ4J333","created_at":"2026-07-05T10:01:37.850850+00:00"},{"alias_kind":"pith_short_16","alias_value":"OG66TOZ4J3333THC","created_at":"2026-07-05T10:01:37.850850+00:00"},{"alias_kind":"pith_short_8","alias_value":"OG66TOZ4","created_at":"2026-07-05T10:01:37.850850+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/OG66TOZ4J3333THC347JDH6STE","json":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE.json","graph_json":"https://pith.science/api/pith-number/OG66TOZ4J3333THC347JDH6STE/graph.json","events_json":"https://pith.science/api/pith-number/OG66TOZ4J3333THC347JDH6STE/events.json","paper":"https://pith.science/paper/OG66TOZ4"},"agent_actions":{"view_html":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE","download_json":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE.json","view_paper":"https://pith.science/paper/OG66TOZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08847&json=true","fetch_graph":"https://pith.science/api/pith-number/OG66TOZ4J3333THC347JDH6STE/graph.json","fetch_events":"https://pith.science/api/pith-number/OG66TOZ4J3333THC347JDH6STE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE/action/storage_attestation","attest_author":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE/action/author_attestation","sign_citation":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE/action/citation_signature","submit_replication":"https://pith.science/pith/OG66TOZ4J3333THC347JDH6STE/action/replication_record"}},"created_at":"2026-07-05T10:01:37.850850+00:00","updated_at":"2026-07-05T10:01:37.850850+00:00"}