{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:HQLMJDKVHNXWMLLPGDVW4S5ET6","short_pith_number":"pith:HQLMJDKV","canonical_record":{"source":{"id":"0908.1759","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-08-12T18:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"81cd06e7ae1d7523adca902cbef6b62d55b1c62d2422ec4440cdc510c371e688","abstract_canon_sha256":"9dbcbe55afe47ae7fd394aac6e3e9f8b847c724e1d8ca26bcae91416c4f47aeb"},"schema_version":"1.0"},"canonical_sha256":"3c16c48d553b6f662d6f30eb6e4ba49fb86a6426201e05e79c41ec43ca365347","source":{"kind":"arxiv","id":"0908.1759","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1759","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1759v2","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1759","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"HQLMJDKVHNXW","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HQLMJDKVHNXWMLLP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HQLMJDKV","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:HQLMJDKVHNXWMLLPGDVW4S5ET6","target":"record","payload":{"canonical_record":{"source":{"id":"0908.1759","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-08-12T18:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"81cd06e7ae1d7523adca902cbef6b62d55b1c62d2422ec4440cdc510c371e688","abstract_canon_sha256":"9dbcbe55afe47ae7fd394aac6e3e9f8b847c724e1d8ca26bcae91416c4f47aeb"},"schema_version":"1.0"},"canonical_sha256":"3c16c48d553b6f662d6f30eb6e4ba49fb86a6426201e05e79c41ec43ca365347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:34.894002Z","signature_b64":"8AcdRCv/gn45URWkwMvoscxsoR+LYmnRBfqc0bC4agTSjMGXTJm/pm+DQK8DBVKombXmqeMWSK2OmIt60+QlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c16c48d553b6f662d6f30eb6e4ba49fb86a6426201e05e79c41ec43ca365347","last_reissued_at":"2026-05-18T02:12:34.893350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:34.893350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.1759","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-18T02:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jnm3qHZeESe7zSlPGdGVjV8zzf+JKfu5x3VUjc4ex/dz4N0ZXsgzFT17DUYfpcTFlhjVgWBAHIhfIotZvQpqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:20:42.394626Z"},"content_sha256":"ba51bc920b3d88c0eb2f15ad3b8c4ae83ddc5bc4ff912cbd0d1037b4a8bb1654","schema_version":"1.0","event_id":"sha256:ba51bc920b3d88c0eb2f15ad3b8c4ae83ddc5bc4ff912cbd0d1037b4a8bb1654"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:HQLMJDKVHNXWMLLPGDVW4S5ET6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"A. Annibale, A.C.C. Coolen, F. Fraternali, J. Kleinjung, L.P. Fernandes","submitted_at":"2009-08-12T18:14:43Z","abstract_excerpt":"We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of degree statistics. Our family of ensembles can produce graphs with any prescribed degree distribution and any degree-degree correlation function, its control parameters can be calculated fully analytically, and as a result we can calculate (asymptotically) formulae for entropies and complexities, and for information-theoretic distances between networks, expres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1759","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-18T02:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoLytBaALqcyc07Q6tp6lT2NnItLw/YajOXJ227vLeQFxujzuUrIq3QTsCedcZNQznC7YDdKktdOhn2iC131DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:20:42.395265Z"},"content_sha256":"ed8280e4f4a87fc5aa3c20db581502b431fbfe539c6219add2063a4858dab987","schema_version":"1.0","event_id":"sha256:ed8280e4f4a87fc5aa3c20db581502b431fbfe539c6219add2063a4858dab987"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/bundle.json","state_url":"https://pith.science/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/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-27T15:20:42Z","links":{"resolver":"https://pith.science/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6","bundle":"https://pith.science/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/bundle.json","state":"https://pith.science/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQLMJDKVHNXWMLLPGDVW4S5ET6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:HQLMJDKVHNXWMLLPGDVW4S5ET6","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":"9dbcbe55afe47ae7fd394aac6e3e9f8b847c724e1d8ca26bcae91416c4f47aeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-08-12T18:14:43Z","title_canon_sha256":"81cd06e7ae1d7523adca902cbef6b62d55b1c62d2422ec4440cdc510c371e688"},"schema_version":"1.0","source":{"id":"0908.1759","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1759","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1759v2","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1759","created_at":"2026-05-18T02:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"HQLMJDKVHNXW","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HQLMJDKVHNXWMLLP","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HQLMJDKV","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:ed8280e4f4a87fc5aa3c20db581502b431fbfe539c6219add2063a4858dab987","target":"graph","created_at":"2026-05-18T02:12:34Z","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":"We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of degree statistics. Our family of ensembles can produce graphs with any prescribed degree distribution and any degree-degree correlation function, its control parameters can be calculated fully analytically, and as a result we can calculate (asymptotically) formulae for entropies and complexities, and for information-theoretic distances between networks, expres","authors_text":"A. Annibale, A.C.C. Coolen, F. Fraternali, J. Kleinjung, L.P. Fernandes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-08-12T18:14:43Z","title":"Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1759","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:ba51bc920b3d88c0eb2f15ad3b8c4ae83ddc5bc4ff912cbd0d1037b4a8bb1654","target":"record","created_at":"2026-05-18T02:12:34Z","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":"9dbcbe55afe47ae7fd394aac6e3e9f8b847c724e1d8ca26bcae91416c4f47aeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2009-08-12T18:14:43Z","title_canon_sha256":"81cd06e7ae1d7523adca902cbef6b62d55b1c62d2422ec4440cdc510c371e688"},"schema_version":"1.0","source":{"id":"0908.1759","kind":"arxiv","version":2}},"canonical_sha256":"3c16c48d553b6f662d6f30eb6e4ba49fb86a6426201e05e79c41ec43ca365347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c16c48d553b6f662d6f30eb6e4ba49fb86a6426201e05e79c41ec43ca365347","first_computed_at":"2026-05-18T02:12:34.893350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:34.893350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8AcdRCv/gn45URWkwMvoscxsoR+LYmnRBfqc0bC4agTSjMGXTJm/pm+DQK8DBVKombXmqeMWSK2OmIt60+QlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:34.894002Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.1759","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba51bc920b3d88c0eb2f15ad3b8c4ae83ddc5bc4ff912cbd0d1037b4a8bb1654","sha256:ed8280e4f4a87fc5aa3c20db581502b431fbfe539c6219add2063a4858dab987"],"state_sha256":"37197ad9c5f030eb0ea1a59027a6ad0a4ca3ef9684182f3e808a7f1c3e9b3cfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXoy9AZ61TGA5sakZst77kYIKYCTjW7UfKhfMi4tZOgHvWWOlnDHgHs6rzB6xN9gaQzeKe1/GBOTqqhsd42wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:20:42.398758Z","bundle_sha256":"c547feb5968f6596997e10f246428d17563419426f2ec65a54f220ec591e91c7"}}