{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N524EY5YUIQIPREBSRMRRVEMDV","short_pith_number":"pith:N524EY5Y","schema_version":"1.0","canonical_sha256":"6f75c263b8a22087c481945918d48c1d7f1b2c22ff16cc580627e52fc3191401","source":{"kind":"arxiv","id":"2503.21287","version":6},"attestation_state":"computed","paper":{"title":"On Supports for graphs of bounded genus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Karamjeet Singh, Rajiv Raman","submitted_at":"2025-03-27T09:11:24Z","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"},"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":"2503.21287","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T09:11:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9b7693e836f5806eb246d32b4f8b980e9de96acdc0a3a9c930ca7a8d87ad1000","abstract_canon_sha256":"3b2298c64c10db084e94dccb9211f2f42dc0f1a8912ac7856eabc0399654c975"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:42.279683Z","signature_b64":"V9iBREO1tt+kT9B4fszD/nYtOBUuRF2EyoFUNUlTfKRkSq4TRgwojZV+lC6NnnZnEABh1qlwYIiyYxitzptrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f75c263b8a22087c481945918d48c1d7f1b2c22ff16cc580627e52fc3191401","last_reissued_at":"2026-05-22T01:03:42.278762Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:42.278762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Supports for graphs of bounded genus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Karamjeet Singh, Rajiv Raman","submitted_at":"2025-03-27T09:11:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21287","kind":"arxiv","version":6},"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/2503.21287/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":"2503.21287","created_at":"2026-05-22T01:03:42.278880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.21287v6","created_at":"2026-05-22T01:03:42.278880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21287","created_at":"2026-05-22T01:03:42.278880+00:00"},{"alias_kind":"pith_short_12","alias_value":"N524EY5YUIQI","created_at":"2026-05-22T01:03:42.278880+00:00"},{"alias_kind":"pith_short_16","alias_value":"N524EY5YUIQIPREB","created_at":"2026-05-22T01:03:42.278880+00:00"},{"alias_kind":"pith_short_8","alias_value":"N524EY5Y","created_at":"2026-05-22T01:03:42.278880+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/N524EY5YUIQIPREBSRMRRVEMDV","json":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV.json","graph_json":"https://pith.science/api/pith-number/N524EY5YUIQIPREBSRMRRVEMDV/graph.json","events_json":"https://pith.science/api/pith-number/N524EY5YUIQIPREBSRMRRVEMDV/events.json","paper":"https://pith.science/paper/N524EY5Y"},"agent_actions":{"view_html":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV","download_json":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV.json","view_paper":"https://pith.science/paper/N524EY5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.21287&json=true","fetch_graph":"https://pith.science/api/pith-number/N524EY5YUIQIPREBSRMRRVEMDV/graph.json","fetch_events":"https://pith.science/api/pith-number/N524EY5YUIQIPREBSRMRRVEMDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV/action/storage_attestation","attest_author":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV/action/author_attestation","sign_citation":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV/action/citation_signature","submit_replication":"https://pith.science/pith/N524EY5YUIQIPREBSRMRRVEMDV/action/replication_record"}},"created_at":"2026-05-22T01:03:42.278880+00:00","updated_at":"2026-05-22T01:03:42.278880+00:00"}