{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J2GKJGOOINM3VBTOIMET4FPE5I","short_pith_number":"pith:J2GKJGOO","schema_version":"1.0","canonical_sha256":"4e8ca499ce4359ba866e43093e15e4ea2e16276a8b938da0c63e669e4c8f72d1","source":{"kind":"arxiv","id":"2201.00721","version":1},"attestation_state":"computed","paper":{"title":"Categorifying connected domination via graph \\\"uberhomology","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO","math.GT"],"primary_cat":"math.AT","authors_text":"Carlo Collari, Daniele Celoria, Luigi Caputi","submitted_at":"2022-01-03T15:48:40Z","abstract_excerpt":"\\\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \\\"uberhomology, is related to dominating sets in graphs. To this end, we interpret \\\"uberhomology as a poset homology, and investigate its functoriality properties. We then show that the Euler characteristic of the bold homology of a graph coincides with an evaluation of its connected domination polynomial. Even more, the bold chain complex retracts onto a complex generated by connected dominating sets. We conclude wi"},"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":"2201.00721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AT","submitted_at":"2022-01-03T15:48:40Z","cross_cats_sorted":["math.CO","math.GT"],"title_canon_sha256":"c26cf5cd1762d8f921c5a9884f0b5f61e020508cd9f31aa58be9dcd069b3e4f8","abstract_canon_sha256":"88292ee78b6ae70e69788d1b612ced0dd78394c0aa59fca6596592717b5b4800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:43.449269Z","signature_b64":"5yJgKAsMZulrhEiAoQbTd0qKmG8goccsiBtrWuiUMZxbYcFoGRh0MyPpar6VbK8Mibi8vHoSiJwq69a96/cHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8ca499ce4359ba866e43093e15e4ea2e16276a8b938da0c63e669e4c8f72d1","last_reissued_at":"2026-07-05T06:41:43.448745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:43.448745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Categorifying connected domination via graph \\\"uberhomology","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO","math.GT"],"primary_cat":"math.AT","authors_text":"Carlo Collari, Daniele Celoria, Luigi Caputi","submitted_at":"2022-01-03T15:48:40Z","abstract_excerpt":"\\\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \\\"uberhomology, is related to dominating sets in graphs. To this end, we interpret \\\"uberhomology as a poset homology, and investigate its functoriality properties. We then show that the Euler characteristic of the bold homology of a graph coincides with an evaluation of its connected domination polynomial. Even more, the bold chain complex retracts onto a complex generated by connected dominating sets. We conclude wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00721","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/2201.00721/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":"2201.00721","created_at":"2026-07-05T06:41:43.448795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.00721v1","created_at":"2026-07-05T06:41:43.448795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00721","created_at":"2026-07-05T06:41:43.448795+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2GKJGOOINM3","created_at":"2026-07-05T06:41:43.448795+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2GKJGOOINM3VBTO","created_at":"2026-07-05T06:41:43.448795+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2GKJGOO","created_at":"2026-07-05T06:41:43.448795+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/J2GKJGOOINM3VBTOIMET4FPE5I","json":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I.json","graph_json":"https://pith.science/api/pith-number/J2GKJGOOINM3VBTOIMET4FPE5I/graph.json","events_json":"https://pith.science/api/pith-number/J2GKJGOOINM3VBTOIMET4FPE5I/events.json","paper":"https://pith.science/paper/J2GKJGOO"},"agent_actions":{"view_html":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I","download_json":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I.json","view_paper":"https://pith.science/paper/J2GKJGOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.00721&json=true","fetch_graph":"https://pith.science/api/pith-number/J2GKJGOOINM3VBTOIMET4FPE5I/graph.json","fetch_events":"https://pith.science/api/pith-number/J2GKJGOOINM3VBTOIMET4FPE5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I/action/storage_attestation","attest_author":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I/action/author_attestation","sign_citation":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I/action/citation_signature","submit_replication":"https://pith.science/pith/J2GKJGOOINM3VBTOIMET4FPE5I/action/replication_record"}},"created_at":"2026-07-05T06:41:43.448795+00:00","updated_at":"2026-07-05T06:41:43.448795+00:00"}