{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DDXSW2Z2VHVLQKZ44SUIGY743U","short_pith_number":"pith:DDXSW2Z2","canonical_record":{"source":{"id":"1604.04240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-14T18:01:57Z","cross_cats_sorted":[],"title_canon_sha256":"6aa248904372d5bc37672ef02eca2a793b548a1da43dd586a2f39d7e2fa9c6b5","abstract_canon_sha256":"cf301687003ff61bb621deede2d8fda2073f80b8cac70e43b3337c1a56f3e904"},"schema_version":"1.0"},"canonical_sha256":"18ef2b6b3aa9eab82b3ce4a88363fcdd35537d60defb2926b1967f291dd81745","source":{"kind":"arxiv","id":"1604.04240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04240","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04240v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04240","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"DDXSW2Z2VHVL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DDXSW2Z2VHVLQKZ4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DDXSW2Z2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DDXSW2Z2VHVLQKZ44SUIGY743U","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-14T18:01:57Z","cross_cats_sorted":[],"title_canon_sha256":"6aa248904372d5bc37672ef02eca2a793b548a1da43dd586a2f39d7e2fa9c6b5","abstract_canon_sha256":"cf301687003ff61bb621deede2d8fda2073f80b8cac70e43b3337c1a56f3e904"},"schema_version":"1.0"},"canonical_sha256":"18ef2b6b3aa9eab82b3ce4a88363fcdd35537d60defb2926b1967f291dd81745","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.086569Z","signature_b64":"5ZYpJwF/p31KipYnkeMTWskc93Sn1fyzHKtiR7yPTre7UpehKJzbnXajIKQ7GDobd61jlKmcJyeMvX9Qhpd/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18ef2b6b3aa9eab82b3ce4a88363fcdd35537d60defb2926b1967f291dd81745","last_reissued_at":"2026-05-18T01:17:06.085885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.085885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04240","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:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8ThZVMRKNX2K1odZHwQ34olOYMZG1daMETddYYcorCrMbkhQ8xbyXTXpM8cjvbDxM3YJ3PKQcxKyV/lyYhfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:28:02.780389Z"},"content_sha256":"eb6f17f33013bb22c4460025d4f88e3cd26181acfc579ce2a3d71e22f6d15a5c","schema_version":"1.0","event_id":"sha256:eb6f17f33013bb22c4460025d4f88e3cd26181acfc579ce2a3d71e22f6d15a5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DDXSW2Z2VHVLQKZ44SUIGY743U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Method of Verification of Functional Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrew M. Mironov","submitted_at":"2016-04-14T18:01:57Z","abstract_excerpt":"In the paper the problem of verification of functional programs (FPs) over strings is considered, where specifications of properties of FPs are defined by other FPs, and a FP S1 meets a specification defined by another FP S2 iff a composition of functions defined by the FPs S1 and S2 is equal to the constant 1. We introduce a concept of a state diagram of a FP, and reduce the verification problem to the problem of an analysis of the state diagrams of FPs. The proposed approach is illustrated by the example of verification of a sorting program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04240","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:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGmGmaq1TrPhOtS4MK2QVNUj6E5X71J7lu1/O0R5SySwRYsxMXm8hNY6LMYg1smmgjQ7R46aod9FWE2itnriAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:28:02.781082Z"},"content_sha256":"09da0aebc86a85f264a93975714ffdb6608294ec141e27094d6048845b64e747","schema_version":"1.0","event_id":"sha256:09da0aebc86a85f264a93975714ffdb6608294ec141e27094d6048845b64e747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/bundle.json","state_url":"https://pith.science/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/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-28T20:28:02Z","links":{"resolver":"https://pith.science/pith/DDXSW2Z2VHVLQKZ44SUIGY743U","bundle":"https://pith.science/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/bundle.json","state":"https://pith.science/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDXSW2Z2VHVLQKZ44SUIGY743U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DDXSW2Z2VHVLQKZ44SUIGY743U","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":"cf301687003ff61bb621deede2d8fda2073f80b8cac70e43b3337c1a56f3e904","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-14T18:01:57Z","title_canon_sha256":"6aa248904372d5bc37672ef02eca2a793b548a1da43dd586a2f39d7e2fa9c6b5"},"schema_version":"1.0","source":{"id":"1604.04240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04240","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04240v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04240","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"DDXSW2Z2VHVL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DDXSW2Z2VHVLQKZ4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DDXSW2Z2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:09da0aebc86a85f264a93975714ffdb6608294ec141e27094d6048845b64e747","target":"graph","created_at":"2026-05-18T01:17:06Z","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":"In the paper the problem of verification of functional programs (FPs) over strings is considered, where specifications of properties of FPs are defined by other FPs, and a FP S1 meets a specification defined by another FP S2 iff a composition of functions defined by the FPs S1 and S2 is equal to the constant 1. We introduce a concept of a state diagram of a FP, and reduce the verification problem to the problem of an analysis of the state diagrams of FPs. The proposed approach is illustrated by the example of verification of a sorting program.","authors_text":"Andrew M. Mironov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-14T18:01:57Z","title":"A New Method of Verification of Functional Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04240","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:eb6f17f33013bb22c4460025d4f88e3cd26181acfc579ce2a3d71e22f6d15a5c","target":"record","created_at":"2026-05-18T01:17:06Z","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":"cf301687003ff61bb621deede2d8fda2073f80b8cac70e43b3337c1a56f3e904","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-14T18:01:57Z","title_canon_sha256":"6aa248904372d5bc37672ef02eca2a793b548a1da43dd586a2f39d7e2fa9c6b5"},"schema_version":"1.0","source":{"id":"1604.04240","kind":"arxiv","version":1}},"canonical_sha256":"18ef2b6b3aa9eab82b3ce4a88363fcdd35537d60defb2926b1967f291dd81745","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18ef2b6b3aa9eab82b3ce4a88363fcdd35537d60defb2926b1967f291dd81745","first_computed_at":"2026-05-18T01:17:06.085885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.085885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZYpJwF/p31KipYnkeMTWskc93Sn1fyzHKtiR7yPTre7UpehKJzbnXajIKQ7GDobd61jlKmcJyeMvX9Qhpd/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.086569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb6f17f33013bb22c4460025d4f88e3cd26181acfc579ce2a3d71e22f6d15a5c","sha256:09da0aebc86a85f264a93975714ffdb6608294ec141e27094d6048845b64e747"],"state_sha256":"80b8502f78c4dec9714647ef2ccd17bd64d9093c54b9983deeb41a5b1aa45ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9eVrDyNaAUE2jjuQU/RhSM8hgxdx2Phqc3fwFgdMv0zyBc+ekgLUTpu2kTIz+yF4y472zg35DY5gROsE2OWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:28:02.784711Z","bundle_sha256":"6abff2c5d184711353ef82fae20a301caf0c19381329e9568c14f23b29b10ed5"}}