{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:D7A2KXMTWYRQDPGYFGC44PNG47","short_pith_number":"pith:D7A2KXMT","canonical_record":{"source":{"id":"2606.17912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T13:34:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3fa081ec3200332cf268eaf75d8d9de59f439e13ef814a107b1bfa8b4ed3645c","abstract_canon_sha256":"4ff3bf5b9b6a877d4e2e3e437b81cd4b181774405e2789e2d32335bfb4bbe102"},"schema_version":"1.0"},"canonical_sha256":"1fc1a55d93b62301bcd82985ce3da6e7feb58d36641a899d728db675e21dc3d6","source":{"kind":"arxiv","id":"2606.17912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17912","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17912v1","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17912","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"D7A2KXMTWYRQ","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"D7A2KXMTWYRQDPGY","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"D7A2KXMT","created_at":"2026-06-19T16:10:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:D7A2KXMTWYRQDPGYFGC44PNG47","target":"record","payload":{"canonical_record":{"source":{"id":"2606.17912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T13:34:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3fa081ec3200332cf268eaf75d8d9de59f439e13ef814a107b1bfa8b4ed3645c","abstract_canon_sha256":"4ff3bf5b9b6a877d4e2e3e437b81cd4b181774405e2789e2d32335bfb4bbe102"},"schema_version":"1.0"},"canonical_sha256":"1fc1a55d93b62301bcd82985ce3da6e7feb58d36641a899d728db675e21dc3d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:43.426329Z","signature_b64":"Xka+jIo6y5gXEpnIwzSmiNmKWarHbfurTbNDEoVcHFhB/8ZtgMwG6cpUzptrmZ6MbqKP4oOGnpyT0qa0Zv0BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fc1a55d93b62301bcd82985ce3da6e7feb58d36641a899d728db675e21dc3d6","last_reissued_at":"2026-06-19T16:10:43.425948Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:43.425948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.17912","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-06-19T16:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGyaxZk0Khgm1n/oFUgAEMd1A4+1kHHFANAWGlTAbb4NOCKUxutPH/sPdx9/abz7GD5LLemfhY4rBB7sSOkrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:35:34.736138Z"},"content_sha256":"6d5130d9f6a422ccea328cca1b29be803b05313c0dd336dac56fdfb6637df76f","schema_version":"1.0","event_id":"sha256:6d5130d9f6a422ccea328cca1b29be803b05313c0dd336dac56fdfb6637df76f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:D7A2KXMTWYRQDPGYFGC44PNG47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotics of the number of labelled connected sparse multitype graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Luisa Andreis, Mario Veshaj","submitted_at":"2026-06-16T13:34:03Z","abstract_excerpt":"We study the asymptotic enumeration of labelled connected multitype graphs in the sparse regime, where both the number of vertices and edges grow linearly and the excess is proportional to the size of the graph. Extending the classical theory of connected graph enumeration to the multitype setting, we consider graphs with prescribed numbers of vertices of each type and prescribed edge counts between each pair of types. Our approach is probabilistic and relies on the theory of inhomogeneous random graphs. In particular, we exploit large-deviation principles and asymptotic estimates for connecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17912","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.17912/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-19T16:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+RaEEJYGeRKApfqvSLEfAa8QyT6Mx6pDjVnTbWmJQv320H259SolvXwjjGCRCK5kQMUOlt2opKGsnrsrgJddCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:35:34.736554Z"},"content_sha256":"7f9fd6240ee8c64dfef1f5d66da17e613c8c25d13e8d1c3441d8c705054014f0","schema_version":"1.0","event_id":"sha256:7f9fd6240ee8c64dfef1f5d66da17e613c8c25d13e8d1c3441d8c705054014f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7A2KXMTWYRQDPGYFGC44PNG47/bundle.json","state_url":"https://pith.science/pith/D7A2KXMTWYRQDPGYFGC44PNG47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7A2KXMTWYRQDPGYFGC44PNG47/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-22T12:35:34Z","links":{"resolver":"https://pith.science/pith/D7A2KXMTWYRQDPGYFGC44PNG47","bundle":"https://pith.science/pith/D7A2KXMTWYRQDPGYFGC44PNG47/bundle.json","state":"https://pith.science/pith/D7A2KXMTWYRQDPGYFGC44PNG47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7A2KXMTWYRQDPGYFGC44PNG47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D7A2KXMTWYRQDPGYFGC44PNG47","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":"4ff3bf5b9b6a877d4e2e3e437b81cd4b181774405e2789e2d32335bfb4bbe102","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T13:34:03Z","title_canon_sha256":"3fa081ec3200332cf268eaf75d8d9de59f439e13ef814a107b1bfa8b4ed3645c"},"schema_version":"1.0","source":{"id":"2606.17912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17912","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17912v1","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17912","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"D7A2KXMTWYRQ","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"D7A2KXMTWYRQDPGY","created_at":"2026-06-19T16:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"D7A2KXMT","created_at":"2026-06-19T16:10:43Z"}],"graph_snapshots":[{"event_id":"sha256:7f9fd6240ee8c64dfef1f5d66da17e613c8c25d13e8d1c3441d8c705054014f0","target":"graph","created_at":"2026-06-19T16:10:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.17912/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the asymptotic enumeration of labelled connected multitype graphs in the sparse regime, where both the number of vertices and edges grow linearly and the excess is proportional to the size of the graph. Extending the classical theory of connected graph enumeration to the multitype setting, we consider graphs with prescribed numbers of vertices of each type and prescribed edge counts between each pair of types. Our approach is probabilistic and relies on the theory of inhomogeneous random graphs. In particular, we exploit large-deviation principles and asymptotic estimates for connecte","authors_text":"Luisa Andreis, Mario Veshaj","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T13:34:03Z","title":"Asymptotics of the number of labelled connected sparse multitype graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17912","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:6d5130d9f6a422ccea328cca1b29be803b05313c0dd336dac56fdfb6637df76f","target":"record","created_at":"2026-06-19T16:10:43Z","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":"4ff3bf5b9b6a877d4e2e3e437b81cd4b181774405e2789e2d32335bfb4bbe102","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T13:34:03Z","title_canon_sha256":"3fa081ec3200332cf268eaf75d8d9de59f439e13ef814a107b1bfa8b4ed3645c"},"schema_version":"1.0","source":{"id":"2606.17912","kind":"arxiv","version":1}},"canonical_sha256":"1fc1a55d93b62301bcd82985ce3da6e7feb58d36641a899d728db675e21dc3d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fc1a55d93b62301bcd82985ce3da6e7feb58d36641a899d728db675e21dc3d6","first_computed_at":"2026-06-19T16:10:43.425948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:43.425948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xka+jIo6y5gXEpnIwzSmiNmKWarHbfurTbNDEoVcHFhB/8ZtgMwG6cpUzptrmZ6MbqKP4oOGnpyT0qa0Zv0BCg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:43.426329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d5130d9f6a422ccea328cca1b29be803b05313c0dd336dac56fdfb6637df76f","sha256:7f9fd6240ee8c64dfef1f5d66da17e613c8c25d13e8d1c3441d8c705054014f0"],"state_sha256":"eabc99221d6b4a53543420f213a84c9f7fb753d68cc2c6ee3e91f53bfe00d913"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"En4mLqDUZejbGwSGo+PQD5Fw27TiJ84ZWJG1cnzCAeAvKZg2Ik+ryvYcIGg9SiqF2wTKeUNmeIx/0biLG5cfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:35:34.738653Z","bundle_sha256":"891fe33c8ddcc29da493db8c14aea0244a9c84cd963c2e768df1228905e3b820"}}