{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RKHNOHJBLMY6VOQYKGK5JYBVHK","short_pith_number":"pith:RKHNOHJB","schema_version":"1.0","canonical_sha256":"8a8ed71d215b31eaba185195d4e0353a88b87dcc00e483ada69f20c92d691d5b","source":{"kind":"arxiv","id":"2606.00653","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial interpretations of Tutte polynomials at the point $(2,-1)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianlong Ma, Xian'an Jin, Yu Chen","submitted_at":"2026-05-30T09:55:58Z","abstract_excerpt":"Let $G$ be a simple connected graph, and let $T_{G}(x,y)$ be the Tutte polynomial of $G$. Motivated by the works in \\cite{Ma}, we, in this paper, introduce the even-left spanning forests of $G$ and odd $G$-partitionable permutations, and show that $T_{G}(2,-1)$ is equal to both the number of even-left spanning forests of $G$ and the number of odd $G$-partitionable permutations. In particular, for a complete graph $K_n$, we prove that $T_{K_{n}}(2,-1)$ is the number of alternating permutations on $\\{1,2,\\dots,n+1\\}$, using two distinct techniques: a recurrence relation and an explicit bijection"},"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":"2606.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T09:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"6e0301a815ef4d55763e96652aabde2b06c58a9932811885eecb6db6345f2b8a","abstract_canon_sha256":"88aa04f9385ae63879320add23048c45f7ad3b91bec30338f56ee7a4c9a38542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:01.021718Z","signature_b64":"BHr8f2xRmOCXoPEUUVp9IBcuB4AuB01KH3hlCnbWhmuAZeyiTk6WmNGutiplnyzYjdHxj80ORb72qewNeEBLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a8ed71d215b31eaba185195d4e0353a88b87dcc00e483ada69f20c92d691d5b","last_reissued_at":"2026-06-02T01:04:01.021278Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:01.021278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial interpretations of Tutte polynomials at the point $(2,-1)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianlong Ma, Xian'an Jin, Yu Chen","submitted_at":"2026-05-30T09:55:58Z","abstract_excerpt":"Let $G$ be a simple connected graph, and let $T_{G}(x,y)$ be the Tutte polynomial of $G$. Motivated by the works in \\cite{Ma}, we, in this paper, introduce the even-left spanning forests of $G$ and odd $G$-partitionable permutations, and show that $T_{G}(2,-1)$ is equal to both the number of even-left spanning forests of $G$ and the number of odd $G$-partitionable permutations. In particular, for a complete graph $K_n$, we prove that $T_{K_{n}}(2,-1)$ is the number of alternating permutations on $\\{1,2,\\dots,n+1\\}$, using two distinct techniques: a recurrence relation and an explicit bijection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00653","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00653/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.00653","created_at":"2026-06-02T01:04:01.021345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00653v1","created_at":"2026-06-02T01:04:01.021345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00653","created_at":"2026-06-02T01:04:01.021345+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKHNOHJBLMY6","created_at":"2026-06-02T01:04:01.021345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKHNOHJBLMY6VOQY","created_at":"2026-06-02T01:04:01.021345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKHNOHJB","created_at":"2026-06-02T01:04:01.021345+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/RKHNOHJBLMY6VOQYKGK5JYBVHK","json":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK.json","graph_json":"https://pith.science/api/pith-number/RKHNOHJBLMY6VOQYKGK5JYBVHK/graph.json","events_json":"https://pith.science/api/pith-number/RKHNOHJBLMY6VOQYKGK5JYBVHK/events.json","paper":"https://pith.science/paper/RKHNOHJB"},"agent_actions":{"view_html":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK","download_json":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK.json","view_paper":"https://pith.science/paper/RKHNOHJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00653&json=true","fetch_graph":"https://pith.science/api/pith-number/RKHNOHJBLMY6VOQYKGK5JYBVHK/graph.json","fetch_events":"https://pith.science/api/pith-number/RKHNOHJBLMY6VOQYKGK5JYBVHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK/action/storage_attestation","attest_author":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK/action/author_attestation","sign_citation":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK/action/citation_signature","submit_replication":"https://pith.science/pith/RKHNOHJBLMY6VOQYKGK5JYBVHK/action/replication_record"}},"created_at":"2026-06-02T01:04:01.021345+00:00","updated_at":"2026-06-02T01:04:01.021345+00:00"}