{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MJ7SNRP7SOW75LO3ZBVR42PCB3","short_pith_number":"pith:MJ7SNRP7","schema_version":"1.0","canonical_sha256":"627f26c5ff93adfeaddbc86b1e69e20efb5d1e7ddf3ac9cf20445207de6f1a01","source":{"kind":"arxiv","id":"2407.04035","version":1},"attestation_state":"computed","paper":{"title":"A remark on the Whitney Broken Circuit Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Procacci, Emanuel Juliano, Paula M. S. Fialho","submitted_at":"2024-07-04T16:20:24Z","abstract_excerpt":"In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E) to sums over forests of G associated to some partition scheme in G."},"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":"2407.04035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-04T16:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"02d64dc7bca8cd5e47ccd05f374953fac5ea47680ffd933741b329ceb03db49a","abstract_canon_sha256":"040bee83909b1b487ace4b59a2ad0249864c29fe68de18a2cccc34603323a47b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:27.692791Z","signature_b64":"5KDXDsg/CQu6WGhgzE1y78qojwdhO7F9BuLRo89+s+rh5od8M6xzlZpTkzV/7TjXmFOZYqLQhEIzhV4WgjLcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"627f26c5ff93adfeaddbc86b1e69e20efb5d1e7ddf3ac9cf20445207de6f1a01","last_reissued_at":"2026-07-05T08:40:27.692306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:27.692306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A remark on the Whitney Broken Circuit Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Procacci, Emanuel Juliano, Paula M. S. Fialho","submitted_at":"2024-07-04T16:20:24Z","abstract_excerpt":"In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E) to sums over forests of G associated to some partition scheme in G."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04035","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/2407.04035/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":"2407.04035","created_at":"2026-07-05T08:40:27.692369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04035v1","created_at":"2026-07-05T08:40:27.692369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04035","created_at":"2026-07-05T08:40:27.692369+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJ7SNRP7SOW7","created_at":"2026-07-05T08:40:27.692369+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJ7SNRP7SOW75LO3","created_at":"2026-07-05T08:40:27.692369+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJ7SNRP7","created_at":"2026-07-05T08:40:27.692369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22766","citing_title":"On the independent set polynomial of graphs and claw-free graphs","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3","json":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3.json","graph_json":"https://pith.science/api/pith-number/MJ7SNRP7SOW75LO3ZBVR42PCB3/graph.json","events_json":"https://pith.science/api/pith-number/MJ7SNRP7SOW75LO3ZBVR42PCB3/events.json","paper":"https://pith.science/paper/MJ7SNRP7"},"agent_actions":{"view_html":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3","download_json":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3.json","view_paper":"https://pith.science/paper/MJ7SNRP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04035&json=true","fetch_graph":"https://pith.science/api/pith-number/MJ7SNRP7SOW75LO3ZBVR42PCB3/graph.json","fetch_events":"https://pith.science/api/pith-number/MJ7SNRP7SOW75LO3ZBVR42PCB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3/action/storage_attestation","attest_author":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3/action/author_attestation","sign_citation":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3/action/citation_signature","submit_replication":"https://pith.science/pith/MJ7SNRP7SOW75LO3ZBVR42PCB3/action/replication_record"}},"created_at":"2026-07-05T08:40:27.692369+00:00","updated_at":"2026-07-05T08:40:27.692369+00:00"}