{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ONK65CRGDKWWIMYWPFGK3EJ7VL","short_pith_number":"pith:ONK65CRG","schema_version":"1.0","canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","source":{"kind":"arxiv","id":"1701.05303","version":1},"attestation_state":"computed","paper":{"title":"Intersection Types and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pawe{\\l} Parys","submitted_at":"2017-01-19T05:33:29Z","abstract_excerpt":"We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\\lambda$-term corresponds to some property of a derivation of a type for this $\\lambda$-term, in this type system.\n  Our approach is presented in the particular case of the language finiteness problem for nondeterministic higher-order recursion schemes (HORSes): given a nondeterministic HORS, decide whether the set of all finite trees generated by this HORS is finite. We give a type system such that "},"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":"1701.05303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-19T05:33:29Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"169fee4c0872d5fedb69dae2a56c24420d85892206135aebfe9fe367d001b618","abstract_canon_sha256":"d837de15870130139d074784a234eda7efecf1bc6f9350fcbb900191ef0dec4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.301776Z","signature_b64":"XyVmF8sBg7lduC1rhLmd/ZbF/Qa7b7pTM25pDtNSVAV+wdxnu9QqlxC9FMErnE9RcmWyaAkEyVQfSf0kA+ErBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","last_reissued_at":"2026-05-18T00:52:30.301332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.301332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersection Types and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Pawe{\\l} Parys","submitted_at":"2017-01-19T05:33:29Z","abstract_excerpt":"We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\\lambda$-term corresponds to some property of a derivation of a type for this $\\lambda$-term, in this type system.\n  Our approach is presented in the particular case of the language finiteness problem for nondeterministic higher-order recursion schemes (HORSes): given a nondeterministic HORS, decide whether the set of all finite trees generated by this HORS is finite. We give a type system such that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05303","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":"1701.05303","created_at":"2026-05-18T00:52:30.301400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05303v1","created_at":"2026-05-18T00:52:30.301400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05303","created_at":"2026-05-18T00:52:30.301400+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONK65CRGDKWW","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONK65CRGDKWWIMYW","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONK65CRG","created_at":"2026-05-18T12:31:34.259226+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/ONK65CRGDKWWIMYWPFGK3EJ7VL","json":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL.json","graph_json":"https://pith.science/api/pith-number/ONK65CRGDKWWIMYWPFGK3EJ7VL/graph.json","events_json":"https://pith.science/api/pith-number/ONK65CRGDKWWIMYWPFGK3EJ7VL/events.json","paper":"https://pith.science/paper/ONK65CRG"},"agent_actions":{"view_html":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL","download_json":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL.json","view_paper":"https://pith.science/paper/ONK65CRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05303&json=true","fetch_graph":"https://pith.science/api/pith-number/ONK65CRGDKWWIMYWPFGK3EJ7VL/graph.json","fetch_events":"https://pith.science/api/pith-number/ONK65CRGDKWWIMYWPFGK3EJ7VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/action/storage_attestation","attest_author":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/action/author_attestation","sign_citation":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/action/citation_signature","submit_replication":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/action/replication_record"}},"created_at":"2026-05-18T00:52:30.301400+00:00","updated_at":"2026-05-18T00:52:30.301400+00:00"}