{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VQJABTXDTLK55EFPD3OKJXH6OW","short_pith_number":"pith:VQJABTXD","schema_version":"1.0","canonical_sha256":"ac1200cee39ad5de90af1edca4dcfe759250815ca27fd2136f4d041b23ff83b1","source":{"kind":"arxiv","id":"1708.07225","version":1},"attestation_state":"computed","paper":{"title":"Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"D\\'aniel Horp\\'acsi, Judit K\\H{o}szegi, Zolt\\'an Horv\\'ath","submitted_at":"2017-08-24T00:19:52Z","abstract_excerpt":"Widely used complex code refactoring tools lack a solid reasoning about the correctness of the transformations they implement, whilst interest in proven correct refactoring is ever increasing as only formal verification can provide true confidence in applying tool-automated refactoring to industrial-scale code. By using our strategic rewriting based refactoring specification language, we present the decomposition of a complex transformation into smaller steps that can be expressed as instances of refactoring schemes, then we demonstrate the semi-automatic formal verification of the components "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.07225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-08-24T00:19:52Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"274e317ac8b6a6e9d43be98f74600c421aaf4aa569cf6164df69ef9e685f44a5","abstract_canon_sha256":"d6e14eca46a66ddf3d072fcc021ccd709898c9a1fc0fedb745a1f4b40cfb9a6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.873612Z","signature_b64":"BiYKHXlO7orE2TQfCS71UKjwmsY+utWDkV3yeMPNVt8xoDirjnIJHwN9PId6tH2irxYSf6gerYK3GTO6l4oiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac1200cee39ad5de90af1edca4dcfe759250815ca27fd2136f4d041b23ff83b1","last_reissued_at":"2026-05-18T00:36:46.873025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.873025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"D\\'aniel Horp\\'acsi, Judit K\\H{o}szegi, Zolt\\'an Horv\\'ath","submitted_at":"2017-08-24T00:19:52Z","abstract_excerpt":"Widely used complex code refactoring tools lack a solid reasoning about the correctness of the transformations they implement, whilst interest in proven correct refactoring is ever increasing as only formal verification can provide true confidence in applying tool-automated refactoring to industrial-scale code. By using our strategic rewriting based refactoring specification language, we present the decomposition of a complex transformation into smaller steps that can be expressed as instances of refactoring schemes, then we demonstrate the semi-automatic formal verification of the components "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07225","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07225","created_at":"2026-05-18T00:36:46.873101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07225v1","created_at":"2026-05-18T00:36:46.873101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07225","created_at":"2026-05-18T00:36:46.873101+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQJABTXDTLK5","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQJABTXDTLK55EFP","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQJABTXD","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW","json":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW.json","graph_json":"https://pith.science/api/pith-number/VQJABTXDTLK55EFPD3OKJXH6OW/graph.json","events_json":"https://pith.science/api/pith-number/VQJABTXDTLK55EFPD3OKJXH6OW/events.json","paper":"https://pith.science/paper/VQJABTXD"},"agent_actions":{"view_html":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW","download_json":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW.json","view_paper":"https://pith.science/paper/VQJABTXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07225&json=true","fetch_graph":"https://pith.science/api/pith-number/VQJABTXDTLK55EFPD3OKJXH6OW/graph.json","fetch_events":"https://pith.science/api/pith-number/VQJABTXDTLK55EFPD3OKJXH6OW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW/action/storage_attestation","attest_author":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW/action/author_attestation","sign_citation":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW/action/citation_signature","submit_replication":"https://pith.science/pith/VQJABTXDTLK55EFPD3OKJXH6OW/action/replication_record"}},"created_at":"2026-05-18T00:36:46.873101+00:00","updated_at":"2026-05-18T00:36:46.873101+00:00"}