{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ONK65CRGDKWWIMYWPFGK3EJ7VL","short_pith_number":"pith:ONK65CRG","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"},"canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","source":{"kind":"arxiv","id":"1701.05303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05303","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05303v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05303","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"ONK65CRGDKWW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONK65CRGDKWWIMYW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONK65CRG","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ONK65CRGDKWWIMYWPFGK3EJ7VL","target":"record","payload":{"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"},"canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","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"},"source_kind":"arxiv","source_id":"1701.05303","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zkh2kYnVIE9iJsDB05RZtO9IxB50jbbwjkQP4GW3elLV6+eyS/HjA3fU8XIHOOuWfK+7preS0hpyNJ+HJTODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:31:33.605867Z"},"content_sha256":"125a98317ea607ce76f06f6ebbb15b92f8a6fb6f21d0ba518a68f57cc006672d","schema_version":"1.0","event_id":"sha256:125a98317ea607ce76f06f6ebbb15b92f8a6fb6f21d0ba518a68f57cc006672d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ONK65CRGDKWWIMYWPFGK3EJ7VL","target":"graph","payload":{"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"},"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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Of6Cq6VoYBIu+BcoIY5yiUcoGUmBAF8DXK5Z+yoyypnHEaYSt8Mwt0aaKaiasP5sQh1NoVcqVHXRLVC/Aig/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:31:33.606207Z"},"content_sha256":"9a99497db1b25d93d41ba9ac6635ee057f1db0c746e9275f94c2d34d4a2dee6e","schema_version":"1.0","event_id":"sha256:9a99497db1b25d93d41ba9ac6635ee057f1db0c746e9275f94c2d34d4a2dee6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/bundle.json","state_url":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/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-28T00:31:33Z","links":{"resolver":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL","bundle":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/bundle.json","state":"https://pith.science/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONK65CRGDKWWIMYWPFGK3EJ7VL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ONK65CRGDKWWIMYWPFGK3EJ7VL","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":"d837de15870130139d074784a234eda7efecf1bc6f9350fcbb900191ef0dec4b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-19T05:33:29Z","title_canon_sha256":"169fee4c0872d5fedb69dae2a56c24420d85892206135aebfe9fe367d001b618"},"schema_version":"1.0","source":{"id":"1701.05303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05303","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05303v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05303","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"ONK65CRGDKWW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONK65CRGDKWWIMYW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONK65CRG","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:9a99497db1b25d93d41ba9ac6635ee057f1db0c746e9275f94c2d34d4a2dee6e","target":"graph","created_at":"2026-05-18T00:52:30Z","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":"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 ","authors_text":"Pawe{\\l} Parys","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-19T05:33:29Z","title":"Intersection Types and Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05303","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:125a98317ea607ce76f06f6ebbb15b92f8a6fb6f21d0ba518a68f57cc006672d","target":"record","created_at":"2026-05-18T00:52:30Z","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":"d837de15870130139d074784a234eda7efecf1bc6f9350fcbb900191ef0dec4b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-19T05:33:29Z","title_canon_sha256":"169fee4c0872d5fedb69dae2a56c24420d85892206135aebfe9fe367d001b618"},"schema_version":"1.0","source":{"id":"1701.05303","kind":"arxiv","version":1}},"canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7355ee8a261aad643316794cad913faad1e1dc08c087b13604005f519fdcedad","first_computed_at":"2026-05-18T00:52:30.301332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.301332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyVmF8sBg7lduC1rhLmd/ZbF/Qa7b7pTM25pDtNSVAV+wdxnu9QqlxC9FMErnE9RcmWyaAkEyVQfSf0kA+ErBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.301776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:125a98317ea607ce76f06f6ebbb15b92f8a6fb6f21d0ba518a68f57cc006672d","sha256:9a99497db1b25d93d41ba9ac6635ee057f1db0c746e9275f94c2d34d4a2dee6e"],"state_sha256":"932c3ccb7661ddb7d28922f8467e8b19a138c223e17d175b4b14689dc6c7eb99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiN6iyYIbaysXY6VGU3+pCn2PsHJr08HC9TX19oaruvJNtrGYvBWncYr+EXmZF1ECIUA7CoIkFHUotBY9uCLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:31:33.608087Z","bundle_sha256":"df407d1352d1395ecc9fe839c5b167ed33e680b309ec1ea434932d15f7c2e61f"}}