{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RSF6GMEOKIMGG23PZWBWELZNMK","short_pith_number":"pith:RSF6GMEO","schema_version":"1.0","canonical_sha256":"8c8be3308e5218636b6fcd83622f2d629e9915a9c42661006309da1b60f3c81d","source":{"kind":"arxiv","id":"1802.03115","version":1},"attestation_state":"computed","paper":{"title":"Implicit complexity via structure transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Leivant, Jean-Yves Marion","submitted_at":"2018-02-09T03:39:58Z","abstract_excerpt":"Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on descriptive tools for finite structures.\n  We consider here \"uninterpreted\" programs for the transformation of finite structures, which define functions over a free algebra A once the elements of A are themselves considered as finite structures. We thus bridge the gap between the two approaches above to implicit complexity, with the potential of streamlinin"},"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":"1802.03115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-09T03:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"9f3205dd483b0a5eaf60fc2bd4d0952a743feae69d54b5b45097de5f9dac320d","abstract_canon_sha256":"7f5fc8d358756d889867028c93564effac8b88d46d8fb44dc21576efc5b2bcd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:01.998496Z","signature_b64":"qmA7w7DHsJbwKYJ5C0TkGZM4qRiMTR1lNuBWIB/yYiqMkIS3k0ES4x4piVkY85StaBcidpQ4CwRjHZPupVmuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8be3308e5218636b6fcd83622f2d629e9915a9c42661006309da1b60f3c81d","last_reissued_at":"2026-05-18T00:24:01.998021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:01.998021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implicit complexity via structure transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Leivant, Jean-Yves Marion","submitted_at":"2018-02-09T03:39:58Z","abstract_excerpt":"Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on descriptive tools for finite structures.\n  We consider here \"uninterpreted\" programs for the transformation of finite structures, which define functions over a free algebra A once the elements of A are themselves considered as finite structures. We thus bridge the gap between the two approaches above to implicit complexity, with the potential of streamlinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03115","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":"1802.03115","created_at":"2026-05-18T00:24:01.998096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03115v1","created_at":"2026-05-18T00:24:01.998096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03115","created_at":"2026-05-18T00:24:01.998096+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSF6GMEOKIMG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSF6GMEOKIMGG23P","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSF6GMEO","created_at":"2026-05-18T12:32:50.500415+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/RSF6GMEOKIMGG23PZWBWELZNMK","json":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK.json","graph_json":"https://pith.science/api/pith-number/RSF6GMEOKIMGG23PZWBWELZNMK/graph.json","events_json":"https://pith.science/api/pith-number/RSF6GMEOKIMGG23PZWBWELZNMK/events.json","paper":"https://pith.science/paper/RSF6GMEO"},"agent_actions":{"view_html":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK","download_json":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK.json","view_paper":"https://pith.science/paper/RSF6GMEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03115&json=true","fetch_graph":"https://pith.science/api/pith-number/RSF6GMEOKIMGG23PZWBWELZNMK/graph.json","fetch_events":"https://pith.science/api/pith-number/RSF6GMEOKIMGG23PZWBWELZNMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK/action/storage_attestation","attest_author":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK/action/author_attestation","sign_citation":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK/action/citation_signature","submit_replication":"https://pith.science/pith/RSF6GMEOKIMGG23PZWBWELZNMK/action/replication_record"}},"created_at":"2026-05-18T00:24:01.998096+00:00","updated_at":"2026-05-18T00:24:01.998096+00:00"}