{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QHPNVXS7ZOQIAZRHCHQ3WBPAQT","short_pith_number":"pith:QHPNVXS7","schema_version":"1.0","canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","source":{"kind":"arxiv","id":"1901.04560","version":1},"attestation_state":"computed","paper":{"title":"Minimally Connected Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Penland, Josh Hiller, Mark Budden","submitted_at":"2019-01-14T20:54:16Z","abstract_excerpt":"Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of interesting algorithmic problems. In this paper, we define a \\textit{construction process} for minimally connected $r$-uniform hypergraphs, which captures the intuitive notion of building a hypergraph piece-by-piece, and a numerical invariant called the \\textit{tightness}, which is independent of the construction process used. Using these tools, we prove some fun"},"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":"1901.04560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-14T20:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"e6bfb97691205f5992bc86898f435708d36c4ee0bd2c5d711b25421f903f4da6","abstract_canon_sha256":"0048237f3473dec15725948f6d537e1ad931b7640000c749dfe1dac02afc41a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:22.416080Z","signature_b64":"at1zvLo9Q8U0+VU7xHXt6MrlQFW8p7aZSnjqamqSaRW3rGzTD/Oc3saUMsL9W3NvCxne+ILangrsHzWJEXg4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","last_reissued_at":"2026-05-17T23:56:22.415479Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:22.415479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimally Connected Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Penland, Josh Hiller, Mark Budden","submitted_at":"2019-01-14T20:54:16Z","abstract_excerpt":"Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of interesting algorithmic problems. In this paper, we define a \\textit{construction process} for minimally connected $r$-uniform hypergraphs, which captures the intuitive notion of building a hypergraph piece-by-piece, and a numerical invariant called the \\textit{tightness}, which is independent of the construction process used. Using these tools, we prove some fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04560","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":"1901.04560","created_at":"2026-05-17T23:56:22.415560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04560v1","created_at":"2026-05-17T23:56:22.415560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04560","created_at":"2026-05-17T23:56:22.415560+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHPNVXS7ZOQI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHPNVXS7ZOQIAZRH","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHPNVXS7","created_at":"2026-05-18T12:33:27.125529+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/QHPNVXS7ZOQIAZRHCHQ3WBPAQT","json":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT.json","graph_json":"https://pith.science/api/pith-number/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/graph.json","events_json":"https://pith.science/api/pith-number/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/events.json","paper":"https://pith.science/paper/QHPNVXS7"},"agent_actions":{"view_html":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT","download_json":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT.json","view_paper":"https://pith.science/paper/QHPNVXS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04560&json=true","fetch_graph":"https://pith.science/api/pith-number/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/graph.json","fetch_events":"https://pith.science/api/pith-number/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/action/storage_attestation","attest_author":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/action/author_attestation","sign_citation":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/action/citation_signature","submit_replication":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/action/replication_record"}},"created_at":"2026-05-17T23:56:22.415560+00:00","updated_at":"2026-05-17T23:56:22.415560+00:00"}