{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HP6KPYRNL6RM7S3AEL6HKMI7F5","short_pith_number":"pith:HP6KPYRN","schema_version":"1.0","canonical_sha256":"3bfca7e22d5fa2cfcb6022fc75311f2f4e1221febb48873c5d251616c1d69399","source":{"kind":"arxiv","id":"1803.00555","version":1},"attestation_state":"computed","paper":{"title":"Sequentialization for full N-Graphs via sub-N-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anjolina G. de Oliveira, Lais S. Andrade, Ruan V. B. Carvalho, Ruy J. G. B. de Queiroz","submitted_at":"2018-03-01T18:52:23Z","abstract_excerpt":"Since proof-nets for MLL- were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and Robinson (2003) proposed a straightforward generalization of this presentation for proof-nets from sequent calculus for classical logic. In 2014 it was presented an extension of these studies to obtain a proof of the sequentialization theorem for the fragment of N-Graphs with conjunction, disjunction and negation connectives, via the notion of sub-N-Graphs. N-G"},"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":"1803.00555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-01T18:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"ad451b6ca206cd6b724ba95d76090bc4c8747acf5e09299b9aff52dfc84051c8","abstract_canon_sha256":"8079e713aab27310f3180babd113d0d35e1fa4f295ac3b226ebfea5d62eefc9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.471238Z","signature_b64":"HcbGRkYPpWGQJrnv/k+p/cE6gt/QHgSfiRUGgn8vdgqfOYFNm7kySWJ0/CFP7KC1X6QnQvhX82dvH/v//qO1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bfca7e22d5fa2cfcb6022fc75311f2f4e1221febb48873c5d251616c1d69399","last_reissued_at":"2026-05-18T00:22:11.470846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.470846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequentialization for full N-Graphs via sub-N-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anjolina G. de Oliveira, Lais S. Andrade, Ruan V. B. Carvalho, Ruy J. G. B. de Queiroz","submitted_at":"2018-03-01T18:52:23Z","abstract_excerpt":"Since proof-nets for MLL- were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and Robinson (2003) proposed a straightforward generalization of this presentation for proof-nets from sequent calculus for classical logic. In 2014 it was presented an extension of these studies to obtain a proof of the sequentialization theorem for the fragment of N-Graphs with conjunction, disjunction and negation connectives, via the notion of sub-N-Graphs. N-G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00555","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":"1803.00555","created_at":"2026-05-18T00:22:11.470902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00555v1","created_at":"2026-05-18T00:22:11.470902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00555","created_at":"2026-05-18T00:22:11.470902+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP6KPYRNL6RM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP6KPYRNL6RM7S3A","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP6KPYRN","created_at":"2026-05-18T12:32:28.185984+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/HP6KPYRNL6RM7S3AEL6HKMI7F5","json":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5.json","graph_json":"https://pith.science/api/pith-number/HP6KPYRNL6RM7S3AEL6HKMI7F5/graph.json","events_json":"https://pith.science/api/pith-number/HP6KPYRNL6RM7S3AEL6HKMI7F5/events.json","paper":"https://pith.science/paper/HP6KPYRN"},"agent_actions":{"view_html":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5","download_json":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5.json","view_paper":"https://pith.science/paper/HP6KPYRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00555&json=true","fetch_graph":"https://pith.science/api/pith-number/HP6KPYRNL6RM7S3AEL6HKMI7F5/graph.json","fetch_events":"https://pith.science/api/pith-number/HP6KPYRNL6RM7S3AEL6HKMI7F5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5/action/storage_attestation","attest_author":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5/action/author_attestation","sign_citation":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5/action/citation_signature","submit_replication":"https://pith.science/pith/HP6KPYRNL6RM7S3AEL6HKMI7F5/action/replication_record"}},"created_at":"2026-05-18T00:22:11.470902+00:00","updated_at":"2026-05-18T00:22:11.470902+00:00"}