{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MYVCEZQQPCW75FPM7ZZGPPMLMO","short_pith_number":"pith:MYVCEZQQ","schema_version":"1.0","canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","source":{"kind":"arxiv","id":"1505.06617","version":1},"attestation_state":"computed","paper":{"title":"Efficient computation of generalized Ising polynomials on graphs with fixed clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Johann A. Makowsky, Tomer Kotek","submitted_at":"2015-05-25T13:13:25Z","abstract_excerpt":"Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the vocabulary of hypergraphs are fixed-parameter tractable with respect to tree-width, but not necessarily with respect to clique width. No algorithmic meta-theorem is known for the computation of graph polynomials definable in MSOL on the vocabulary of hypergraphs with respect to clique-width. We define an infinite class of such graph polynomials extending the clas"},"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":"1505.06617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-25T13:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"33a69bf5f48e8306649ab8a75a27c2fc427938bb220a18d27178bb60eaab2497","abstract_canon_sha256":"a7cf07fcd950d794a206a7805869965c2f8832aa53cf5df708294baea4298780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.478368Z","signature_b64":"paKbJkgMFLgxaRAbjcTcwHSS59kXUGWLMeegKodWtpP5CkXnhjflpLVvbKjVs7LtkczV1SdodA0NkynWT3kPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","last_reissued_at":"2026-05-18T02:03:44.477671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.477671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computation of generalized Ising polynomials on graphs with fixed clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Johann A. Makowsky, Tomer Kotek","submitted_at":"2015-05-25T13:13:25Z","abstract_excerpt":"Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the vocabulary of hypergraphs are fixed-parameter tractable with respect to tree-width, but not necessarily with respect to clique width. No algorithmic meta-theorem is known for the computation of graph polynomials definable in MSOL on the vocabulary of hypergraphs with respect to clique-width. We define an infinite class of such graph polynomials extending the clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06617","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":"1505.06617","created_at":"2026-05-18T02:03:44.477780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06617v1","created_at":"2026-05-18T02:03:44.477780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06617","created_at":"2026-05-18T02:03:44.477780+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYVCEZQQPCW7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYVCEZQQPCW75FPM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYVCEZQQ","created_at":"2026-05-18T12:29:32.376354+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/MYVCEZQQPCW75FPM7ZZGPPMLMO","json":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO.json","graph_json":"https://pith.science/api/pith-number/MYVCEZQQPCW75FPM7ZZGPPMLMO/graph.json","events_json":"https://pith.science/api/pith-number/MYVCEZQQPCW75FPM7ZZGPPMLMO/events.json","paper":"https://pith.science/paper/MYVCEZQQ"},"agent_actions":{"view_html":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO","download_json":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO.json","view_paper":"https://pith.science/paper/MYVCEZQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06617&json=true","fetch_graph":"https://pith.science/api/pith-number/MYVCEZQQPCW75FPM7ZZGPPMLMO/graph.json","fetch_events":"https://pith.science/api/pith-number/MYVCEZQQPCW75FPM7ZZGPPMLMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/action/storage_attestation","attest_author":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/action/author_attestation","sign_citation":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/action/citation_signature","submit_replication":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/action/replication_record"}},"created_at":"2026-05-18T02:03:44.477780+00:00","updated_at":"2026-05-18T02:03:44.477780+00:00"}