{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LKYGD57WEO7PCMFBL7IMWTAGEO","short_pith_number":"pith:LKYGD57W","schema_version":"1.0","canonical_sha256":"5ab061f7f623bef130a15fd0cb4c0623b8483e9a22ece00a40cdb15591b0410c","source":{"kind":"arxiv","id":"2004.05429","version":1},"attestation_state":"computed","paper":{"title":"Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.AP"],"primary_cat":"cs.DS","authors_text":"Debabrota Basu, Laurent Decreusefond, Naheed Anjum Arafat, Stephane Bressan","submitted_at":"2020-04-11T15:44:14Z","abstract_excerpt":"We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte Carlo approaches. Our algorithms leverage the transposition of properties and algorithms devised for matrices constituted of zeros and ones with prescribed row- and column-sums to hypergraphs. The construction algorithm extends the applicability of Markov chain Monte Carlo approaches when the initial hypergraph is not provided. The random generation algorithm"},"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":"2004.05429","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2020-04-11T15:44:14Z","cross_cats_sorted":["cs.SI","math.CO","stat.AP"],"title_canon_sha256":"064ca696ab22edb0d46813b9695c4b385b48d1672ee6d57928dfa56eaf74ac7b","abstract_canon_sha256":"3d29977a1fd654784d0cb1e0533524a26ec05d16cf59545ac56b84b3f4f5e4f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:37.107724Z","signature_b64":"NUDy0Rb81s6XEwK6yVg3waBt6WeHxHtbtmHwXmo70UMs3UhclJjZ8kmxjLzchPL7JlGiuPmVMmapd075a2q5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ab061f7f623bef130a15fd0cb4c0623b8483e9a22ece00a40cdb15591b0410c","last_reissued_at":"2026-07-05T00:54:37.107279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:37.107279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.AP"],"primary_cat":"cs.DS","authors_text":"Debabrota Basu, Laurent Decreusefond, Naheed Anjum Arafat, Stephane Bressan","submitted_at":"2020-04-11T15:44:14Z","abstract_excerpt":"We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte Carlo approaches. Our algorithms leverage the transposition of properties and algorithms devised for matrices constituted of zeros and ones with prescribed row- and column-sums to hypergraphs. The construction algorithm extends the applicability of Markov chain Monte Carlo approaches when the initial hypergraph is not provided. The random generation algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05429","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/2004.05429/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":"2004.05429","created_at":"2026-07-05T00:54:37.107343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05429v1","created_at":"2026-07-05T00:54:37.107343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05429","created_at":"2026-07-05T00:54:37.107343+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKYGD57WEO7P","created_at":"2026-07-05T00:54:37.107343+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKYGD57WEO7PCMFB","created_at":"2026-07-05T00:54:37.107343+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKYGD57W","created_at":"2026-07-05T00:54:37.107343+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/LKYGD57WEO7PCMFBL7IMWTAGEO","json":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO.json","graph_json":"https://pith.science/api/pith-number/LKYGD57WEO7PCMFBL7IMWTAGEO/graph.json","events_json":"https://pith.science/api/pith-number/LKYGD57WEO7PCMFBL7IMWTAGEO/events.json","paper":"https://pith.science/paper/LKYGD57W"},"agent_actions":{"view_html":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO","download_json":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO.json","view_paper":"https://pith.science/paper/LKYGD57W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05429&json=true","fetch_graph":"https://pith.science/api/pith-number/LKYGD57WEO7PCMFBL7IMWTAGEO/graph.json","fetch_events":"https://pith.science/api/pith-number/LKYGD57WEO7PCMFBL7IMWTAGEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO/action/storage_attestation","attest_author":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO/action/author_attestation","sign_citation":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO/action/citation_signature","submit_replication":"https://pith.science/pith/LKYGD57WEO7PCMFBL7IMWTAGEO/action/replication_record"}},"created_at":"2026-07-05T00:54:37.107343+00:00","updated_at":"2026-07-05T00:54:37.107343+00:00"}