{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FM7D7UXINH3VREA2ZC2XF2WZEP","short_pith_number":"pith:FM7D7UXI","schema_version":"1.0","canonical_sha256":"2b3e3fd2e869f758901ac8b572ead923e5f3161f20884687a660d4a8e2d95558","source":{"kind":"arxiv","id":"1505.07162","version":1},"attestation_state":"computed","paper":{"title":"Needed Computations Shortcutting Needed Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Jacob Johannsen, Sergio Antoy, Steven Libby","submitted_at":"2015-05-27T00:47:50Z","abstract_excerpt":"We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code  is another constructor-based graph rewriting system. This system is normalizing for the original system when using an innermost strategy. Consequently, the object code can be easily implemented by eager functions in a variety of programming languages. We modify this object code in a way that  avoids total or partial construction of the contracta of some needed steps of a computation. When computing normal forms in this way, both memory consumpt"},"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":"1505.07162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-27T00:47:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fabc061b5388216c7d5e233eecccb098d866b06ceba734161b018be637cdf3e3","abstract_canon_sha256":"5d6ca0b276871f704e59ffd6d385ff58c84444acdea0fc022abb6779407ba12f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:07.319060Z","signature_b64":"muzD84fz56gLENLcqBL/KKy6PGJ5I7V8sG9ybIDbBM7qjseb6vt15//gz6dvOtsCQG0gdgQrr592vvqNKxZtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b3e3fd2e869f758901ac8b572ead923e5f3161f20884687a660d4a8e2d95558","last_reissued_at":"2026-05-18T02:02:07.318394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:07.318394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Needed Computations Shortcutting Needed Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Jacob Johannsen, Sergio Antoy, Steven Libby","submitted_at":"2015-05-27T00:47:50Z","abstract_excerpt":"We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code  is another constructor-based graph rewriting system. This system is normalizing for the original system when using an innermost strategy. Consequently, the object code can be easily implemented by eager functions in a variety of programming languages. We modify this object code in a way that  avoids total or partial construction of the contracta of some needed steps of a computation. When computing normal forms in this way, both memory consumpt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07162","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":"1505.07162","created_at":"2026-05-18T02:02:07.318504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07162v1","created_at":"2026-05-18T02:02:07.318504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07162","created_at":"2026-05-18T02:02:07.318504+00:00"},{"alias_kind":"pith_short_12","alias_value":"FM7D7UXINH3V","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FM7D7UXINH3VREA2","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FM7D7UXI","created_at":"2026-05-18T12:29:19.899920+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/FM7D7UXINH3VREA2ZC2XF2WZEP","json":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP.json","graph_json":"https://pith.science/api/pith-number/FM7D7UXINH3VREA2ZC2XF2WZEP/graph.json","events_json":"https://pith.science/api/pith-number/FM7D7UXINH3VREA2ZC2XF2WZEP/events.json","paper":"https://pith.science/paper/FM7D7UXI"},"agent_actions":{"view_html":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP","download_json":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP.json","view_paper":"https://pith.science/paper/FM7D7UXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07162&json=true","fetch_graph":"https://pith.science/api/pith-number/FM7D7UXINH3VREA2ZC2XF2WZEP/graph.json","fetch_events":"https://pith.science/api/pith-number/FM7D7UXINH3VREA2ZC2XF2WZEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP/action/storage_attestation","attest_author":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP/action/author_attestation","sign_citation":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP/action/citation_signature","submit_replication":"https://pith.science/pith/FM7D7UXINH3VREA2ZC2XF2WZEP/action/replication_record"}},"created_at":"2026-05-18T02:02:07.318504+00:00","updated_at":"2026-05-18T02:02:07.318504+00:00"}