{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U6Z5YUCKJVWQRSDV7S3CFZ2KAA","short_pith_number":"pith:U6Z5YUCK","canonical_record":{"source":{"id":"1402.6787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-27T04:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"59be495b3c22f19214b2d02be85a23babe00cec68d53e3b7de38934acc52771e","abstract_canon_sha256":"cb7e64304f6b47497208dfd0977c25d71acd507c55181cbb2edc58fd2937fa0b"},"schema_version":"1.0"},"canonical_sha256":"a7b3dc504a4d6d08c875fcb622e74a00173ff0941a29caec900bb1018225ad8d","source":{"kind":"arxiv","id":"1402.6787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6787","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6787v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6787","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6Z5YUCKJVWQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6Z5YUCKJVWQRSDV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6Z5YUCK","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U6Z5YUCKJVWQRSDV7S3CFZ2KAA","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-27T04:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"59be495b3c22f19214b2d02be85a23babe00cec68d53e3b7de38934acc52771e","abstract_canon_sha256":"cb7e64304f6b47497208dfd0977c25d71acd507c55181cbb2edc58fd2937fa0b"},"schema_version":"1.0"},"canonical_sha256":"a7b3dc504a4d6d08c875fcb622e74a00173ff0941a29caec900bb1018225ad8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.486760Z","signature_b64":"A1s1qcMDpqt4fTOZ9Xx2t/Va1FIodgASHcbZYiH6P9ESghco/ARqnufLpyMDqh5bCIWOcJIXuSxwfzserXi/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b3dc504a4d6d08c875fcb622e74a00173ff0941a29caec900bb1018225ad8d","last_reissued_at":"2026-05-18T00:26:47.486065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.486065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6787","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-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPJxbmKt9Eo/dDSzdydw/2p04EZ08qqb05TqzsOdadDlpwa6zA1bJhCfmaaB5D8B8HZy1aVkyznwRUxgKKmWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:45.673473Z"},"content_sha256":"407c72cf94fba6504b08db68c1dc1a57a2044dffdade9575f2f131db4ec57277","schema_version":"1.0","event_id":"sha256:407c72cf94fba6504b08db68c1dc1a57a2044dffdade9575f2f131db4ec57277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U6Z5YUCKJVWQRSDV7S3CFZ2KAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning multifractal structure in large networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Austin R. Benson, Carlos Riquelme, Sven Schmit","submitted_at":"2014-02-27T04:24:40Z","abstract_excerpt":"Generating random graphs to model networks has a rich history. In this paper, we analyze and improve upon the multifractal network generator (MFNG) introduced by Palla et al. We provide a new result on the probability of subgraphs existing in graphs generated with MFNG. From this result it follows that we can quickly compute moments of an important set of graph properties, such as the expected number of edges, stars, and cliques. Specifically, we show how to compute these moments in time complexity independent of the size of the graph and the number of recursive levels in the generative model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6787","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-18T00:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFa7fvULSvC7QOOWFA9NgxT36p874FD0FGq6t4W5vC+dAH/9pSLd3x7R1GHOL1ySYps3qp2KzNmeYQGG/SukDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:57:45.674025Z"},"content_sha256":"fdbbdc46475436275e1cfd47be67909f6f45633166d299829ca5d2fb834ad61f","schema_version":"1.0","event_id":"sha256:fdbbdc46475436275e1cfd47be67909f6f45633166d299829ca5d2fb834ad61f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/bundle.json","state_url":"https://pith.science/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/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-05-31T12:57:45Z","links":{"resolver":"https://pith.science/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA","bundle":"https://pith.science/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/bundle.json","state":"https://pith.science/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6Z5YUCKJVWQRSDV7S3CFZ2KAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U6Z5YUCKJVWQRSDV7S3CFZ2KAA","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":"cb7e64304f6b47497208dfd0977c25d71acd507c55181cbb2edc58fd2937fa0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-27T04:24:40Z","title_canon_sha256":"59be495b3c22f19214b2d02be85a23babe00cec68d53e3b7de38934acc52771e"},"schema_version":"1.0","source":{"id":"1402.6787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6787","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6787v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6787","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6Z5YUCKJVWQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6Z5YUCKJVWQRSDV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6Z5YUCK","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:fdbbdc46475436275e1cfd47be67909f6f45633166d299829ca5d2fb834ad61f","target":"graph","created_at":"2026-05-18T00:26:47Z","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":"Generating random graphs to model networks has a rich history. In this paper, we analyze and improve upon the multifractal network generator (MFNG) introduced by Palla et al. We provide a new result on the probability of subgraphs existing in graphs generated with MFNG. From this result it follows that we can quickly compute moments of an important set of graph properties, such as the expected number of edges, stars, and cliques. Specifically, we show how to compute these moments in time complexity independent of the size of the graph and the number of recursive levels in the generative model.","authors_text":"Austin R. Benson, Carlos Riquelme, Sven Schmit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-27T04:24:40Z","title":"Learning multifractal structure in large networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6787","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:407c72cf94fba6504b08db68c1dc1a57a2044dffdade9575f2f131db4ec57277","target":"record","created_at":"2026-05-18T00:26:47Z","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":"cb7e64304f6b47497208dfd0977c25d71acd507c55181cbb2edc58fd2937fa0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-02-27T04:24:40Z","title_canon_sha256":"59be495b3c22f19214b2d02be85a23babe00cec68d53e3b7de38934acc52771e"},"schema_version":"1.0","source":{"id":"1402.6787","kind":"arxiv","version":1}},"canonical_sha256":"a7b3dc504a4d6d08c875fcb622e74a00173ff0941a29caec900bb1018225ad8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7b3dc504a4d6d08c875fcb622e74a00173ff0941a29caec900bb1018225ad8d","first_computed_at":"2026-05-18T00:26:47.486065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:47.486065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A1s1qcMDpqt4fTOZ9Xx2t/Va1FIodgASHcbZYiH6P9ESghco/ARqnufLpyMDqh5bCIWOcJIXuSxwfzserXi/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:47.486760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:407c72cf94fba6504b08db68c1dc1a57a2044dffdade9575f2f131db4ec57277","sha256:fdbbdc46475436275e1cfd47be67909f6f45633166d299829ca5d2fb834ad61f"],"state_sha256":"834cf674a56473271909cf570d952c3f65c798c76abd785950089dc62c1e10f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0b2vsgQNbfqS8X7RGupUFnCewP6IDbjbPCnG7E1EFVk1XVnzfHyyJnJEB3poXt/Mjs98rbgpGbli0oQfh0XBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:57:45.677718Z","bundle_sha256":"b028f7febbd78c9624be5bcb04f7465af2487c34bbd41d2f12fbcb8b2d3142fa"}}