{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VM3YE3U2NTXQJLJ3NQC7PXJ3EH","short_pith_number":"pith:VM3YE3U2","canonical_record":{"source":{"id":"1311.4289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-18T08:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"855093f3f19cf650f4298cb0686624ad47d547ad6a4e2759b42d8e32b85d59c2","abstract_canon_sha256":"a19b0a51c43a57cca83db6cf80557e1a626cbb8874dd5d43cd3e6f2891319218"},"schema_version":"1.0"},"canonical_sha256":"ab37826e9a6cef04ad3b6c05f7dd3b21d904881c943e0c4019737a8f27b8c9a4","source":{"kind":"arxiv","id":"1311.4289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4289","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4289v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4289","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"VM3YE3U2NTXQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VM3YE3U2NTXQJLJ3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VM3YE3U2","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VM3YE3U2NTXQJLJ3NQC7PXJ3EH","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-18T08:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"855093f3f19cf650f4298cb0686624ad47d547ad6a4e2759b42d8e32b85d59c2","abstract_canon_sha256":"a19b0a51c43a57cca83db6cf80557e1a626cbb8874dd5d43cd3e6f2891319218"},"schema_version":"1.0"},"canonical_sha256":"ab37826e9a6cef04ad3b6c05f7dd3b21d904881c943e0c4019737a8f27b8c9a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.133597Z","signature_b64":"7/A6R5GUvOgxSmDWUryxghlDxjv3/Xq39WGssPhTMPyhhrwNbe6crZaWrymoQHrH/4OtG84e3GILbTG1crCKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab37826e9a6cef04ad3b6c05f7dd3b21d904881c943e0c4019737a8f27b8c9a4","last_reissued_at":"2026-05-18T03:06:53.132997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.132997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4289","source_version":1,"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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bu/CRVfhB4nzizsHMdasIA8F+ZgV9vwpdTfOLwXCalTyvV1vfDb8K8iUaUd7M5fdTEJG5bMI713PQ9bRPzvmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:46:20.799800Z"},"content_sha256":"671c1bb00c723201f90f4f9612f80d8933f5ddb857c2ba8c0067f6b1018f2a0c","schema_version":"1.0","event_id":"sha256:671c1bb00c723201f90f4f9612f80d8933f5ddb857c2ba8c0067f6b1018f2a0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VM3YE3U2NTXQJLJ3NQC7PXJ3EH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating Parity Reasoning (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Tero Laitinen, Tommi Junttila","submitted_at":"2013-11-18T08:05:16Z","abstract_excerpt":"Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification, bounded model checking, and logical cryptanalysis, instances can have many parity (xor) constraints which may not be handled efficiently if translated to CNF. Thus, extensions to the CNF-driven search with various parity reasoning engines ranging from equivalence reasoning to incremental Gaussian elimination have been proposed. This paper studies how stronger parity reasoning tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4289","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"},"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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xh7sTLTP723WWDkYhiTlLnSC8dejTXtl5yG6cN7PF/xizBc09MoaZiauGDI/80TnjLyXWYhBPXzYzz5sE2nmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:46:20.800135Z"},"content_sha256":"589ed22c4d30ee413fe8b99c2a9b38a50dd752687a3584d20e957fabe4e20cc2","schema_version":"1.0","event_id":"sha256:589ed22c4d30ee413fe8b99c2a9b38a50dd752687a3584d20e957fabe4e20cc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/bundle.json","state_url":"https://pith.science/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/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-24T02:46:20Z","links":{"resolver":"https://pith.science/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH","bundle":"https://pith.science/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/bundle.json","state":"https://pith.science/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VM3YE3U2NTXQJLJ3NQC7PXJ3EH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VM3YE3U2NTXQJLJ3NQC7PXJ3EH","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":"a19b0a51c43a57cca83db6cf80557e1a626cbb8874dd5d43cd3e6f2891319218","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-18T08:05:16Z","title_canon_sha256":"855093f3f19cf650f4298cb0686624ad47d547ad6a4e2759b42d8e32b85d59c2"},"schema_version":"1.0","source":{"id":"1311.4289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4289","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4289v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4289","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"VM3YE3U2NTXQ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VM3YE3U2NTXQJLJ3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VM3YE3U2","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:589ed22c4d30ee413fe8b99c2a9b38a50dd752687a3584d20e957fabe4e20cc2","target":"graph","created_at":"2026-05-18T03:06:53Z","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":"Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification, bounded model checking, and logical cryptanalysis, instances can have many parity (xor) constraints which may not be handled efficiently if translated to CNF. Thus, extensions to the CNF-driven search with various parity reasoning engines ranging from equivalence reasoning to incremental Gaussian elimination have been proposed. This paper studies how stronger parity reasoning tec","authors_text":"Ilkka Niemel\\\"a, Tero Laitinen, Tommi Junttila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-18T08:05:16Z","title":"Simulating Parity Reasoning (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4289","kind":"arxiv","version":1},"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:671c1bb00c723201f90f4f9612f80d8933f5ddb857c2ba8c0067f6b1018f2a0c","target":"record","created_at":"2026-05-18T03:06:53Z","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":"a19b0a51c43a57cca83db6cf80557e1a626cbb8874dd5d43cd3e6f2891319218","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-18T08:05:16Z","title_canon_sha256":"855093f3f19cf650f4298cb0686624ad47d547ad6a4e2759b42d8e32b85d59c2"},"schema_version":"1.0","source":{"id":"1311.4289","kind":"arxiv","version":1}},"canonical_sha256":"ab37826e9a6cef04ad3b6c05f7dd3b21d904881c943e0c4019737a8f27b8c9a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab37826e9a6cef04ad3b6c05f7dd3b21d904881c943e0c4019737a8f27b8c9a4","first_computed_at":"2026-05-18T03:06:53.132997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:53.132997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/A6R5GUvOgxSmDWUryxghlDxjv3/Xq39WGssPhTMPyhhrwNbe6crZaWrymoQHrH/4OtG84e3GILbTG1crCKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:53.133597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:671c1bb00c723201f90f4f9612f80d8933f5ddb857c2ba8c0067f6b1018f2a0c","sha256:589ed22c4d30ee413fe8b99c2a9b38a50dd752687a3584d20e957fabe4e20cc2"],"state_sha256":"a702d1841175cb8647f8a69a1ab66c0f473fb01d8a5e05de77879c64febbe6b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg0wHou9SCakd/X8Y/AuyasWu3hB9RbcIkEzm3uiRJ0UIehZI+Hd1PTHEBB9cIk4dR4BC2A2jnB2/agR5zRDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:46:20.802017Z","bundle_sha256":"4cc313d8c2abc8eef4041da3a6ebf08269e429e899a7f521cbe6ee6a55bc45e3"}}