{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:J27KJZXPJOQAHDJT2PET3QBRWS","short_pith_number":"pith:J27KJZXP","schema_version":"1.0","canonical_sha256":"4ebea4e6ef4ba0038d33d3c93dc031b49dc65e482aa3d0f4c9e79d6a2d0f779e","source":{"kind":"arxiv","id":"0712.3112","version":1},"attestation_state":"computed","paper":{"title":"A most general edge elimination graph polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Godlin, Ilia Averbouch, Johann A. Makowsky","submitted_at":"2007-12-19T08:04:26Z","abstract_excerpt":"We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end points. Like in the case of deletion and contraction only (W. Tutte, 1954), it turns out that there is a most general polynomial satisfying such recurrence relations, which we call $\\xi(G,x,y,z)$. We show that the new polynomial simultaneously generalizes the Tutte polynomial, the matching polynomial, and the recent generalization of the chromatic polynomial proposed by K.Dohmen, A.P\\\"{o}nitz and P.Tittman (2003), inc"},"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":"0712.3112","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-12-19T08:04:26Z","cross_cats_sorted":[],"title_canon_sha256":"eef3423102496b4f45ba186c0416a2005dce633c5cfb2dd37bf35afa140d26f3","abstract_canon_sha256":"c09b6bf339f0c90912af126ada2f6bba83d08930837197a9bc37b53c1ea666ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.693513Z","signature_b64":"CmcCFLIqpBbEcLBhmXMxlwVRvzCce69A9yU3zyrMFHDpyyoIp3OHoC+qnc3JTNt0ixoqOotoK6qBBOxzmZncDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebea4e6ef4ba0038d33d3c93dc031b49dc65e482aa3d0f4c9e79d6a2d0f779e","last_reissued_at":"2026-05-18T03:13:58.692790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.692790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A most general edge elimination graph polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Godlin, Ilia Averbouch, Johann A. Makowsky","submitted_at":"2007-12-19T08:04:26Z","abstract_excerpt":"We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end points. Like in the case of deletion and contraction only (W. Tutte, 1954), it turns out that there is a most general polynomial satisfying such recurrence relations, which we call $\\xi(G,x,y,z)$. We show that the new polynomial simultaneously generalizes the Tutte polynomial, the matching polynomial, and the recent generalization of the chromatic polynomial proposed by K.Dohmen, A.P\\\"{o}nitz and P.Tittman (2003), inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.3112","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":"0712.3112","created_at":"2026-05-18T03:13:58.692923+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.3112v1","created_at":"2026-05-18T03:13:58.692923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.3112","created_at":"2026-05-18T03:13:58.692923+00:00"},{"alias_kind":"pith_short_12","alias_value":"J27KJZXPJOQA","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"J27KJZXPJOQAHDJT","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"J27KJZXP","created_at":"2026-05-18T12:25:55.427421+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/J27KJZXPJOQAHDJT2PET3QBRWS","json":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS.json","graph_json":"https://pith.science/api/pith-number/J27KJZXPJOQAHDJT2PET3QBRWS/graph.json","events_json":"https://pith.science/api/pith-number/J27KJZXPJOQAHDJT2PET3QBRWS/events.json","paper":"https://pith.science/paper/J27KJZXP"},"agent_actions":{"view_html":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS","download_json":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS.json","view_paper":"https://pith.science/paper/J27KJZXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.3112&json=true","fetch_graph":"https://pith.science/api/pith-number/J27KJZXPJOQAHDJT2PET3QBRWS/graph.json","fetch_events":"https://pith.science/api/pith-number/J27KJZXPJOQAHDJT2PET3QBRWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS/action/storage_attestation","attest_author":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS/action/author_attestation","sign_citation":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS/action/citation_signature","submit_replication":"https://pith.science/pith/J27KJZXPJOQAHDJT2PET3QBRWS/action/replication_record"}},"created_at":"2026-05-18T03:13:58.692923+00:00","updated_at":"2026-05-18T03:13:58.692923+00:00"}