{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZWTODAREMPITL646QJNE4U5ZRP","short_pith_number":"pith:ZWTODARE","schema_version":"1.0","canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","source":{"kind":"arxiv","id":"1504.07384","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Pavlogiannis, Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2015-04-28T08:53:53Z","abstract_excerpt":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the num"},"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":"1504.07384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T08:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"8199da72eebebe62da9345c56bbc79f18850d27a32d717eb0203f44dedcf5027","abstract_canon_sha256":"49a1af1cf50635e46b3735f162ce88dc5f43e1f03c6c95185600b5e085609d19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.895722Z","signature_b64":"rx0+S/W1XP4rLX2VyruDOBABFoFcotl1dl+oHp3rlM7rPknwtqUJj3NK8LEjnfzMq1+CEs2NScdZJ9RNqEpDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","last_reissued_at":"2026-05-18T02:17:34.895072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.895072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Pavlogiannis, Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2015-04-28T08:53:53Z","abstract_excerpt":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let $n$ denote the number of nodes of a graph, $m$ the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07384","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":"1504.07384","created_at":"2026-05-18T02:17:34.895158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07384v1","created_at":"2026-05-18T02:17:34.895158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07384","created_at":"2026-05-18T02:17:34.895158+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWTODAREMPIT","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWTODAREMPITL646","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWTODARE","created_at":"2026-05-18T12:29:52.810259+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/ZWTODAREMPITL646QJNE4U5ZRP","json":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP.json","graph_json":"https://pith.science/api/pith-number/ZWTODAREMPITL646QJNE4U5ZRP/graph.json","events_json":"https://pith.science/api/pith-number/ZWTODAREMPITL646QJNE4U5ZRP/events.json","paper":"https://pith.science/paper/ZWTODARE"},"agent_actions":{"view_html":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP","download_json":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP.json","view_paper":"https://pith.science/paper/ZWTODARE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07384&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWTODAREMPITL646QJNE4U5ZRP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWTODAREMPITL646QJNE4U5ZRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/action/storage_attestation","attest_author":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/action/author_attestation","sign_citation":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/action/citation_signature","submit_replication":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/action/replication_record"}},"created_at":"2026-05-18T02:17:34.895158+00:00","updated_at":"2026-05-18T02:17:34.895158+00:00"}