{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2QXCSRNLT7X5NC5SPUGYTS2R5B","short_pith_number":"pith:2QXCSRNL","schema_version":"1.0","canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","source":{"kind":"arxiv","id":"1604.08936","version":1},"attestation_state":"computed","paper":{"title":"Complexity Hierarchies and Higher-Order Cons-Free Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cynthia Kop, Jakob Grue Simonsen","submitted_at":"2016-04-29T19:06:07Z","abstract_excerpt":"Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data structures. It is well-known that cons-free programming languages can be used to characterize computational complexity classes, and that cons-free first-order term rewriting can be used to characterize the set of polynomial-time decidable sets.\n  We investigate cons-free higher-order term rewriting systems, the complexity classes they characterize, and how t"},"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":"1604.08936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-29T19:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"42257fc11dbefa7ddc2cf2d7413208a5f2dd3bc4402fbbfb4fc0c2e22ec59564","abstract_canon_sha256":"3f9f36f56f73355d8fce1fae20d56eb6407e08f0b33db6681bd5cb764f8d3a5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:01.368791Z","signature_b64":"bNlpNpSXsCiqL6d78sK/IHQ5PsVlqEgub20vkH1fakqxw2HcZej06kDJB8LMGlkWKI2o2vOpEXt8EONFQZbuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","last_reissued_at":"2026-05-18T01:16:01.368114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:01.368114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Hierarchies and Higher-Order Cons-Free Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Cynthia Kop, Jakob Grue Simonsen","submitted_at":"2016-04-29T19:06:07Z","abstract_excerpt":"Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data structures. It is well-known that cons-free programming languages can be used to characterize computational complexity classes, and that cons-free first-order term rewriting can be used to characterize the set of polynomial-time decidable sets.\n  We investigate cons-free higher-order term rewriting systems, the complexity classes they characterize, and how t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08936","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":"1604.08936","created_at":"2026-05-18T01:16:01.368220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08936v1","created_at":"2026-05-18T01:16:01.368220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08936","created_at":"2026-05-18T01:16:01.368220+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QXCSRNLT7X5","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QXCSRNLT7X5NC5S","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QXCSRNL","created_at":"2026-05-18T12:29:55.572404+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/2QXCSRNLT7X5NC5SPUGYTS2R5B","json":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B.json","graph_json":"https://pith.science/api/pith-number/2QXCSRNLT7X5NC5SPUGYTS2R5B/graph.json","events_json":"https://pith.science/api/pith-number/2QXCSRNLT7X5NC5SPUGYTS2R5B/events.json","paper":"https://pith.science/paper/2QXCSRNL"},"agent_actions":{"view_html":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B","download_json":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B.json","view_paper":"https://pith.science/paper/2QXCSRNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08936&json=true","fetch_graph":"https://pith.science/api/pith-number/2QXCSRNLT7X5NC5SPUGYTS2R5B/graph.json","fetch_events":"https://pith.science/api/pith-number/2QXCSRNLT7X5NC5SPUGYTS2R5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/action/storage_attestation","attest_author":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/action/author_attestation","sign_citation":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/action/citation_signature","submit_replication":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/action/replication_record"}},"created_at":"2026-05-18T01:16:01.368220+00:00","updated_at":"2026-05-18T01:16:01.368220+00:00"}