{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RVM2BJ7IYF7TWIXC2CQEHPL7VE","short_pith_number":"pith:RVM2BJ7I","canonical_record":{"source":{"id":"1705.10708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-30T15:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"8719794d264dc98578c8e2c5c25667ff2144fadcf33770493e7e811aeb26b421","abstract_canon_sha256":"d892ca816c3c41c816c46c6afd5372649236a03c286e6223e6094f3d3d818221"},"schema_version":"1.0"},"canonical_sha256":"8d59a0a7e8c17f3b22e2d0a043bd7fa910818ca8d9723db47573ab9b8b7caf14","source":{"kind":"arxiv","id":"1705.10708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10708","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10708v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10708","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"RVM2BJ7IYF7T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVM2BJ7IYF7TWIXC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVM2BJ7I","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RVM2BJ7IYF7TWIXC2CQEHPL7VE","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-30T15:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"8719794d264dc98578c8e2c5c25667ff2144fadcf33770493e7e811aeb26b421","abstract_canon_sha256":"d892ca816c3c41c816c46c6afd5372649236a03c286e6223e6094f3d3d818221"},"schema_version":"1.0"},"canonical_sha256":"8d59a0a7e8c17f3b22e2d0a043bd7fa910818ca8d9723db47573ab9b8b7caf14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.728814Z","signature_b64":"g5hrbuZYQA8Ihufq5w+LTqXeEvdJSQheDh9YhDY/OtykqVLNqdJsyDIYgwr7kOWMJZkBlCHka/JKyWOVafjhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d59a0a7e8c17f3b22e2d0a043bd7fa910818ca8d9723db47573ab9b8b7caf14","last_reissued_at":"2026-05-18T00:43:23.728300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.728300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10708","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-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaVm3zZfDyN/SGVSCWjuQmq3vdKXHq2+LZJuZ3nOmgq18g8DPtll9hdm0dIPf5vHSiCI5UBT3FMdH8zt9tVbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:27:04.357263Z"},"content_sha256":"13ae0df5ecf645ff1d5d3c289fecb587571013a1d348c173d190fb1a69c48514","schema_version":"1.0","event_id":"sha256:13ae0df5ecf645ff1d5d3c289fecb587571013a1d348c173d190fb1a69c48514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RVM2BJ7IYF7TWIXC2CQEHPL7VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an ASM thesis for reflective sequential algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Flavio Ferrarotti, Jose Maria Turull Torres, Loredana Tec","submitted_at":"2017-05-30T15:45:04Z","abstract_excerpt":"Starting from Gurevich's thesis for sequential algorithms (the so-called \"sequential ASM thesis\"), we propose a characterization of the behaviour of sequential algorithms enriched with reflection. That is, we present a set of postulates which we conjecture capture the fundamental properties of reflective sequential algorithms (RSAs). Then we look at the plausibility of an ASM thesis for the class of RSAs, defining a model of abstract state machine (which we call reflective ASM) that we conjecture captures the class of RSAs as defined by our postulates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10708","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-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqOTeIxKcdoZZ00x3JGaJlkvXENXAbqOkuVk5cJEB71zgiOoIwOIQskylk4/Z2F+seH0RLLI3lDOS06phDXCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:27:04.357825Z"},"content_sha256":"e3728a520b8c0745c83686bfeedc9a9fcb00966c06fccc7e2698f3ecb3800b8b","schema_version":"1.0","event_id":"sha256:e3728a520b8c0745c83686bfeedc9a9fcb00966c06fccc7e2698f3ecb3800b8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/bundle.json","state_url":"https://pith.science/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/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-08T02:27:04Z","links":{"resolver":"https://pith.science/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE","bundle":"https://pith.science/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/bundle.json","state":"https://pith.science/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVM2BJ7IYF7TWIXC2CQEHPL7VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RVM2BJ7IYF7TWIXC2CQEHPL7VE","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":"d892ca816c3c41c816c46c6afd5372649236a03c286e6223e6094f3d3d818221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-30T15:45:04Z","title_canon_sha256":"8719794d264dc98578c8e2c5c25667ff2144fadcf33770493e7e811aeb26b421"},"schema_version":"1.0","source":{"id":"1705.10708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10708","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10708v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10708","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"RVM2BJ7IYF7T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVM2BJ7IYF7TWIXC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVM2BJ7I","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:e3728a520b8c0745c83686bfeedc9a9fcb00966c06fccc7e2698f3ecb3800b8b","target":"graph","created_at":"2026-05-18T00:43:23Z","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":"Starting from Gurevich's thesis for sequential algorithms (the so-called \"sequential ASM thesis\"), we propose a characterization of the behaviour of sequential algorithms enriched with reflection. That is, we present a set of postulates which we conjecture capture the fundamental properties of reflective sequential algorithms (RSAs). Then we look at the plausibility of an ASM thesis for the class of RSAs, defining a model of abstract state machine (which we call reflective ASM) that we conjecture captures the class of RSAs as defined by our postulates.","authors_text":"Flavio Ferrarotti, Jose Maria Turull Torres, Loredana Tec","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-30T15:45:04Z","title":"Towards an ASM thesis for reflective sequential algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10708","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:13ae0df5ecf645ff1d5d3c289fecb587571013a1d348c173d190fb1a69c48514","target":"record","created_at":"2026-05-18T00:43:23Z","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":"d892ca816c3c41c816c46c6afd5372649236a03c286e6223e6094f3d3d818221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-30T15:45:04Z","title_canon_sha256":"8719794d264dc98578c8e2c5c25667ff2144fadcf33770493e7e811aeb26b421"},"schema_version":"1.0","source":{"id":"1705.10708","kind":"arxiv","version":1}},"canonical_sha256":"8d59a0a7e8c17f3b22e2d0a043bd7fa910818ca8d9723db47573ab9b8b7caf14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d59a0a7e8c17f3b22e2d0a043bd7fa910818ca8d9723db47573ab9b8b7caf14","first_computed_at":"2026-05-18T00:43:23.728300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.728300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g5hrbuZYQA8Ihufq5w+LTqXeEvdJSQheDh9YhDY/OtykqVLNqdJsyDIYgwr7kOWMJZkBlCHka/JKyWOVafjhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.728814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13ae0df5ecf645ff1d5d3c289fecb587571013a1d348c173d190fb1a69c48514","sha256:e3728a520b8c0745c83686bfeedc9a9fcb00966c06fccc7e2698f3ecb3800b8b"],"state_sha256":"215bc79aa50fb3a6df07c1bf312fe66efc8cc64ac85adc0da3b2b2f36f05ca99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeDuAZ4kMDSOxjBBujRuZHPeM1bgA71MOKkjnpurJ9NKPPBEofFkB/K73sxhm34x2NwiH/NSYE82G8fncjxjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:27:04.361373Z","bundle_sha256":"70ce2fa0a4e058e35d5fc093398921dfaca9bbdc15263f2da89fe17de9bade25"}}