{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2LERLJBFKC5WV7GNFSZB4PVMKJ","short_pith_number":"pith:2LERLJBF","schema_version":"1.0","canonical_sha256":"d2c915a42550bb6afccd2cb21e3eac526a7903be7d6a81ddd75d84361e1f647a","source":{"kind":"arxiv","id":"1501.00894","version":1},"attestation_state":"computed","paper":{"title":"On Sharing, Memoization, and Polynomial Time (Long Version)","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Martin Avanzini, Ugo Dal Lago","submitted_at":"2015-01-05T15:34:07Z","abstract_excerpt":"We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity."},"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":"1501.00894","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-01-05T15:34:07Z","cross_cats_sorted":[],"title_canon_sha256":"e5f6a6355a1130785a3f4796d936aecd956cbf4f6e140cd0622aface31a877dc","abstract_canon_sha256":"4050b934e1656fff846973f5a3a37018fb64551d4a575473d9e81728099c7193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.640523Z","signature_b64":"26oewXT8AqqOYrPl3/7BT5tnE/vcK/Cw28s0MW2b5G4kvEDOdiQgsQnSYP/Aw6+OeRn0l8sEEsN7yJcDoMScBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c915a42550bb6afccd2cb21e3eac526a7903be7d6a81ddd75d84361e1f647a","last_reissued_at":"2026-05-18T02:30:01.640153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.640153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sharing, Memoization, and Polynomial Time (Long Version)","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Martin Avanzini, Ugo Dal Lago","submitted_at":"2015-01-05T15:34:07Z","abstract_excerpt":"We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00894","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":"1501.00894","created_at":"2026-05-18T02:30:01.640212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00894v1","created_at":"2026-05-18T02:30:01.640212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00894","created_at":"2026-05-18T02:30:01.640212+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LERLJBFKC5W","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LERLJBFKC5WV7GN","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LERLJBF","created_at":"2026-05-18T12:29:02.477457+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/2LERLJBFKC5WV7GNFSZB4PVMKJ","json":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ.json","graph_json":"https://pith.science/api/pith-number/2LERLJBFKC5WV7GNFSZB4PVMKJ/graph.json","events_json":"https://pith.science/api/pith-number/2LERLJBFKC5WV7GNFSZB4PVMKJ/events.json","paper":"https://pith.science/paper/2LERLJBF"},"agent_actions":{"view_html":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ","download_json":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ.json","view_paper":"https://pith.science/paper/2LERLJBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00894&json=true","fetch_graph":"https://pith.science/api/pith-number/2LERLJBFKC5WV7GNFSZB4PVMKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2LERLJBFKC5WV7GNFSZB4PVMKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ/action/storage_attestation","attest_author":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ/action/author_attestation","sign_citation":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ/action/citation_signature","submit_replication":"https://pith.science/pith/2LERLJBFKC5WV7GNFSZB4PVMKJ/action/replication_record"}},"created_at":"2026-05-18T02:30:01.640212+00:00","updated_at":"2026-05-18T02:30:01.640212+00:00"}