{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4X6ZYRSQZU46GBG7UJBQIOSK4K","short_pith_number":"pith:4X6ZYRSQ","canonical_record":{"source":{"id":"1702.08581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-27T23:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"da091904138d837cf9dc170f0b3f90490d4d856d9232c4d3ff33d92738015eb6","abstract_canon_sha256":"9b7cd0bfcdba3a620d9d26dbfb1d3293e48c36d2b412e2e16432720ff09e62f9"},"schema_version":"1.0"},"canonical_sha256":"e5fd9c4650cd39e304dfa243043a4ae2970f5a878ac3e94ea2400211c1e22d17","source":{"kind":"arxiv","id":"1702.08581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08581","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08581v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08581","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"4X6ZYRSQZU46","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X6ZYRSQZU46GBG7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X6ZYRSQ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4X6ZYRSQZU46GBG7UJBQIOSK4K","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-27T23:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"da091904138d837cf9dc170f0b3f90490d4d856d9232c4d3ff33d92738015eb6","abstract_canon_sha256":"9b7cd0bfcdba3a620d9d26dbfb1d3293e48c36d2b412e2e16432720ff09e62f9"},"schema_version":"1.0"},"canonical_sha256":"e5fd9c4650cd39e304dfa243043a4ae2970f5a878ac3e94ea2400211c1e22d17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:48.326803Z","signature_b64":"t8PHcdj1d3q3/iDplTWMNcPxW/5G3yYB2vEro4c/5I1UH6+nKYUqsisFCBfe/kk3ou/I9AGmBEphnGEA1oMoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5fd9c4650cd39e304dfa243043a4ae2970f5a878ac3e94ea2400211c1e22d17","last_reissued_at":"2026-05-18T00:49:48.326225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:48.326225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08581","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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XS4fZH22PRnF0l3mBCbKcvlZI+MzL9ywXvjc6IX75tmy4QOx5RX+HXjlaf03VrqFOhbBvK0j4g/5UOWv/q9UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:56:04.043215Z"},"content_sha256":"1cf44fc991fd4eb65e8cc57ae3b74395785e752ea1443dbb7600d376257a142d","schema_version":"1.0","event_id":"sha256:1cf44fc991fd4eb65e8cc57ae3b74395785e752ea1443dbb7600d376257a142d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4X6ZYRSQZU46GBG7UJBQIOSK4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Time Algorithm for Solving #2SAT on Cactus Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"G. De Ita, H. A. Montes-Venegas, J. R. Marcial, M. A. L\\'Opez, R. Alejo","submitted_at":"2017-02-27T23:44:11Z","abstract_excerpt":"An O(n+m)-time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Formula F that represents a Cactus graph, where n is the number of variables and m is the number of clauses of F. Although, it was already known that this class of formulas could be computed in polynomial time, we compare our proposal algorithm with two state of the art implementations for the same problem, sharpSAT and countAntom. The results of the comparison show that our algorithm outperforms both implementations, and it can be considered as a base case for general counting of two Conju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08581","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-18T00:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYNtHGnpq5H9RcmiEnNEY7pO0TEspex0NjOMHNqKPE0RJ851tNnlCdVlqYgZBxv46vEk+WXIHYutGDiOY3lWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:56:04.043585Z"},"content_sha256":"6c2dfa58b05d98185d630c74d3fd18978f2790e9eb1e1538bc8bbf4914bf6999","schema_version":"1.0","event_id":"sha256:6c2dfa58b05d98185d630c74d3fd18978f2790e9eb1e1538bc8bbf4914bf6999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/bundle.json","state_url":"https://pith.science/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/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-06-26T00:56:04Z","links":{"resolver":"https://pith.science/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K","bundle":"https://pith.science/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/bundle.json","state":"https://pith.science/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4X6ZYRSQZU46GBG7UJBQIOSK4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4X6ZYRSQZU46GBG7UJBQIOSK4K","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":"9b7cd0bfcdba3a620d9d26dbfb1d3293e48c36d2b412e2e16432720ff09e62f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-27T23:44:11Z","title_canon_sha256":"da091904138d837cf9dc170f0b3f90490d4d856d9232c4d3ff33d92738015eb6"},"schema_version":"1.0","source":{"id":"1702.08581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08581","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08581v1","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08581","created_at":"2026-05-18T00:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"4X6ZYRSQZU46","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X6ZYRSQZU46GBG7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X6ZYRSQ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:6c2dfa58b05d98185d630c74d3fd18978f2790e9eb1e1538bc8bbf4914bf6999","target":"graph","created_at":"2026-05-18T00:49:48Z","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":"An O(n+m)-time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Formula F that represents a Cactus graph, where n is the number of variables and m is the number of clauses of F. Although, it was already known that this class of formulas could be computed in polynomial time, we compare our proposal algorithm with two state of the art implementations for the same problem, sharpSAT and countAntom. The results of the comparison show that our algorithm outperforms both implementations, and it can be considered as a base case for general counting of two Conju","authors_text":"G. De Ita, H. A. Montes-Venegas, J. R. Marcial, M. A. L\\'Opez, R. Alejo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-27T23:44:11Z","title":"A Linear Time Algorithm for Solving #2SAT on Cactus Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08581","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:1cf44fc991fd4eb65e8cc57ae3b74395785e752ea1443dbb7600d376257a142d","target":"record","created_at":"2026-05-18T00:49:48Z","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":"9b7cd0bfcdba3a620d9d26dbfb1d3293e48c36d2b412e2e16432720ff09e62f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-27T23:44:11Z","title_canon_sha256":"da091904138d837cf9dc170f0b3f90490d4d856d9232c4d3ff33d92738015eb6"},"schema_version":"1.0","source":{"id":"1702.08581","kind":"arxiv","version":1}},"canonical_sha256":"e5fd9c4650cd39e304dfa243043a4ae2970f5a878ac3e94ea2400211c1e22d17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5fd9c4650cd39e304dfa243043a4ae2970f5a878ac3e94ea2400211c1e22d17","first_computed_at":"2026-05-18T00:49:48.326225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:48.326225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t8PHcdj1d3q3/iDplTWMNcPxW/5G3yYB2vEro4c/5I1UH6+nKYUqsisFCBfe/kk3ou/I9AGmBEphnGEA1oMoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:48.326803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cf44fc991fd4eb65e8cc57ae3b74395785e752ea1443dbb7600d376257a142d","sha256:6c2dfa58b05d98185d630c74d3fd18978f2790e9eb1e1538bc8bbf4914bf6999"],"state_sha256":"f5fe260f3c3ebd59f83983b5891bde68277fbb35e3d9a2ec3722e5848662c41e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiiY7HssZmr1EstUOZmrPxSP/Ut4Y55XUL4Nqk/W1fUrB3zql/9/xZaYUizwkEr+TUFjv66k5w5lnV33T/mwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:56:04.045506Z","bundle_sha256":"fd29f3790dd73cb1471e67400adc1d85a85c77bc30064146f1ad75ac0642ae6f"}}