{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7EEHBDEWRIWGHHU2AR74OETTPD","short_pith_number":"pith:7EEHBDEW","schema_version":"1.0","canonical_sha256":"f908708c968a2c639e9a047fc7127378c9303e80fe870da80f2a1f9397354cfa","source":{"kind":"arxiv","id":"1904.08287","version":1},"attestation_state":"computed","paper":{"title":"Higher dimensional connectivity and minimal degree of random graphs with an eye towards minimal free resolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AT","math.PR"],"primary_cat":"math.CO","authors_text":"Eric Babson, Volkmar Welker","submitted_at":"2019-04-17T14:21:43Z","abstract_excerpt":"In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for Erdoes-Renyi random graphs. We show the same in the one dimensional case for a middle density regime and show the easier inequality for all dimensions in the same regime. Our original motivation comes from the study of minimal free resolutions of Stanley-Reisner rings of clique complexes of graphs in commutative algebra, In that setting the higher dimensional vertex "},"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":"1904.08287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-17T14:21:43Z","cross_cats_sorted":["math.AC","math.AT","math.PR"],"title_canon_sha256":"3f20ff030bdf37f1e2ff14edd238b51ae0de5bcb0cc88eadc2c7119231f51264","abstract_canon_sha256":"243328612fb85e532a7882466730e531651b10bd346f82df318b426c77d55426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.129163Z","signature_b64":"cgdxpzjvOxvPtAdFNjpf0vERwmmmK3fZJw4aAaz7KygjTunouR5bRYNKavAoUW6yk1mISK11WFNaEnHGkMH5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f908708c968a2c639e9a047fc7127378c9303e80fe870da80f2a1f9397354cfa","last_reissued_at":"2026-05-17T23:48:18.128551Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.128551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher dimensional connectivity and minimal degree of random graphs with an eye towards minimal free resolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AT","math.PR"],"primary_cat":"math.CO","authors_text":"Eric Babson, Volkmar Welker","submitted_at":"2019-04-17T14:21:43Z","abstract_excerpt":"In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for Erdoes-Renyi random graphs. We show the same in the one dimensional case for a middle density regime and show the easier inequality for all dimensions in the same regime. Our original motivation comes from the study of minimal free resolutions of Stanley-Reisner rings of clique complexes of graphs in commutative algebra, In that setting the higher dimensional vertex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08287","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":"1904.08287","created_at":"2026-05-17T23:48:18.128667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08287v1","created_at":"2026-05-17T23:48:18.128667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08287","created_at":"2026-05-17T23:48:18.128667+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EEHBDEWRIWG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EEHBDEWRIWGHHU2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EEHBDEW","created_at":"2026-05-18T12:33:12.712433+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/7EEHBDEWRIWGHHU2AR74OETTPD","json":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD.json","graph_json":"https://pith.science/api/pith-number/7EEHBDEWRIWGHHU2AR74OETTPD/graph.json","events_json":"https://pith.science/api/pith-number/7EEHBDEWRIWGHHU2AR74OETTPD/events.json","paper":"https://pith.science/paper/7EEHBDEW"},"agent_actions":{"view_html":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD","download_json":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD.json","view_paper":"https://pith.science/paper/7EEHBDEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08287&json=true","fetch_graph":"https://pith.science/api/pith-number/7EEHBDEWRIWGHHU2AR74OETTPD/graph.json","fetch_events":"https://pith.science/api/pith-number/7EEHBDEWRIWGHHU2AR74OETTPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD/action/storage_attestation","attest_author":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD/action/author_attestation","sign_citation":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD/action/citation_signature","submit_replication":"https://pith.science/pith/7EEHBDEWRIWGHHU2AR74OETTPD/action/replication_record"}},"created_at":"2026-05-17T23:48:18.128667+00:00","updated_at":"2026-05-17T23:48:18.128667+00:00"}