{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QHPNVXS7ZOQIAZRHCHQ3WBPAQT","short_pith_number":"pith:QHPNVXS7","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"},"canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","source":{"kind":"arxiv","id":"1901.04560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04560","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04560v1","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04560","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"QHPNVXS7ZOQI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QHPNVXS7ZOQIAZRH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QHPNVXS7","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QHPNVXS7ZOQIAZRHCHQ3WBPAQT","target":"record","payload":{"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"},"canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","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"},"source_kind":"arxiv","source_id":"1901.04560","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0L7BtPhc4Ir3CcMJKBReiKvBBU4JpdCBL3aoBMrGCUuCzJfTXb+nVGFOVrfpz0UnVpAY+n9ZKmJtCJqtf8xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:21:53.391479Z"},"content_sha256":"f80745660012eeaced4e91f3bfb00bcea26b0366c0c072365dd91da9d78c1dec","schema_version":"1.0","event_id":"sha256:f80745660012eeaced4e91f3bfb00bcea26b0366c0c072365dd91da9d78c1dec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QHPNVXS7ZOQIAZRHCHQ3WBPAQT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bt10dwE9oUjvERGDLINwbxPeGVBG+ASG+J9/4dhsxU8D9K+p5FNISSgmIZIc/2HkoyrPMg6AykFkIdF+t7/1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:21:53.391829Z"},"content_sha256":"d3e404bcf93ac1a746274baecd8186c51db7f5bdece1c864066386d9904e5fff","schema_version":"1.0","event_id":"sha256:d3e404bcf93ac1a746274baecd8186c51db7f5bdece1c864066386d9904e5fff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/bundle.json","state_url":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T01:21:53Z","links":{"resolver":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT","bundle":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/bundle.json","state":"https://pith.science/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHPNVXS7ZOQIAZRHCHQ3WBPAQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QHPNVXS7ZOQIAZRHCHQ3WBPAQT","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":"0048237f3473dec15725948f6d537e1ad931b7640000c749dfe1dac02afc41a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-14T20:54:16Z","title_canon_sha256":"e6bfb97691205f5992bc86898f435708d36c4ee0bd2c5d711b25421f903f4da6"},"schema_version":"1.0","source":{"id":"1901.04560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04560","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04560v1","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04560","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"QHPNVXS7ZOQI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QHPNVXS7ZOQIAZRH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QHPNVXS7","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:d3e404bcf93ac1a746274baecd8186c51db7f5bdece1c864066386d9904e5fff","target":"graph","created_at":"2026-05-17T23:56:22Z","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"},"paper":{"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","authors_text":"Andrew Penland, Josh Hiller, Mark Budden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-14T20:54:16Z","title":"Minimally Connected Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04560","kind":"arxiv","version":1},"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:f80745660012eeaced4e91f3bfb00bcea26b0366c0c072365dd91da9d78c1dec","target":"record","created_at":"2026-05-17T23:56:22Z","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":"0048237f3473dec15725948f6d537e1ad931b7640000c749dfe1dac02afc41a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-14T20:54:16Z","title_canon_sha256":"e6bfb97691205f5992bc86898f435708d36c4ee0bd2c5d711b25421f903f4da6"},"schema_version":"1.0","source":{"id":"1901.04560","kind":"arxiv","version":1}},"canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81dedade5fcba080662711e1bb05e084f982734263bd8846549b2e0f748844ea","first_computed_at":"2026-05-17T23:56:22.415479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:22.415479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"at1zvLo9Q8U0+VU7xHXt6MrlQFW8p7aZSnjqamqSaRW3rGzTD/Oc3saUMsL9W3NvCxne+ILangrsHzWJEXg4DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:22.416080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f80745660012eeaced4e91f3bfb00bcea26b0366c0c072365dd91da9d78c1dec","sha256:d3e404bcf93ac1a746274baecd8186c51db7f5bdece1c864066386d9904e5fff"],"state_sha256":"b5e1ea34774b0e6709de1c8aa17bab451691580c6ebab6bcd3c13b0e35005b8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gviOVVfKwfzaO2/Dz2d5YYZLD34FlYL76gzY9ckhMwbpCXNW1MAdwdpA7nXu+30M3WUWSi9capm0wVR1mNUSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T01:21:53.393893Z","bundle_sha256":"5822e84dcc936c7ddb1f6683e156d18b2e3bf95bdae7474020dc45f2948d8f04"}}