{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:SCLQ4BEDHQ6KNQ27QNLATPJDVG","short_pith_number":"pith:SCLQ4BED","schema_version":"1.0","canonical_sha256":"90970e04833c3ca6c35f835609bd23a9bff3186ce0fdfa8482d14e9d98488bdd","source":{"kind":"arxiv","id":"0801.2421","version":1},"attestation_state":"computed","paper":{"title":"Abstract p-time proof nets for MALL: Conflict nets","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dominic J. D. Hughes","submitted_at":"2008-01-16T02:33:57Z","abstract_excerpt":"This paper presents proof nets for multiplicative-additive linear logic (MALL), called conflict nets. They are efficient, since both correctness and translation from a proof are p-time (polynomial time), and abstract, since they are invariant under transposing adjacent &-rules.\n  A conflict net on a sequent is concise: axiom links with a conflict relation. Conflict nets are a variant of (and were inspired by) combinatorial proofs introduced recently for classical logic: each can be viewed as a maximal map (homomorphism) of contractible coherence spaces (P_4-free graphs, or cographs), from axio"},"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":"0801.2421","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"2008-01-16T02:33:57Z","cross_cats_sorted":[],"title_canon_sha256":"75934974cbcbca3697c7f208ae8e68f32e4c613917221f766e4599c3953e7b93","abstract_canon_sha256":"2b7c011a0dd6e5938e957d228651da07d22ab058c34a87c8fbecbbe78d98264f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:13.842176Z","signature_b64":"xxGBZ1X0RRcAEoARcBxv8/rOnoj83ccJ+hhzUFW7kRJiW7IJYxrN4Tw+13iju39iqufrZWvnZ53PSdwEg6bcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90970e04833c3ca6c35f835609bd23a9bff3186ce0fdfa8482d14e9d98488bdd","last_reissued_at":"2026-05-18T01:05:13.841441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:13.841441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstract p-time proof nets for MALL: Conflict nets","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dominic J. D. Hughes","submitted_at":"2008-01-16T02:33:57Z","abstract_excerpt":"This paper presents proof nets for multiplicative-additive linear logic (MALL), called conflict nets. They are efficient, since both correctness and translation from a proof are p-time (polynomial time), and abstract, since they are invariant under transposing adjacent &-rules.\n  A conflict net on a sequent is concise: axiom links with a conflict relation. Conflict nets are a variant of (and were inspired by) combinatorial proofs introduced recently for classical logic: each can be viewed as a maximal map (homomorphism) of contractible coherence spaces (P_4-free graphs, or cographs), from axio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2421","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":"0801.2421","created_at":"2026-05-18T01:05:13.841582+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.2421v1","created_at":"2026-05-18T01:05:13.841582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2421","created_at":"2026-05-18T01:05:13.841582+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCLQ4BEDHQ6K","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCLQ4BEDHQ6KNQ27","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCLQ4BED","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14476","citing_title":"Proof Nets for PiL (Full Version)","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG","json":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG.json","graph_json":"https://pith.science/api/pith-number/SCLQ4BEDHQ6KNQ27QNLATPJDVG/graph.json","events_json":"https://pith.science/api/pith-number/SCLQ4BEDHQ6KNQ27QNLATPJDVG/events.json","paper":"https://pith.science/paper/SCLQ4BED"},"agent_actions":{"view_html":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG","download_json":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG.json","view_paper":"https://pith.science/paper/SCLQ4BED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.2421&json=true","fetch_graph":"https://pith.science/api/pith-number/SCLQ4BEDHQ6KNQ27QNLATPJDVG/graph.json","fetch_events":"https://pith.science/api/pith-number/SCLQ4BEDHQ6KNQ27QNLATPJDVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG/action/storage_attestation","attest_author":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG/action/author_attestation","sign_citation":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG/action/citation_signature","submit_replication":"https://pith.science/pith/SCLQ4BEDHQ6KNQ27QNLATPJDVG/action/replication_record"}},"created_at":"2026-05-18T01:05:13.841582+00:00","updated_at":"2026-05-18T01:05:13.841582+00:00"}