{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E3CZO3SWSB43MBR43KK24MSGYB","short_pith_number":"pith:E3CZO3SW","schema_version":"1.0","canonical_sha256":"26c5976e569079b6063cda95ae3246c059a77d1c46060b5b4888718f1a18bfa5","source":{"kind":"arxiv","id":"1901.04893","version":1},"attestation_state":"computed","paper":{"title":"Optimal Satisfiability Checking for Arithmetic $\\mu$-Calculi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Hausmann, Lutz Schr\\\"oder","submitted_at":"2019-01-15T15:59:38Z","abstract_excerpt":"The coalgebraic $\\mu$-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\\mu$-calculus includes an exponential time upper bound on satisfiability checking, which however requires a well-behaved set of tableau rules for the next-step modalities. Such rules are not available in all cases of interest, in particular ones involving either integer weights as in the graded $\\mu$-calculus, or real-valued weights in combination with non-linear arithme"},"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":"1901.04893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-15T15:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"c849677d5d725fadc3de5701d31f9ffe862354b8b6222648e68c35426115d072","abstract_canon_sha256":"1c1ecd054afd3ea272640b8a84413489cbdfcdcbbc31cbb32f73106a2ca22b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.394073Z","signature_b64":"rIHmmbBBGE6kdjo3pwMMTDGAr8ZNA4eGHk/Nmj2ONRMQM3SgMmKkRIx82vU688H48UcWiKhlGVn2+KqvbU7PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c5976e569079b6063cda95ae3246c059a77d1c46060b5b4888718f1a18bfa5","last_reissued_at":"2026-05-17T23:56:21.393522Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.393522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Satisfiability Checking for Arithmetic $\\mu$-Calculi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Hausmann, Lutz Schr\\\"oder","submitted_at":"2019-01-15T15:59:38Z","abstract_excerpt":"The coalgebraic $\\mu$-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\\mu$-calculus includes an exponential time upper bound on satisfiability checking, which however requires a well-behaved set of tableau rules for the next-step modalities. Such rules are not available in all cases of interest, in particular ones involving either integer weights as in the graded $\\mu$-calculus, or real-valued weights in combination with non-linear arithme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04893","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":"1901.04893","created_at":"2026-05-17T23:56:21.393621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04893v1","created_at":"2026-05-17T23:56:21.393621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04893","created_at":"2026-05-17T23:56:21.393621+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3CZO3SWSB43","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3CZO3SWSB43MBR4","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3CZO3SW","created_at":"2026-05-18T12:33:15.570797+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/E3CZO3SWSB43MBR43KK24MSGYB","json":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB.json","graph_json":"https://pith.science/api/pith-number/E3CZO3SWSB43MBR43KK24MSGYB/graph.json","events_json":"https://pith.science/api/pith-number/E3CZO3SWSB43MBR43KK24MSGYB/events.json","paper":"https://pith.science/paper/E3CZO3SW"},"agent_actions":{"view_html":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB","download_json":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB.json","view_paper":"https://pith.science/paper/E3CZO3SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04893&json=true","fetch_graph":"https://pith.science/api/pith-number/E3CZO3SWSB43MBR43KK24MSGYB/graph.json","fetch_events":"https://pith.science/api/pith-number/E3CZO3SWSB43MBR43KK24MSGYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB/action/storage_attestation","attest_author":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB/action/author_attestation","sign_citation":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB/action/citation_signature","submit_replication":"https://pith.science/pith/E3CZO3SWSB43MBR43KK24MSGYB/action/replication_record"}},"created_at":"2026-05-17T23:56:21.393621+00:00","updated_at":"2026-05-17T23:56:21.393621+00:00"}