{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2XFHOE7DMIEC3LBVRJ3CVJV2OH","short_pith_number":"pith:2XFHOE7D","schema_version":"1.0","canonical_sha256":"d5ca7713e362082dac358a762aa6ba71c6eb1041b0dfaa17c741ce36019ea88d","source":{"kind":"arxiv","id":"1809.03488","version":1},"attestation_state":"computed","paper":{"title":"The HyperKron Graph Model for higher-order features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Arjun S. Ramani, David F. Gleich, Nicole Eikmeier","submitted_at":"2018-09-10T17:59:28Z","abstract_excerpt":"Graph models have long been used in lieu of real data which can be expensive and hard to come by. A common class of models constructs a matrix of probabilities, and samples an adjacency matrix by flipping a weighted coin for each entry. Examples include the Erd\\H{o}s-R\\'{e}nyi model, Chung-Lu model, and the Kronecker model. Here we present the HyperKron Graph model: an extension of the Kronecker Model, but with a distribution over hyperedges. We prove that we can efficiently generate graphs from this model in order proportional to the number of edges times a small log-factor, and find that in "},"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":"1809.03488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-10T17:59:28Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"eaa486092a5589fcfd7c762ddc3832a4f7751585a2afef0031e9aa280970e2b6","abstract_canon_sha256":"bfc4142696320358ca7fe28e5cd7826d2af180c49c84d7370930249bda89e672"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:06.750175Z","signature_b64":"DsnFLL4HvW0oAyfLCENmDh2pKyL6xgAbQ7n0xfKK2C/8PcQoV20tVcyg8mF7VqnhnwdV4AfqA/0fZa6jY01cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5ca7713e362082dac358a762aa6ba71c6eb1041b0dfaa17c741ce36019ea88d","last_reissued_at":"2026-05-18T00:06:06.749672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:06.749672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The HyperKron Graph Model for higher-order features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Arjun S. Ramani, David F. Gleich, Nicole Eikmeier","submitted_at":"2018-09-10T17:59:28Z","abstract_excerpt":"Graph models have long been used in lieu of real data which can be expensive and hard to come by. A common class of models constructs a matrix of probabilities, and samples an adjacency matrix by flipping a weighted coin for each entry. Examples include the Erd\\H{o}s-R\\'{e}nyi model, Chung-Lu model, and the Kronecker model. Here we present the HyperKron Graph model: an extension of the Kronecker Model, but with a distribution over hyperedges. We prove that we can efficiently generate graphs from this model in order proportional to the number of edges times a small log-factor, and find that in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03488","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":"1809.03488","created_at":"2026-05-18T00:06:06.749745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03488v1","created_at":"2026-05-18T00:06:06.749745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03488","created_at":"2026-05-18T00:06:06.749745+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XFHOE7DMIEC","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XFHOE7DMIEC3LBV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XFHOE7D","created_at":"2026-05-18T12:32:02.567920+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/2XFHOE7DMIEC3LBVRJ3CVJV2OH","json":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH.json","graph_json":"https://pith.science/api/pith-number/2XFHOE7DMIEC3LBVRJ3CVJV2OH/graph.json","events_json":"https://pith.science/api/pith-number/2XFHOE7DMIEC3LBVRJ3CVJV2OH/events.json","paper":"https://pith.science/paper/2XFHOE7D"},"agent_actions":{"view_html":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH","download_json":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH.json","view_paper":"https://pith.science/paper/2XFHOE7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03488&json=true","fetch_graph":"https://pith.science/api/pith-number/2XFHOE7DMIEC3LBVRJ3CVJV2OH/graph.json","fetch_events":"https://pith.science/api/pith-number/2XFHOE7DMIEC3LBVRJ3CVJV2OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH/action/storage_attestation","attest_author":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH/action/author_attestation","sign_citation":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH/action/citation_signature","submit_replication":"https://pith.science/pith/2XFHOE7DMIEC3LBVRJ3CVJV2OH/action/replication_record"}},"created_at":"2026-05-18T00:06:06.749745+00:00","updated_at":"2026-05-18T00:06:06.749745+00:00"}