{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N524EY5YUIQIPREBSRMRRVEMDV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b2298c64c10db084e94dccb9211f2f42dc0f1a8912ac7856eabc0399654c975","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T09:11:24Z","title_canon_sha256":"9b7693e836f5806eb246d32b4f8b980e9de96acdc0a3a9c930ca7a8d87ad1000"},"schema_version":"1.0","source":{"id":"2503.21287","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21287","created_at":"2026-05-22T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21287v6","created_at":"2026-05-22T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21287","created_at":"2026-05-22T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"N524EY5YUIQI","created_at":"2026-05-22T01:03:42Z"},{"alias_kind":"pith_short_16","alias_value":"N524EY5YUIQIPREB","created_at":"2026-05-22T01:03:42Z"},{"alias_kind":"pith_short_8","alias_value":"N524EY5Y","created_at":"2026-05-22T01:03:42Z"}],"graph_snapshots":[{"event_id":"sha256:677d7f3d462e7c8517316814af098a6a30880b953d94a5a4796139c7c7834e2f","target":"graph","created_at":"2026-05-22T01:03:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.21287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $(X,\\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\\in\\mathcal{E}$, the subgraph of $Q$ induced on the elements in $E$ is connected. We consider the problem of constructing a support for hypergraphs defined by connected subgraphs of a host graph. For a graph $G=(V,E)$, let $\\mathcal{H}$ be a set of connected subgraphs of $G$. Let the vertices of $G$ be partitioned into two sets the \\emph{terminals} $\\mathbf{b}(V)$ and the \\emph{non-terminals} $\\mathbf{r}(V)$. We define a hypergraph on $\\mathbf{b}(V)$, where each $H\\in\\mathcal{H}$ defines a hyperedge con","authors_text":"Karamjeet Singh, Rajiv Raman","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T09:11:24Z","title":"On Supports for graphs of bounded genus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21287","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e1edc5416bfba6883db995faf1752a682804d00a441aa8e154ca858e87d4eb55","target":"record","created_at":"2026-05-22T01:03:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b2298c64c10db084e94dccb9211f2f42dc0f1a8912ac7856eabc0399654c975","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T09:11:24Z","title_canon_sha256":"9b7693e836f5806eb246d32b4f8b980e9de96acdc0a3a9c930ca7a8d87ad1000"},"schema_version":"1.0","source":{"id":"2503.21287","kind":"arxiv","version":6}},"canonical_sha256":"6f75c263b8a22087c481945918d48c1d7f1b2c22ff16cc580627e52fc3191401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f75c263b8a22087c481945918d48c1d7f1b2c22ff16cc580627e52fc3191401","first_computed_at":"2026-05-22T01:03:42.278762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:42.278762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V9iBREO1tt+kT9B4fszD/nYtOBUuRF2EyoFUNUlTfKRkSq4TRgwojZV+lC6NnnZnEABh1qlwYIiyYxitzptrAA==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:42.279683Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.21287","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1edc5416bfba6883db995faf1752a682804d00a441aa8e154ca858e87d4eb55","sha256:677d7f3d462e7c8517316814af098a6a30880b953d94a5a4796139c7c7834e2f"],"state_sha256":"4fbd4347e640d2ee0fabdab6def441ab9ce59aa5a1cb03debcecd9e7dc065d46"}