{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HN7PDQQ4HTB6MY7MUPD37P2UU6","short_pith_number":"pith:HN7PDQQ4","canonical_record":{"source":{"id":"1501.07775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-30T13:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"0bab6d125d9f63747a8292efb0d94030d429e23e47b39fb932c0bdd82dc12369","abstract_canon_sha256":"6c60fbd5c9594b8f7efcc121d21e818e3d0cbf6edd28848014e182d2d73cf067"},"schema_version":"1.0"},"canonical_sha256":"3b7ef1c21c3cc3e663eca3c7bfbf54a7bff6884db2fe552ee04ce7f40a09c6ca","source":{"kind":"arxiv","id":"1501.07775","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07775","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07775v2","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07775","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"HN7PDQQ4HTB6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HN7PDQQ4HTB6MY7M","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HN7PDQQ4","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HN7PDQQ4HTB6MY7MUPD37P2UU6","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-30T13:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"0bab6d125d9f63747a8292efb0d94030d429e23e47b39fb932c0bdd82dc12369","abstract_canon_sha256":"6c60fbd5c9594b8f7efcc121d21e818e3d0cbf6edd28848014e182d2d73cf067"},"schema_version":"1.0"},"canonical_sha256":"3b7ef1c21c3cc3e663eca3c7bfbf54a7bff6884db2fe552ee04ce7f40a09c6ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:46.353503Z","signature_b64":"E7fGF289V8NkewVsbDq+p4GOuQsDV/WMG91ajFFj+JUOpYmNmffVwlKLYe+UI1sujFi2x0AKpJcTNHlr7xZFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b7ef1c21c3cc3e663eca3c7bfbf54a7bff6884db2fe552ee04ce7f40a09c6ca","last_reissued_at":"2026-05-18T01:27:46.352927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:46.352927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07775","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-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBLtmWDCcA626DYu+49OZAWbv5fhH4MuKucse85ySvPlzfliEymhJPL5p27GOo5uhEFzv/KIZn96xA/QXUBiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:24:32.371410Z"},"content_sha256":"53a2f66658829760b1c5cc9f378deba9f88a8ff43e92e025e7a44255eaf4e3d5","schema_version":"1.0","event_id":"sha256:53a2f66658829760b1c5cc9f378deba9f88a8ff43e92e025e7a44255eaf4e3d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HN7PDQQ4HTB6MY7MUPD37P2UU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration and structure of inhomogeneous graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Elie de Panafieu","submitted_at":"2015-01-30T13:54:06Z","abstract_excerpt":"We analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the \"inhomogeneous graph model\" of S\\\"oderberg (2002). Each vertex receives a \"type\" among a set of $q$ possibilities as well as a \"weight\" corresponding to this type, and each edge is weighted according to the types of the vertices it links. The weight of the graph is then the product of the weights of its vertices and edges. We investigate the sum of the weights of such graphs and prove that when the number of edges is small, almost all of them contain no component with more than o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07775","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-18T01:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehOAoU8UejDc/3j/D7qPqMfPLidk1VdmK9zXpWhpvbUzMrUNnx4PEr/E43CDESUeXhRH5aeLpxYi2Ay6CTEVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:24:32.372086Z"},"content_sha256":"c0eb718dc448dfe4ef8315f654873c489ba8cd7d3793fd5c8d52f6dd7f4186ba","schema_version":"1.0","event_id":"sha256:c0eb718dc448dfe4ef8315f654873c489ba8cd7d3793fd5c8d52f6dd7f4186ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/bundle.json","state_url":"https://pith.science/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/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-31T23:24:32Z","links":{"resolver":"https://pith.science/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6","bundle":"https://pith.science/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/bundle.json","state":"https://pith.science/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HN7PDQQ4HTB6MY7MUPD37P2UU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HN7PDQQ4HTB6MY7MUPD37P2UU6","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":"6c60fbd5c9594b8f7efcc121d21e818e3d0cbf6edd28848014e182d2d73cf067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-30T13:54:06Z","title_canon_sha256":"0bab6d125d9f63747a8292efb0d94030d429e23e47b39fb932c0bdd82dc12369"},"schema_version":"1.0","source":{"id":"1501.07775","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07775","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07775v2","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07775","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"HN7PDQQ4HTB6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HN7PDQQ4HTB6MY7M","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HN7PDQQ4","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:c0eb718dc448dfe4ef8315f654873c489ba8cd7d3793fd5c8d52f6dd7f4186ba","target":"graph","created_at":"2026-05-18T01:27:46Z","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 analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the \"inhomogeneous graph model\" of S\\\"oderberg (2002). Each vertex receives a \"type\" among a set of $q$ possibilities as well as a \"weight\" corresponding to this type, and each edge is weighted according to the types of the vertices it links. The weight of the graph is then the product of the weights of its vertices and edges. We investigate the sum of the weights of such graphs and prove that when the number of edges is small, almost all of them contain no component with more than o","authors_text":"\\'Elie de Panafieu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-30T13:54:06Z","title":"Enumeration and structure of inhomogeneous graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07775","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:53a2f66658829760b1c5cc9f378deba9f88a8ff43e92e025e7a44255eaf4e3d5","target":"record","created_at":"2026-05-18T01:27:46Z","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":"6c60fbd5c9594b8f7efcc121d21e818e3d0cbf6edd28848014e182d2d73cf067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-30T13:54:06Z","title_canon_sha256":"0bab6d125d9f63747a8292efb0d94030d429e23e47b39fb932c0bdd82dc12369"},"schema_version":"1.0","source":{"id":"1501.07775","kind":"arxiv","version":2}},"canonical_sha256":"3b7ef1c21c3cc3e663eca3c7bfbf54a7bff6884db2fe552ee04ce7f40a09c6ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b7ef1c21c3cc3e663eca3c7bfbf54a7bff6884db2fe552ee04ce7f40a09c6ca","first_computed_at":"2026-05-18T01:27:46.352927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:46.352927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E7fGF289V8NkewVsbDq+p4GOuQsDV/WMG91ajFFj+JUOpYmNmffVwlKLYe+UI1sujFi2x0AKpJcTNHlr7xZFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:46.353503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07775","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53a2f66658829760b1c5cc9f378deba9f88a8ff43e92e025e7a44255eaf4e3d5","sha256:c0eb718dc448dfe4ef8315f654873c489ba8cd7d3793fd5c8d52f6dd7f4186ba"],"state_sha256":"4bb09d739674375f62f0f9a34a8c2b00dd5134993cf5d11cf6c307d7d245c8c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4+LC/QdMoHIwO6IgmablejtWq/gKyqgmA7pCih8ywf+KfZbvL26B/L1jwZ4GDnEpkhniytXrEwhjFHgT6+sAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:24:32.375659Z","bundle_sha256":"da2f4ef0d03caef5aba7d2a7a317b71d5b42f83970e4ce76d602d454beb6567d"}}