{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MXHXI2QNRFRWTVQEHZHZHAHPMZ","short_pith_number":"pith:MXHXI2QN","canonical_record":{"source":{"id":"1311.1602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-07T08:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"f1ee68cba8c4f66e0aa93cd794d687c9c036cda6fda9d680ac49634dbdb04570","abstract_canon_sha256":"eeffc04734363f8c35ff1d3d8b9fe46297e946fe0f33ac77c4e2144245e2b080"},"schema_version":"1.0"},"canonical_sha256":"65cf746a0d896369d6043e4f9380ef66755ac39e8be22a87eae27a22f3404345","source":{"kind":"arxiv","id":"1311.1602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1602","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1602v1","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1602","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"pith_short_12","alias_value":"MXHXI2QNRFRW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MXHXI2QNRFRWTVQE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MXHXI2QN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MXHXI2QNRFRWTVQEHZHZHAHPMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-07T08:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"f1ee68cba8c4f66e0aa93cd794d687c9c036cda6fda9d680ac49634dbdb04570","abstract_canon_sha256":"eeffc04734363f8c35ff1d3d8b9fe46297e946fe0f33ac77c4e2144245e2b080"},"schema_version":"1.0"},"canonical_sha256":"65cf746a0d896369d6043e4f9380ef66755ac39e8be22a87eae27a22f3404345","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:43.781389Z","signature_b64":"qtGjLm5HOY52IokMhuSMePmPM+0/wzP5ENBmSKmnm3YfQ5XR/EuDZA9UT/N2KCk3sQnkEVjqrCYtMptFlDAZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65cf746a0d896369d6043e4f9380ef66755ac39e8be22a87eae27a22f3404345","last_reissued_at":"2026-05-18T03:07:43.780900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:43.780900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1602","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-18T03:07:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rw+GZJP6OCGy71J6KvmomaD2UIGOAkMAAtKemVwj8zYXYeeAovTG08Kb7KG8+p25jkbTTQdQjelhRl5N88VCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:12:11.252137Z"},"content_sha256":"78de299a5ce539295650a1ec22e089546a7cf144917a1d2f743511890b7134e6","schema_version":"1.0","event_id":"sha256:78de299a5ce539295650a1ec22e089546a7cf144917a1d2f743511890b7134e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MXHXI2QNRFRWTVQEHZHZHAHPMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polsat: A Portfolio LTL Satisfiability Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Geguang Pu, Jianwen Li, Jifeng He, Lijun Zhang, Moshe Y. Vardi, Yinbo Yao","submitted_at":"2013-11-07T08:31:05Z","abstract_excerpt":"In this paper we present a portfolio LTL-satisfiability solver, called Polsat. To achieve fast satisfiability checking for LTL formulas, the tool integrates four representative LTL solvers: pltl, TRP++, NuSMV, and Aalta. The idea of Polsat is to run the component solvers in parallel to get best overall performance; once one of the solvers terminates, it stops all other solvers. Remarkably, the Polsat solver utilizes the power of modern multi-core compute clusters. The empirical experiments show that Polsat takes advantages of it. Further, Polsat is also a testing plat- form for all LTL solvers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1602","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-18T03:07:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpCbpor6LwONcJzNcY9CU1yTUxj2SofbpgU5rDd8hi2GqCu3G6Ot98T/qVWsm8rv4pOUPJTjP7gXS9Esz7VgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:12:11.252787Z"},"content_sha256":"4a4c23b3f4fcef52556350909f42cc3fc8ca8e894de0bf9fa4f5f262cb26a476","schema_version":"1.0","event_id":"sha256:4a4c23b3f4fcef52556350909f42cc3fc8ca8e894de0bf9fa4f5f262cb26a476"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/bundle.json","state_url":"https://pith.science/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/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-27T09:12:11Z","links":{"resolver":"https://pith.science/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ","bundle":"https://pith.science/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/bundle.json","state":"https://pith.science/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXHXI2QNRFRWTVQEHZHZHAHPMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MXHXI2QNRFRWTVQEHZHZHAHPMZ","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":"eeffc04734363f8c35ff1d3d8b9fe46297e946fe0f33ac77c4e2144245e2b080","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-07T08:31:05Z","title_canon_sha256":"f1ee68cba8c4f66e0aa93cd794d687c9c036cda6fda9d680ac49634dbdb04570"},"schema_version":"1.0","source":{"id":"1311.1602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1602","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1602v1","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1602","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"pith_short_12","alias_value":"MXHXI2QNRFRW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MXHXI2QNRFRWTVQE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MXHXI2QN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:4a4c23b3f4fcef52556350909f42cc3fc8ca8e894de0bf9fa4f5f262cb26a476","target":"graph","created_at":"2026-05-18T03:07:43Z","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":"In this paper we present a portfolio LTL-satisfiability solver, called Polsat. To achieve fast satisfiability checking for LTL formulas, the tool integrates four representative LTL solvers: pltl, TRP++, NuSMV, and Aalta. The idea of Polsat is to run the component solvers in parallel to get best overall performance; once one of the solvers terminates, it stops all other solvers. Remarkably, the Polsat solver utilizes the power of modern multi-core compute clusters. The empirical experiments show that Polsat takes advantages of it. Further, Polsat is also a testing plat- form for all LTL solvers","authors_text":"Geguang Pu, Jianwen Li, Jifeng He, Lijun Zhang, Moshe Y. Vardi, Yinbo Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-07T08:31:05Z","title":"Polsat: A Portfolio LTL Satisfiability Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1602","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:78de299a5ce539295650a1ec22e089546a7cf144917a1d2f743511890b7134e6","target":"record","created_at":"2026-05-18T03:07:43Z","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":"eeffc04734363f8c35ff1d3d8b9fe46297e946fe0f33ac77c4e2144245e2b080","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-07T08:31:05Z","title_canon_sha256":"f1ee68cba8c4f66e0aa93cd794d687c9c036cda6fda9d680ac49634dbdb04570"},"schema_version":"1.0","source":{"id":"1311.1602","kind":"arxiv","version":1}},"canonical_sha256":"65cf746a0d896369d6043e4f9380ef66755ac39e8be22a87eae27a22f3404345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65cf746a0d896369d6043e4f9380ef66755ac39e8be22a87eae27a22f3404345","first_computed_at":"2026-05-18T03:07:43.780900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:43.780900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtGjLm5HOY52IokMhuSMePmPM+0/wzP5ENBmSKmnm3YfQ5XR/EuDZA9UT/N2KCk3sQnkEVjqrCYtMptFlDAZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:43.781389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78de299a5ce539295650a1ec22e089546a7cf144917a1d2f743511890b7134e6","sha256:4a4c23b3f4fcef52556350909f42cc3fc8ca8e894de0bf9fa4f5f262cb26a476"],"state_sha256":"45cc610602e6090570c9e5b8578042bae7139cb547b164a39c5f63fe6a599a2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5/NxipF1amJqlhBo+5SJQ+n3slGU2ZoJkf2mUYuvcYb0x0nk8R9Ecf3iouxV0mSV5L/tIW0lIMDjeVIERJ0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:12:11.256625Z","bundle_sha256":"a92f6c166835d50743bcf1e04a2163404bea4991d9b203c1558b847da604617d"}}