{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P7NI2GQLHIFXP5Y3AAINWN2PO5","short_pith_number":"pith:P7NI2GQL","canonical_record":{"source":{"id":"1610.08772","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-27T13:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"bcd2e256081bf12e5ccc4b1fb624711afba44b8747404c12d6b8b91e34b85fcb","abstract_canon_sha256":"92c4df72edba61e8d3fcc0ced604bd96603a11f1bdff5d522ec7233b9bc6e359"},"schema_version":"1.0"},"canonical_sha256":"7fda8d1a0b3a0b77f71b0010db374f776e06bb34222119d52eca9a4f4accdff4","source":{"kind":"arxiv","id":"1610.08772","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08772","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08772v4","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08772","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"P7NI2GQLHIFX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7NI2GQLHIFXP5Y3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7NI2GQL","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P7NI2GQLHIFXP5Y3AAINWN2PO5","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08772","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-27T13:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"bcd2e256081bf12e5ccc4b1fb624711afba44b8747404c12d6b8b91e34b85fcb","abstract_canon_sha256":"92c4df72edba61e8d3fcc0ced604bd96603a11f1bdff5d522ec7233b9bc6e359"},"schema_version":"1.0"},"canonical_sha256":"7fda8d1a0b3a0b77f71b0010db374f776e06bb34222119d52eca9a4f4accdff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.776353Z","signature_b64":"DNUXgNjAln/293t75Be7a87ad5qVrHW/UPxu6skY87dA8UmK2iTbp+hS5hG3km4nlED6+Mfpc1ZoBX9xw+uNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fda8d1a0b3a0b77f71b0010db374f776e06bb34222119d52eca9a4f4accdff4","last_reissued_at":"2026-05-17T23:51:21.775803Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.775803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08772","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLVyvbMs6aBTmo4SXEdd4JROmIVuhfsHJsrra773rSc/8zGaDALJJ3Q6VMd5xd45UKpc+cFlFsJ1wllvuWeYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:52.612924Z"},"content_sha256":"d14bb158fc21ba5b81a39f7f5074370880a0db84aca573da3b1f09694d6bd284","schema_version":"1.0","event_id":"sha256:d14bb158fc21ba5b81a39f7f5074370880a0db84aca573da3b1f09694d6bd284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P7NI2GQLHIFXP5Y3AAINWN2PO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On linear rewriting systems for Boolean logic and some applications to proof theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anupam Das, Lutz Stra{\\ss}burger","submitted_at":"2016-10-27T13:35:54Z","abstract_excerpt":"Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can be written as a (left- and right-)linear rewrite rule. In this paper we study properties of systems consisting only of linear inferences. Our main result is that the length of any 'nontrivial' derivation in such a system is bound by a polynomial. As a consequence there is no polynomial-time decidable sound and complete system of linear inferences, unless coNP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08772","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpstbeM9Xw36yWo08I0sacS1sdxq98E3pP89YgoROKQd/DCDHHGeC/uffvBziQFz21JgwSeAxzW87SU+upCiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:52.613573Z"},"content_sha256":"52e0c4473b5aba0bce0d5e90fa556d7d32b9f04a5d10d9afb9a50d0ef1775691","schema_version":"1.0","event_id":"sha256:52e0c4473b5aba0bce0d5e90fa556d7d32b9f04a5d10d9afb9a50d0ef1775691"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/bundle.json","state_url":"https://pith.science/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T22:18:52Z","links":{"resolver":"https://pith.science/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5","bundle":"https://pith.science/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/bundle.json","state":"https://pith.science/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7NI2GQLHIFXP5Y3AAINWN2PO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P7NI2GQLHIFXP5Y3AAINWN2PO5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"92c4df72edba61e8d3fcc0ced604bd96603a11f1bdff5d522ec7233b9bc6e359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-27T13:35:54Z","title_canon_sha256":"bcd2e256081bf12e5ccc4b1fb624711afba44b8747404c12d6b8b91e34b85fcb"},"schema_version":"1.0","source":{"id":"1610.08772","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08772","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08772v4","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08772","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"P7NI2GQLHIFX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7NI2GQLHIFXP5Y3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7NI2GQL","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:52e0c4473b5aba0bce0d5e90fa556d7d32b9f04a5d10d9afb9a50d0ef1775691","target":"graph","created_at":"2026-05-17T23:51:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can be written as a (left- and right-)linear rewrite rule. In this paper we study properties of systems consisting only of linear inferences. Our main result is that the length of any 'nontrivial' derivation in such a system is bound by a polynomial. As a consequence there is no polynomial-time decidable sound and complete system of linear inferences, unless coNP","authors_text":"Anupam Das, Lutz Stra{\\ss}burger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-27T13:35:54Z","title":"On linear rewriting systems for Boolean logic and some applications to proof theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08772","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d14bb158fc21ba5b81a39f7f5074370880a0db84aca573da3b1f09694d6bd284","target":"record","created_at":"2026-05-17T23:51:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"92c4df72edba61e8d3fcc0ced604bd96603a11f1bdff5d522ec7233b9bc6e359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-27T13:35:54Z","title_canon_sha256":"bcd2e256081bf12e5ccc4b1fb624711afba44b8747404c12d6b8b91e34b85fcb"},"schema_version":"1.0","source":{"id":"1610.08772","kind":"arxiv","version":4}},"canonical_sha256":"7fda8d1a0b3a0b77f71b0010db374f776e06bb34222119d52eca9a4f4accdff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fda8d1a0b3a0b77f71b0010db374f776e06bb34222119d52eca9a4f4accdff4","first_computed_at":"2026-05-17T23:51:21.775803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:21.775803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DNUXgNjAln/293t75Be7a87ad5qVrHW/UPxu6skY87dA8UmK2iTbp+hS5hG3km4nlED6+Mfpc1ZoBX9xw+uNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:21.776353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08772","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d14bb158fc21ba5b81a39f7f5074370880a0db84aca573da3b1f09694d6bd284","sha256:52e0c4473b5aba0bce0d5e90fa556d7d32b9f04a5d10d9afb9a50d0ef1775691"],"state_sha256":"3236d41894ac65eeebe941ae027f8bd451f0c7e666c81d44b8c5664264e7a113"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMCnordp/6WCNnWlzuZ/1DP0Vo1rLpT1u0mQ5pQ78nolh/JjOLM+yG0+a1FzuNz3+BaGzTJqkjIZY7FaU6iMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:18:52.616957Z","bundle_sha256":"0bbbda9a94daaf9171b1c5ec03d089856148aeb30e1832a2e0e44f3c328a9dec"}}