{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UXW7FRVO4YUKWDTDTBDXSAQP7O","short_pith_number":"pith:UXW7FRVO","schema_version":"1.0","canonical_sha256":"a5edf2c6aee628ab0e63984779020ffb9f0eab7923c84ae5859ba6bbc8283d82","source":{"kind":"arxiv","id":"1307.7323","version":1},"attestation_state":"computed","paper":{"title":"Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Braun, Sarah Crown Rundell","submitted_at":"2013-07-28T01:19:55Z","abstract_excerpt":"Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents."},"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":"1307.7323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-28T01:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"8a69bb306c5969116f77881e7a6d441dcac2e5bcb12cfbe9796a8d586b364987","abstract_canon_sha256":"1253904548598a160127986af0d929d23fb44ca1462c7c22e160428f4f1091d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.574153Z","signature_b64":"q6XFAqEe/8s0tVtH+t6+IkRfw3zNiXr6BjiaxdUBoUc0aNVGcMqBA0iyHBnOq5NzD24wCBOgU3w+b37AoN2BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5edf2c6aee628ab0e63984779020ffb9f0eab7923c84ae5859ba6bbc8283d82","last_reissued_at":"2026-05-18T03:17:23.573606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.573606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Braun, Sarah Crown Rundell","submitted_at":"2013-07-28T01:19:55Z","abstract_excerpt":"Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7323","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":"1307.7323","created_at":"2026-05-18T03:17:23.573701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7323v1","created_at":"2026-05-18T03:17:23.573701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7323","created_at":"2026-05-18T03:17:23.573701+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXW7FRVO4YUK","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXW7FRVO4YUKWDTD","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXW7FRVO","created_at":"2026-05-18T12:28:02.375192+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/UXW7FRVO4YUKWDTDTBDXSAQP7O","json":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O.json","graph_json":"https://pith.science/api/pith-number/UXW7FRVO4YUKWDTDTBDXSAQP7O/graph.json","events_json":"https://pith.science/api/pith-number/UXW7FRVO4YUKWDTDTBDXSAQP7O/events.json","paper":"https://pith.science/paper/UXW7FRVO"},"agent_actions":{"view_html":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O","download_json":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O.json","view_paper":"https://pith.science/paper/UXW7FRVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7323&json=true","fetch_graph":"https://pith.science/api/pith-number/UXW7FRVO4YUKWDTDTBDXSAQP7O/graph.json","fetch_events":"https://pith.science/api/pith-number/UXW7FRVO4YUKWDTDTBDXSAQP7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O/action/storage_attestation","attest_author":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O/action/author_attestation","sign_citation":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O/action/citation_signature","submit_replication":"https://pith.science/pith/UXW7FRVO4YUKWDTDTBDXSAQP7O/action/replication_record"}},"created_at":"2026-05-18T03:17:23.573701+00:00","updated_at":"2026-05-18T03:17:23.573701+00:00"}