{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MYVCEZQQPCW75FPM7ZZGPPMLMO","short_pith_number":"pith:MYVCEZQQ","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"},"canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","source":{"kind":"arxiv","id":"1505.06617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06617","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06617v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06617","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"MYVCEZQQPCW7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYVCEZQQPCW75FPM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYVCEZQQ","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MYVCEZQQPCW75FPM7ZZGPPMLMO","target":"record","payload":{"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"},"canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","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"},"source_kind":"arxiv","source_id":"1505.06617","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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iD4vWGdpmMyeS531AQAaYwtjXweUzPJLFsDOOgWPZ6Jizhd7DUfDs/jRQW/Rc+SKEaEQ69J6CBJUSF8R/znPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:42:49.639061Z"},"content_sha256":"4f55401d320db531021e42ee500c1a42c2d6bda62f248d86538b685bac854dbd","schema_version":"1.0","event_id":"sha256:4f55401d320db531021e42ee500c1a42c2d6bda62f248d86538b685bac854dbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MYVCEZQQPCW75FPM7ZZGPPMLMO","target":"graph","payload":{"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"},"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pM2JhwmP1NWMQYJuKoXOTJwqeIc/3nsGDNo27HkCG5LsrJw4Bye1TY64GIQKBLK+87Kegp33YUd7D4H7tIcYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:42:49.639422Z"},"content_sha256":"bd0e74216b7020f5efe3657ac61de691e4488f4c07d75c2770cc5ce020c9bdb3","schema_version":"1.0","event_id":"sha256:bd0e74216b7020f5efe3657ac61de691e4488f4c07d75c2770cc5ce020c9bdb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/bundle.json","state_url":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/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-12T01:42:49Z","links":{"resolver":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO","bundle":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/bundle.json","state":"https://pith.science/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYVCEZQQPCW75FPM7ZZGPPMLMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MYVCEZQQPCW75FPM7ZZGPPMLMO","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":"a7cf07fcd950d794a206a7805869965c2f8832aa53cf5df708294baea4298780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-25T13:13:25Z","title_canon_sha256":"33a69bf5f48e8306649ab8a75a27c2fc427938bb220a18d27178bb60eaab2497"},"schema_version":"1.0","source":{"id":"1505.06617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06617","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06617v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06617","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"MYVCEZQQPCW7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYVCEZQQPCW75FPM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYVCEZQQ","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:bd0e74216b7020f5efe3657ac61de691e4488f4c07d75c2770cc5ce020c9bdb3","target":"graph","created_at":"2026-05-18T02:03:44Z","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":"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","authors_text":"Johann A. Makowsky, Tomer Kotek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-25T13:13:25Z","title":"Efficient computation of generalized Ising polynomials on graphs with fixed clique-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06617","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:4f55401d320db531021e42ee500c1a42c2d6bda62f248d86538b685bac854dbd","target":"record","created_at":"2026-05-18T02:03:44Z","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":"a7cf07fcd950d794a206a7805869965c2f8832aa53cf5df708294baea4298780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-25T13:13:25Z","title_canon_sha256":"33a69bf5f48e8306649ab8a75a27c2fc427938bb220a18d27178bb60eaab2497"},"schema_version":"1.0","source":{"id":"1505.06617","kind":"arxiv","version":1}},"canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"662a22661078adfe95ecfe7267bd8b6398fcdaa359cd0ca2707ed2843084b97a","first_computed_at":"2026-05-18T02:03:44.477671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:44.477671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paKbJkgMFLgxaRAbjcTcwHSS59kXUGWLMeegKodWtpP5CkXnhjflpLVvbKjVs7LtkczV1SdodA0NkynWT3kPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:44.478368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f55401d320db531021e42ee500c1a42c2d6bda62f248d86538b685bac854dbd","sha256:bd0e74216b7020f5efe3657ac61de691e4488f4c07d75c2770cc5ce020c9bdb3"],"state_sha256":"edad5f4d7b55dafaf62f4a00958fc243aab20bea939d3885410ef8d3ca8d57a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ocq1hRS07ZnTikXOTsIlQx16MtaGlVAUUba0PFprMzYt7SIlYVTxZV/suUtahPLHrOBzXgGMGcbqwqJA7h1EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:42:49.641345Z","bundle_sha256":"b4a62cd9f83ad01f96c4ef77db0e09a9db09a1073bffed08129192ba4c34e21c"}}