{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I73ACZXJGEPDOXVWUICAFGUNS4","short_pith_number":"pith:I73ACZXJ","canonical_record":{"source":{"id":"1302.2830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-12T15:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"99e043811366af45c122c72ca1bb7f052145bf6b7706e2555d1c4498d4a51ec3","abstract_canon_sha256":"23ec9cfd7a4071fe50f9f1bec491ac7792b07e56245c9251f9158c93dc76748c"},"schema_version":"1.0"},"canonical_sha256":"47f60166e9311e375eb6a204029a8d97294d7d4f4df7e91d374964f8ccfc09c5","source":{"kind":"arxiv","id":"1302.2830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2830","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2830v2","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2830","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"I73ACZXJGEPD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I73ACZXJGEPDOXVW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I73ACZXJ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I73ACZXJGEPDOXVWUICAFGUNS4","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-12T15:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"99e043811366af45c122c72ca1bb7f052145bf6b7706e2555d1c4498d4a51ec3","abstract_canon_sha256":"23ec9cfd7a4071fe50f9f1bec491ac7792b07e56245c9251f9158c93dc76748c"},"schema_version":"1.0"},"canonical_sha256":"47f60166e9311e375eb6a204029a8d97294d7d4f4df7e91d374964f8ccfc09c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:51.413424Z","signature_b64":"OaB3zjRa9VzVtY4Y5Z/5xVS/PyZHkJbYpSbzPdXrbhCueNdWlC1c07mmDhgdZaOBvNM06aGo+bddGq7tCNzXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47f60166e9311e375eb6a204029a8d97294d7d4f4df7e91d374964f8ccfc09c5","last_reissued_at":"2026-05-18T03:18:51.412827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:51.412827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2830","source_version":2,"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-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mK0AZuq00H+6+atudxNfJUmJcZko8GGhftZTaLg8pEEZ5s7c9hrbsoq7chWf8xTdhVlWkTiyh3x72qQl7a8DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:33.687669Z"},"content_sha256":"9d741110a1d4de0006365ab4fe1b6203324951a11a59c5df517f60bbb896ac98","schema_version":"1.0","event_id":"sha256:9d741110a1d4de0006365ab4fe1b6203324951a11a59c5df517f60bbb896ac98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I73ACZXJGEPDOXVWUICAFGUNS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distribution of the number of node neighbors in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Eduardo L\\'opez","submitted_at":"2013-02-12T15:51:14Z","abstract_excerpt":"Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree $\\ell$ (number of hyperedges connected to a node) and the number of neighbors $k$ of a node differ from each other in contrast to the case of graphs. Here, I calculate the distribution of the number of node neighbors in random hypergraphs in which hyperedges of uniform rank $r$ have a homogeneous probability $p$ to appear. This distribution is equivalent to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2830","kind":"arxiv","version":2},"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-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gIXEIDHHCylcJkjINxDSgGFfDTVAiv2dBn23ciDpPST6vDskZKvL39Q/G2pOqDs14kgR5CxUD4jiPfAfZbigCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:59:33.688011Z"},"content_sha256":"f5b7823118c87401d7a153d6dacc1da6cfff1fb8c30461306c4122662493aeb8","schema_version":"1.0","event_id":"sha256:f5b7823118c87401d7a153d6dacc1da6cfff1fb8c30461306c4122662493aeb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I73ACZXJGEPDOXVWUICAFGUNS4/bundle.json","state_url":"https://pith.science/pith/I73ACZXJGEPDOXVWUICAFGUNS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I73ACZXJGEPDOXVWUICAFGUNS4/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-20T07:59:33Z","links":{"resolver":"https://pith.science/pith/I73ACZXJGEPDOXVWUICAFGUNS4","bundle":"https://pith.science/pith/I73ACZXJGEPDOXVWUICAFGUNS4/bundle.json","state":"https://pith.science/pith/I73ACZXJGEPDOXVWUICAFGUNS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I73ACZXJGEPDOXVWUICAFGUNS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I73ACZXJGEPDOXVWUICAFGUNS4","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":"23ec9cfd7a4071fe50f9f1bec491ac7792b07e56245c9251f9158c93dc76748c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-12T15:51:14Z","title_canon_sha256":"99e043811366af45c122c72ca1bb7f052145bf6b7706e2555d1c4498d4a51ec3"},"schema_version":"1.0","source":{"id":"1302.2830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2830","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2830v2","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2830","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"I73ACZXJGEPD","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I73ACZXJGEPDOXVW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I73ACZXJ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:f5b7823118c87401d7a153d6dacc1da6cfff1fb8c30461306c4122662493aeb8","target":"graph","created_at":"2026-05-18T03:18:51Z","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":"Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree $\\ell$ (number of hyperedges connected to a node) and the number of neighbors $k$ of a node differ from each other in contrast to the case of graphs. Here, I calculate the distribution of the number of node neighbors in random hypergraphs in which hyperedges of uniform rank $r$ have a homogeneous probability $p$ to appear. This distribution is equivalent to ","authors_text":"Eduardo L\\'opez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-12T15:51:14Z","title":"The distribution of the number of node neighbors in random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2830","kind":"arxiv","version":2},"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:9d741110a1d4de0006365ab4fe1b6203324951a11a59c5df517f60bbb896ac98","target":"record","created_at":"2026-05-18T03:18:51Z","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":"23ec9cfd7a4071fe50f9f1bec491ac7792b07e56245c9251f9158c93dc76748c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-02-12T15:51:14Z","title_canon_sha256":"99e043811366af45c122c72ca1bb7f052145bf6b7706e2555d1c4498d4a51ec3"},"schema_version":"1.0","source":{"id":"1302.2830","kind":"arxiv","version":2}},"canonical_sha256":"47f60166e9311e375eb6a204029a8d97294d7d4f4df7e91d374964f8ccfc09c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47f60166e9311e375eb6a204029a8d97294d7d4f4df7e91d374964f8ccfc09c5","first_computed_at":"2026-05-18T03:18:51.412827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:51.412827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OaB3zjRa9VzVtY4Y5Z/5xVS/PyZHkJbYpSbzPdXrbhCueNdWlC1c07mmDhgdZaOBvNM06aGo+bddGq7tCNzXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:51.413424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d741110a1d4de0006365ab4fe1b6203324951a11a59c5df517f60bbb896ac98","sha256:f5b7823118c87401d7a153d6dacc1da6cfff1fb8c30461306c4122662493aeb8"],"state_sha256":"2453b0829babb917cbd3d4c373cadf9f44c69c9c67454cae768d4520a5ee646a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqdVhnKjx0EDcXJm1whU909RFVW/0FJ3TVW5LC/t9yjZbDBR5tRIpIzlxffdZ3rieY35+0uCbe+Ck3TQhLffCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:59:33.689893Z","bundle_sha256":"2209c94c68473a6391716786b4d2f43b1daefeaf7f67707ab8ee70dde67938f5"}}