{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2QXCSRNLT7X5NC5SPUGYTS2R5B","short_pith_number":"pith:2QXCSRNL","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"},"canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","source":{"kind":"arxiv","id":"1604.08936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08936","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08936v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08936","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"2QXCSRNLT7X5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QXCSRNLT7X5NC5S","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QXCSRNL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2QXCSRNLT7X5NC5SPUGYTS2R5B","target":"record","payload":{"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"},"canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","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"},"source_kind":"arxiv","source_id":"1604.08936","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C85eQdj3A628pNrRzZ425Qsm1TKhE1eqo5rx8oFtIPgd4LORhAQgzQTa3IvpWQr8WGYm9ngXKfP1aW3sL020Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T00:50:39.052375Z"},"content_sha256":"f0e3d2ada1c54719162a9c1ed8d46892294a6e59bf4dbd6d25a1410edd3d5fa5","schema_version":"1.0","event_id":"sha256:f0e3d2ada1c54719162a9c1ed8d46892294a6e59bf4dbd6d25a1410edd3d5fa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2QXCSRNLT7X5NC5SPUGYTS2R5B","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kGbjO7/iLpCMJaZ4Mg+INKf+feYm3ytPOsICKqV0YTh6x2UHEU+e30onrKu9tbDLIydeYrVf/GK8kSvjaKOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T00:50:39.053067Z"},"content_sha256":"735b7fb7f7d20e6484b2f30041626094b9a36b6a3297daa02767c51933146a4b","schema_version":"1.0","event_id":"sha256:735b7fb7f7d20e6484b2f30041626094b9a36b6a3297daa02767c51933146a4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/bundle.json","state_url":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T00:50:39Z","links":{"resolver":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B","bundle":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/bundle.json","state":"https://pith.science/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QXCSRNLT7X5NC5SPUGYTS2R5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2QXCSRNLT7X5NC5SPUGYTS2R5B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3f9f36f56f73355d8fce1fae20d56eb6407e08f0b33db6681bd5cb764f8d3a5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-29T19:06:07Z","title_canon_sha256":"42257fc11dbefa7ddc2cf2d7413208a5f2dd3bc4402fbbfb4fc0c2e22ec59564"},"schema_version":"1.0","source":{"id":"1604.08936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08936","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08936v1","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08936","created_at":"2026-05-18T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"2QXCSRNLT7X5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QXCSRNLT7X5NC5S","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QXCSRNL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:735b7fb7f7d20e6484b2f30041626094b9a36b6a3297daa02767c51933146a4b","target":"graph","created_at":"2026-05-18T01:16:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cynthia Kop, Jakob Grue Simonsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-29T19:06:07Z","title":"Complexity Hierarchies and Higher-Order Cons-Free Rewriting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08936","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f0e3d2ada1c54719162a9c1ed8d46892294a6e59bf4dbd6d25a1410edd3d5fa5","target":"record","created_at":"2026-05-18T01:16:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3f9f36f56f73355d8fce1fae20d56eb6407e08f0b33db6681bd5cb764f8d3a5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-29T19:06:07Z","title_canon_sha256":"42257fc11dbefa7ddc2cf2d7413208a5f2dd3bc4402fbbfb4fc0c2e22ec59564"},"schema_version":"1.0","source":{"id":"1604.08936","kind":"arxiv","version":1}},"canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42e2945ab9fefd68bb27d0d89cb51e8468839d6ad2cd2ac2dba19a81f868c7b","first_computed_at":"2026-05-18T01:16:01.368114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:01.368114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bNlpNpSXsCiqL6d78sK/IHQ5PsVlqEgub20vkH1fakqxw2HcZej06kDJB8LMGlkWKI2o2vOpEXt8EONFQZbuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:01.368791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0e3d2ada1c54719162a9c1ed8d46892294a6e59bf4dbd6d25a1410edd3d5fa5","sha256:735b7fb7f7d20e6484b2f30041626094b9a36b6a3297daa02767c51933146a4b"],"state_sha256":"02fc3a5d06f9e2c87e4e4f259ddfdb42603906dff5a1bba12ea03ade1c974cd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luDMY9YdJIaXxVyPjqYkfinifm1QWZn2+IGZZyfLGBgibWHwuiyHnOtbg2OyKH+WtAEic4zPa6XbvHdoVeXTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T00:50:39.056977Z","bundle_sha256":"0c5905e0764128e1500549d5c9b6745ade717ed910c167b9f42239df82ad747f"}}