{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RV4W7OYKJFKMZH2WQZ74HYBGFA","short_pith_number":"pith:RV4W7OYK","schema_version":"1.0","canonical_sha256":"8d796fbb0a4954cc9f56867fc3e026280a3720d55d394dca4e3082001ac2f0dd","source":{"kind":"arxiv","id":"2009.11527","version":10},"attestation_state":"computed","paper":{"title":"The Elser nuclei sum revisited","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darij Grinberg","submitted_at":"2020-09-24T07:36:30Z","abstract_excerpt":"Fix a finite undirected graph $\\Gamma$ and a vertex $v$ of $\\Gamma$. Let $E$ be the set of edges of $\\Gamma$. We call a subset $F$ of $E$ pandemic if each edge of $\\Gamma$ has at least one endpoint that can be connected to $v$ by an $F$-path (i.e., a path using edges from $F$ only). In 1984, Elser showed that the sum of $\\left(-1\\right)^{\\left| F\\right|}$ over all pandemic subsets $F$ of $E$ is $0$ if $E\\neq \\varnothing$. We give a simple proof of this result via a sign-reversing involution, and discuss variants, generalizations and refinements, revealing connections to abstract convexity (the"},"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":"2009.11527","kind":"arxiv","version":10},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-24T07:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"976d393765fd731d11c77eaec9698dbe6558377b61bc31687159551d0913198a","abstract_canon_sha256":"48de1bd0233ed88fcc3a54e982edd27b03a4c7544532e6b1c5cd71e6df9d454b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:30.977501Z","signature_b64":"FPjh7ZjnTJ8nUMVuwd7N0R2/3n6cQJulas6tarS372JxGq3yLN9OfY8nSrWnB3A9zMUJW76b9Gx5byBfUCVkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d796fbb0a4954cc9f56867fc3e026280a3720d55d394dca4e3082001ac2f0dd","last_reissued_at":"2026-07-05T06:23:30.977158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:30.977158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Elser nuclei sum revisited","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darij Grinberg","submitted_at":"2020-09-24T07:36:30Z","abstract_excerpt":"Fix a finite undirected graph $\\Gamma$ and a vertex $v$ of $\\Gamma$. Let $E$ be the set of edges of $\\Gamma$. We call a subset $F$ of $E$ pandemic if each edge of $\\Gamma$ has at least one endpoint that can be connected to $v$ by an $F$-path (i.e., a path using edges from $F$ only). In 1984, Elser showed that the sum of $\\left(-1\\right)^{\\left| F\\right|}$ over all pandemic subsets $F$ of $E$ is $0$ if $E\\neq \\varnothing$. We give a simple proof of this result via a sign-reversing involution, and discuss variants, generalizations and refinements, revealing connections to abstract convexity (the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11527","kind":"arxiv","version":10},"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/2009.11527/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":"2009.11527","created_at":"2026-07-05T06:23:30.977213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.11527v10","created_at":"2026-07-05T06:23:30.977213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11527","created_at":"2026-07-05T06:23:30.977213+00:00"},{"alias_kind":"pith_short_12","alias_value":"RV4W7OYKJFKM","created_at":"2026-07-05T06:23:30.977213+00:00"},{"alias_kind":"pith_short_16","alias_value":"RV4W7OYKJFKMZH2W","created_at":"2026-07-05T06:23:30.977213+00:00"},{"alias_kind":"pith_short_8","alias_value":"RV4W7OYK","created_at":"2026-07-05T06:23:30.977213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18788","citing_title":"Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA","json":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA.json","graph_json":"https://pith.science/api/pith-number/RV4W7OYKJFKMZH2WQZ74HYBGFA/graph.json","events_json":"https://pith.science/api/pith-number/RV4W7OYKJFKMZH2WQZ74HYBGFA/events.json","paper":"https://pith.science/paper/RV4W7OYK"},"agent_actions":{"view_html":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA","download_json":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA.json","view_paper":"https://pith.science/paper/RV4W7OYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.11527&json=true","fetch_graph":"https://pith.science/api/pith-number/RV4W7OYKJFKMZH2WQZ74HYBGFA/graph.json","fetch_events":"https://pith.science/api/pith-number/RV4W7OYKJFKMZH2WQZ74HYBGFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA/action/storage_attestation","attest_author":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA/action/author_attestation","sign_citation":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA/action/citation_signature","submit_replication":"https://pith.science/pith/RV4W7OYKJFKMZH2WQZ74HYBGFA/action/replication_record"}},"created_at":"2026-07-05T06:23:30.977213+00:00","updated_at":"2026-07-05T06:23:30.977213+00:00"}