{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZWTODAREMPITL646QJNE4U5ZRP","short_pith_number":"pith:ZWTODARE","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"},"canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","source":{"kind":"arxiv","id":"1504.07384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07384","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07384v1","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07384","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTODAREMPIT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTODAREMPITL646","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTODARE","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZWTODAREMPITL646QJNE4U5ZRP","target":"record","payload":{"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"},"canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","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"},"source_kind":"arxiv","source_id":"1504.07384","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-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6JYOwZSH592AUZGkU8aDm6975MfW41bb7uydNud8jzc0qjvTTDJEL0FogtnSN0ke2XSqyR3vKsWOV+QqmzhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:39:46.060436Z"},"content_sha256":"c36d472e2bb8014120f4ca9e7deb180daf0aef4be57bd71245b9abae6e76531f","schema_version":"1.0","event_id":"sha256:c36d472e2bb8014120f4ca9e7deb180daf0aef4be57bd71245b9abae6e76531f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZWTODAREMPITL646QJNE4U5ZRP","target":"graph","payload":{"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"},"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-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqsjPSrPDiZMaexRMydRosl1ENQuoWW6mUzMrMNcHNrYSNpbNhLjwd+zOcaYdeHCIj3YRzEsV7OBrKCnjzsdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:39:46.060815Z"},"content_sha256":"675cd1df9cdbf879c3ab87c97da26f36f3aefea4a355203b98649eb0e4ee104a","schema_version":"1.0","event_id":"sha256:675cd1df9cdbf879c3ab87c97da26f36f3aefea4a355203b98649eb0e4ee104a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/bundle.json","state_url":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWTODAREMPITL646QJNE4U5ZRP/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-25T12:39:46Z","links":{"resolver":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP","bundle":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/bundle.json","state":"https://pith.science/pith/ZWTODAREMPITL646QJNE4U5ZRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWTODAREMPITL646QJNE4U5ZRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZWTODAREMPITL646QJNE4U5ZRP","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":"49a1af1cf50635e46b3735f162ce88dc5f43e1f03c6c95185600b5e085609d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T08:53:53Z","title_canon_sha256":"8199da72eebebe62da9345c56bbc79f18850d27a32d717eb0203f44dedcf5027"},"schema_version":"1.0","source":{"id":"1504.07384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07384","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07384v1","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07384","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZWTODAREMPIT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWTODAREMPITL646","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWTODARE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:675cd1df9cdbf879c3ab87c97da26f36f3aefea4a355203b98649eb0e4ee104a","target":"graph","created_at":"2026-05-18T02:17:34Z","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 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","authors_text":"Andreas Pavlogiannis, Krishnendu Chatterjee, Rasmus Ibsen-Jensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T08:53:53Z","title":"Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07384","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:c36d472e2bb8014120f4ca9e7deb180daf0aef4be57bd71245b9abae6e76531f","target":"record","created_at":"2026-05-18T02:17:34Z","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":"49a1af1cf50635e46b3735f162ce88dc5f43e1f03c6c95185600b5e085609d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-28T08:53:53Z","title_canon_sha256":"8199da72eebebe62da9345c56bbc79f18850d27a32d717eb0203f44dedcf5027"},"schema_version":"1.0","source":{"id":"1504.07384","kind":"arxiv","version":1}},"canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cda6e1822463d135fb9e825a4e53b98bf08daf931472cfd23760a46e3dca1990","first_computed_at":"2026-05-18T02:17:34.895072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:34.895072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rx0+S/W1XP4rLX2VyruDOBABFoFcotl1dl+oHp3rlM7rPknwtqUJj3NK8LEjnfzMq1+CEs2NScdZJ9RNqEpDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:34.895722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c36d472e2bb8014120f4ca9e7deb180daf0aef4be57bd71245b9abae6e76531f","sha256:675cd1df9cdbf879c3ab87c97da26f36f3aefea4a355203b98649eb0e4ee104a"],"state_sha256":"33a1cfa472e13e42e1ff595fc1afca07f88a5236d1881773a31e985b3783c1ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLvM6IMpWujXX0fJaoqA/X8SEqBz3vVUoHIeKwjYow2f2TDsIsFbqVU3xQj8fd5aP9XQmExea5P6m5Bpjw+dBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:39:46.063017Z","bundle_sha256":"9cfb7ce37198cddec396ec7ccabdbf986f4087b773b3c6c5155c45dd40dc245c"}}