{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NS5GV5MHLHJNAH6EDR2IOFQGI2","short_pith_number":"pith:NS5GV5MH","schema_version":"1.0","canonical_sha256":"6cba6af58759d2d01fc41c74871606468cb49a78464de3c2dd5f69707d0cb653","source":{"kind":"arxiv","id":"1809.03104","version":1},"attestation_state":"computed","paper":{"title":"On Computing the Measures of First-Order Definable Sets of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Marcin Przyby{\\l}ko","submitted_at":"2018-09-10T02:34:04Z","abstract_excerpt":"We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant  relation or by a Boolean combination of conjunctive queries (with descendant relation) is rational and computable. Additionally, we provide an example of a first-order formula that uses descendant relation and defines a language of infinite trees having an irrational measure."},"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":"1809.03104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:34:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"626bc800bb85595d0e097af517968f17c2bf3eee610bfaf21874ca8ad446f0a3","abstract_canon_sha256":"2b04fd10703f2bd67ed511b3dacdcaf6ac87907b9339cad04e827f29ef8dca9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:09.998815Z","signature_b64":"RNv58uvp+Knx4BOJngGJWDjw+aM/B6bSiK7MbYDrMv29HvcKrQf5R6tAI7kn8EMnKKKifAiqbra9vhu43X7uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cba6af58759d2d01fc41c74871606468cb49a78464de3c2dd5f69707d0cb653","last_reissued_at":"2026-05-18T00:06:09.998267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:09.998267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computing the Measures of First-Order Definable Sets of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Marcin Przyby{\\l}ko","submitted_at":"2018-09-10T02:34:04Z","abstract_excerpt":"We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant  relation or by a Boolean combination of conjunctive queries (with descendant relation) is rational and computable. Additionally, we provide an example of a first-order formula that uses descendant relation and defines a language of infinite trees having an irrational measure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03104","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":"1809.03104","created_at":"2026-05-18T00:06:09.998344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03104v1","created_at":"2026-05-18T00:06:09.998344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03104","created_at":"2026-05-18T00:06:09.998344+00:00"},{"alias_kind":"pith_short_12","alias_value":"NS5GV5MHLHJN","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NS5GV5MHLHJNAH6E","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NS5GV5MH","created_at":"2026-05-18T12:32:40.477152+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/NS5GV5MHLHJNAH6EDR2IOFQGI2","json":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2.json","graph_json":"https://pith.science/api/pith-number/NS5GV5MHLHJNAH6EDR2IOFQGI2/graph.json","events_json":"https://pith.science/api/pith-number/NS5GV5MHLHJNAH6EDR2IOFQGI2/events.json","paper":"https://pith.science/paper/NS5GV5MH"},"agent_actions":{"view_html":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2","download_json":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2.json","view_paper":"https://pith.science/paper/NS5GV5MH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03104&json=true","fetch_graph":"https://pith.science/api/pith-number/NS5GV5MHLHJNAH6EDR2IOFQGI2/graph.json","fetch_events":"https://pith.science/api/pith-number/NS5GV5MHLHJNAH6EDR2IOFQGI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2/action/storage_attestation","attest_author":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2/action/author_attestation","sign_citation":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2/action/citation_signature","submit_replication":"https://pith.science/pith/NS5GV5MHLHJNAH6EDR2IOFQGI2/action/replication_record"}},"created_at":"2026-05-18T00:06:09.998344+00:00","updated_at":"2026-05-18T00:06:09.998344+00:00"}