{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:25FCGMZHVTD37YJLG7C5AAUSVV","short_pith_number":"pith:25FCGMZH","schema_version":"1.0","canonical_sha256":"d74a233327acc7bfe12b37c5d00292ad6a3626e6c12eb0c52ed08699fc093130","source":{"kind":"arxiv","id":"0812.1364","version":1},"attestation_state":"computed","paper":{"title":"Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Benny Godlin, Emilia Katz, Johann A. Makowsky","submitted_at":"2008-12-07T16:50:53Z","abstract_excerpt":"Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove that in this framework every recursive definition of a graph polynomial can be converted into a subset expansion formula."},"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":"0812.1364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-12-07T16:50:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7011e929ab3af4859d42f28e6d222239cafe626cbf8d7dd4d3e0b4ec917c7365","abstract_canon_sha256":"4783b086ddbabbe96a417fa971f84d7b3a434d95b33f155a7dba586629b19b96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.666959Z","signature_b64":"hhRz/DAuMCdA70fir9oPLWcbP+Pj8t0RZXheM+54SiVlGe914WJOR2neauHM6YQHjKVLI8c8VIM7UnSbi8tRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74a233327acc7bfe12b37c5d00292ad6a3626e6c12eb0c52ed08699fc093130","last_reissued_at":"2026-05-18T03:13:58.666400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.666400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Benny Godlin, Emilia Katz, Johann A. Makowsky","submitted_at":"2008-12-07T16:50:53Z","abstract_excerpt":"Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove that in this framework every recursive definition of a graph polynomial can be converted into a subset expansion formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1364","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":"0812.1364","created_at":"2026-05-18T03:13:58.666484+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.1364v1","created_at":"2026-05-18T03:13:58.666484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1364","created_at":"2026-05-18T03:13:58.666484+00:00"},{"alias_kind":"pith_short_12","alias_value":"25FCGMZHVTD3","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"25FCGMZHVTD37YJL","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"25FCGMZH","created_at":"2026-05-18T12:25:56.245647+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/25FCGMZHVTD37YJLG7C5AAUSVV","json":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV.json","graph_json":"https://pith.science/api/pith-number/25FCGMZHVTD37YJLG7C5AAUSVV/graph.json","events_json":"https://pith.science/api/pith-number/25FCGMZHVTD37YJLG7C5AAUSVV/events.json","paper":"https://pith.science/paper/25FCGMZH"},"agent_actions":{"view_html":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV","download_json":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV.json","view_paper":"https://pith.science/paper/25FCGMZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.1364&json=true","fetch_graph":"https://pith.science/api/pith-number/25FCGMZHVTD37YJLG7C5AAUSVV/graph.json","fetch_events":"https://pith.science/api/pith-number/25FCGMZHVTD37YJLG7C5AAUSVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV/action/storage_attestation","attest_author":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV/action/author_attestation","sign_citation":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV/action/citation_signature","submit_replication":"https://pith.science/pith/25FCGMZHVTD37YJLG7C5AAUSVV/action/replication_record"}},"created_at":"2026-05-18T03:13:58.666484+00:00","updated_at":"2026-05-18T03:13:58.666484+00:00"}