{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3FD5O5FFKT73WKA4AFILMY7EOC","short_pith_number":"pith:3FD5O5FF","canonical_record":{"source":{"id":"1510.05231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-10-18T12:21:48Z","cross_cats_sorted":[],"title_canon_sha256":"6bfe856d66853053b6df5e900f5d5dfed54c732ce09debc8c71e6c684f489800","abstract_canon_sha256":"7e5bba0a2847050032043e9e6a501d79b4ac298ca552d3cccf52b6e84407685c"},"schema_version":"1.0"},"canonical_sha256":"d947d774a554ffbb281c0150b663e4709db300f924b4e1697650abd7e954896f","source":{"kind":"arxiv","id":"1510.05231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05231","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05231v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05231","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"3FD5O5FFKT73","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FD5O5FFKT73WKA4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FD5O5FF","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3FD5O5FFKT73WKA4AFILMY7EOC","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-10-18T12:21:48Z","cross_cats_sorted":[],"title_canon_sha256":"6bfe856d66853053b6df5e900f5d5dfed54c732ce09debc8c71e6c684f489800","abstract_canon_sha256":"7e5bba0a2847050032043e9e6a501d79b4ac298ca552d3cccf52b6e84407685c"},"schema_version":"1.0"},"canonical_sha256":"d947d774a554ffbb281c0150b663e4709db300f924b4e1697650abd7e954896f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:52.845915Z","signature_b64":"Ps8i+wlNPBWUB89vJXwX+kwQr/gou1ckO3ZstlGgsYFWns0M/bmr5TLoD8RHm+mOBAT2AFYdJxWVYMjRdzieDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d947d774a554ffbb281c0150b663e4709db300f924b4e1697650abd7e954896f","last_reissued_at":"2026-05-18T01:29:52.845273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:52.845273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05231","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-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8iWrEmCRiXxo11aG1bObHurVd2QxtsD7ReRlG58dEWyYHTIe0eX7j6p5YZ0mDpLy3GAWNyRhF8NOHNuF7EuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:46:42.979365Z"},"content_sha256":"a1f3f5cde8a00ce2246937c3dc0ce5e4e4e8771c3598ed8dce96a1428d63c1f9","schema_version":"1.0","event_id":"sha256:a1f3f5cde8a00ce2246937c3dc0ce5e4e4e8771c3598ed8dce96a1428d63c1f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3FD5O5FFKT73WKA4AFILMY7EOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Signal Processing Structures for Solving Conservative Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Tarek A. Lahlou, Thomas A. Baran","submitted_at":"2015-10-18T12:21:48Z","abstract_excerpt":"This primary purpose of this paper is to succinctly state a number of verifiable and tractable sufficient conditions under which a particular class of conservative signal processing structures may be readily used to solve a companion class of constraint satisfaction problems using both synchronous and asynchronous implementation protocols. In particular, the mentioned class of structures is shown to have desirable convergence and robustness properties with respect to various uncertainties involving communication and processing delays. Essential ingredients to the arguments herein involve blend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05231","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-18T01:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFTP4IuaAxINg1RNTNLNIhVADzgBM20Ms/gMM1i5Z3XLMHunWxuc187wmdpNK5PkdTG+IlhUbSL1LpsR5s64CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:46:42.979795Z"},"content_sha256":"63c87937e940c5195d3fc695c3d3808dbdbdf12f7167ce267e5400634b734ede","schema_version":"1.0","event_id":"sha256:63c87937e940c5195d3fc695c3d3808dbdbdf12f7167ce267e5400634b734ede"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FD5O5FFKT73WKA4AFILMY7EOC/bundle.json","state_url":"https://pith.science/pith/3FD5O5FFKT73WKA4AFILMY7EOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FD5O5FFKT73WKA4AFILMY7EOC/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-05-31T20:46:42Z","links":{"resolver":"https://pith.science/pith/3FD5O5FFKT73WKA4AFILMY7EOC","bundle":"https://pith.science/pith/3FD5O5FFKT73WKA4AFILMY7EOC/bundle.json","state":"https://pith.science/pith/3FD5O5FFKT73WKA4AFILMY7EOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FD5O5FFKT73WKA4AFILMY7EOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3FD5O5FFKT73WKA4AFILMY7EOC","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":"7e5bba0a2847050032043e9e6a501d79b4ac298ca552d3cccf52b6e84407685c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-10-18T12:21:48Z","title_canon_sha256":"6bfe856d66853053b6df5e900f5d5dfed54c732ce09debc8c71e6c684f489800"},"schema_version":"1.0","source":{"id":"1510.05231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05231","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05231v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05231","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"3FD5O5FFKT73","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FD5O5FFKT73WKA4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FD5O5FF","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:63c87937e940c5195d3fc695c3d3808dbdbdf12f7167ce267e5400634b734ede","target":"graph","created_at":"2026-05-18T01:29:52Z","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":"This primary purpose of this paper is to succinctly state a number of verifiable and tractable sufficient conditions under which a particular class of conservative signal processing structures may be readily used to solve a companion class of constraint satisfaction problems using both synchronous and asynchronous implementation protocols. In particular, the mentioned class of structures is shown to have desirable convergence and robustness properties with respect to various uncertainties involving communication and processing delays. Essential ingredients to the arguments herein involve blend","authors_text":"Tarek A. Lahlou, Thomas A. Baran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-10-18T12:21:48Z","title":"Signal Processing Structures for Solving Conservative Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05231","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:a1f3f5cde8a00ce2246937c3dc0ce5e4e4e8771c3598ed8dce96a1428d63c1f9","target":"record","created_at":"2026-05-18T01:29:52Z","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":"7e5bba0a2847050032043e9e6a501d79b4ac298ca552d3cccf52b6e84407685c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-10-18T12:21:48Z","title_canon_sha256":"6bfe856d66853053b6df5e900f5d5dfed54c732ce09debc8c71e6c684f489800"},"schema_version":"1.0","source":{"id":"1510.05231","kind":"arxiv","version":1}},"canonical_sha256":"d947d774a554ffbb281c0150b663e4709db300f924b4e1697650abd7e954896f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d947d774a554ffbb281c0150b663e4709db300f924b4e1697650abd7e954896f","first_computed_at":"2026-05-18T01:29:52.845273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.845273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ps8i+wlNPBWUB89vJXwX+kwQr/gou1ckO3ZstlGgsYFWns0M/bmr5TLoD8RHm+mOBAT2AFYdJxWVYMjRdzieDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.845915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f3f5cde8a00ce2246937c3dc0ce5e4e4e8771c3598ed8dce96a1428d63c1f9","sha256:63c87937e940c5195d3fc695c3d3808dbdbdf12f7167ce267e5400634b734ede"],"state_sha256":"b80a0132215105491f0b222043c4a2f68f28317d7ae71d5adab5bd8c15c2114f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDMl4/sRuoJ/X+aI6uwUnk8DPG5+DwILkWwUUE7Z+Jm0dj5V7vTJR4ECbGhUjLgbTNWSJvhPvKBbaVwshbDSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:46:42.982406Z","bundle_sha256":"33f3bbe99dc4c66aba9ff517a1f888001918f1904ed139a0de557ee790a45e41"}}