{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5S3PVLYCMLOXPRZAB2UDJYS7KG","short_pith_number":"pith:5S3PVLYC","canonical_record":{"source":{"id":"1406.4698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-18T12:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"13e4a2c938447a1153fe6fa62834c93c03b10fcd80bebb08daa34b7a57788fcc","abstract_canon_sha256":"85078a6e567480879ec3f2d7066137369f6025574398b4984d80e32373c56c57"},"schema_version":"1.0"},"canonical_sha256":"ecb6faaf0262dd77c7200ea834e25f51a904a6ea5c774f72b2b1eac7d30b89da","source":{"kind":"arxiv","id":"1406.4698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4698","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4698v1","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4698","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"5S3PVLYCMLOX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5S3PVLYCMLOXPRZA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5S3PVLYC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5S3PVLYCMLOXPRZAB2UDJYS7KG","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-18T12:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"13e4a2c938447a1153fe6fa62834c93c03b10fcd80bebb08daa34b7a57788fcc","abstract_canon_sha256":"85078a6e567480879ec3f2d7066137369f6025574398b4984d80e32373c56c57"},"schema_version":"1.0"},"canonical_sha256":"ecb6faaf0262dd77c7200ea834e25f51a904a6ea5c774f72b2b1eac7d30b89da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.972696Z","signature_b64":"A7+9uxUGd8GZar5VtDfUrVKtKwh71fMWMjYiwkvqGh/IfcyyXv8dky6X86V+co8B918jVeNH/WHp6bJP+BFwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb6faaf0262dd77c7200ea834e25f51a904a6ea5c774f72b2b1eac7d30b89da","last_reissued_at":"2026-05-18T02:49:30.972263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.972263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4698","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-18T02:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVl9MOywHz62cpiicJ33nM8iYLC7MxeVrCojhYBs3YlHtzpvFuzoJ977OkX3s7FjMjvQpCr15HaJi6HJsPgbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:00:39.764984Z"},"content_sha256":"f648f2557e7a71e1022ba6bbe2556dbd93a0252d21cc770b0bdef40b426b68df","schema_version":"1.0","event_id":"sha256:f648f2557e7a71e1022ba6bbe2556dbd93a0252d21cc770b0bdef40b426b68df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5S3PVLYCMLOXPRZAB2UDJYS7KG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classifying and Propagating Parity Constraints (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":"2014-06-18T12:51:13Z","abstract_excerpt":"Parity constraints, common in application domains such as circuit verification, bounded model checking, and logical cryptanalysis, are not necessarily most efficiently solved if translated into conjunctive normal form. Thus, specialized parity reasoning techniques have been developed in the past for propagating parity constraints. This paper studies the questions of deciding whether unit propagation or equivalence reasoning is enough to achieve full propagation in a given parity constraint set. Efficient approximating tests for answering these questions are developed. It is also shown that equ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4698","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-18T02:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+85qwwVn/sytWC1NbbX5JuYVz8Safs0oJcHw0/64XCXWgQocDENzseJfr5FXots0a7cpPLXbK5SykrzyVpfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:00:39.765349Z"},"content_sha256":"21cd279387b09eaa0b07abbb19afd7e84e16ab3359cff3fcf2f12e9060ac3dbc","schema_version":"1.0","event_id":"sha256:21cd279387b09eaa0b07abbb19afd7e84e16ab3359cff3fcf2f12e9060ac3dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/bundle.json","state_url":"https://pith.science/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/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-24T03:00:39Z","links":{"resolver":"https://pith.science/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG","bundle":"https://pith.science/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/bundle.json","state":"https://pith.science/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5S3PVLYCMLOXPRZAB2UDJYS7KG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5S3PVLYCMLOXPRZAB2UDJYS7KG","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":"85078a6e567480879ec3f2d7066137369f6025574398b4984d80e32373c56c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-18T12:51:13Z","title_canon_sha256":"13e4a2c938447a1153fe6fa62834c93c03b10fcd80bebb08daa34b7a57788fcc"},"schema_version":"1.0","source":{"id":"1406.4698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4698","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4698v1","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4698","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"5S3PVLYCMLOX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5S3PVLYCMLOXPRZA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5S3PVLYC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:21cd279387b09eaa0b07abbb19afd7e84e16ab3359cff3fcf2f12e9060ac3dbc","target":"graph","created_at":"2026-05-18T02:49:30Z","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":"Parity constraints, common in application domains such as circuit verification, bounded model checking, and logical cryptanalysis, are not necessarily most efficiently solved if translated into conjunctive normal form. Thus, specialized parity reasoning techniques have been developed in the past for propagating parity constraints. This paper studies the questions of deciding whether unit propagation or equivalence reasoning is enough to achieve full propagation in a given parity constraint set. Efficient approximating tests for answering these questions are developed. It is also shown that equ","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":"2014-06-18T12:51:13Z","title":"Classifying and Propagating Parity Constraints (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4698","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:f648f2557e7a71e1022ba6bbe2556dbd93a0252d21cc770b0bdef40b426b68df","target":"record","created_at":"2026-05-18T02:49:30Z","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":"85078a6e567480879ec3f2d7066137369f6025574398b4984d80e32373c56c57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-18T12:51:13Z","title_canon_sha256":"13e4a2c938447a1153fe6fa62834c93c03b10fcd80bebb08daa34b7a57788fcc"},"schema_version":"1.0","source":{"id":"1406.4698","kind":"arxiv","version":1}},"canonical_sha256":"ecb6faaf0262dd77c7200ea834e25f51a904a6ea5c774f72b2b1eac7d30b89da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb6faaf0262dd77c7200ea834e25f51a904a6ea5c774f72b2b1eac7d30b89da","first_computed_at":"2026-05-18T02:49:30.972263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:30.972263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7+9uxUGd8GZar5VtDfUrVKtKwh71fMWMjYiwkvqGh/IfcyyXv8dky6X86V+co8B918jVeNH/WHp6bJP+BFwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:30.972696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f648f2557e7a71e1022ba6bbe2556dbd93a0252d21cc770b0bdef40b426b68df","sha256:21cd279387b09eaa0b07abbb19afd7e84e16ab3359cff3fcf2f12e9060ac3dbc"],"state_sha256":"3b5cd65cb89761e4f4614631d91791d9b139f1e58761bcb5d6ac591b4a3ab147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MFHzxgV0YXqfFyLsaqC/E4f0MRYMv0a5lHVTneWZbL+ys+PFtkwU+5oi9AzETLZ0ycoTpz7Komjh0U5FSdJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:00:39.767294Z","bundle_sha256":"09225a11b75dc5ba932ee01970891781db66684b9c7e7615e0ad496ac93cf3d5"}}