{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S52L42EXNGPINNUPKDREJA7XT6","short_pith_number":"pith:S52L42EX","canonical_record":{"source":{"id":"1301.0337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-02T21:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"eec2176b76812f2425c3748d11a6e7c6c5d2cbeb1a874c765c5a84f3a2df8ab2","abstract_canon_sha256":"e1a70b5cef440b2169c3f80b3c5072934ca4db07cc892f33dbcce5db4ad4a5c3"},"schema_version":"1.0"},"canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","source":{"kind":"arxiv","id":"1301.0337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0337","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0337v1","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0337","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"S52L42EXNGPI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S52L42EXNGPINNUP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S52L42EX","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S52L42EXNGPINNUPKDREJA7XT6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-02T21:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"eec2176b76812f2425c3748d11a6e7c6c5d2cbeb1a874c765c5a84f3a2df8ab2","abstract_canon_sha256":"e1a70b5cef440b2169c3f80b3c5072934ca4db07cc892f33dbcce5db4ad4a5c3"},"schema_version":"1.0"},"canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:18.127001Z","signature_b64":"J5+0tcQDl+4ukRdjsvaTKTNTr1SmFTY25uP17zhRg/1+v7HDVLjJzozQUkC7fANqnKrFLX67yLDPl/JNPeMUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","last_reissued_at":"2026-05-17T23:53:18.126384Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:18.126384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0337","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-17T23:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfvGudK4EBZaxhVN1E2gwaikNwUfPxegdQQaMsWYDsKnBe06sHZpM8nQCKYhUolr8+oZclKa9tJ0vK/HwoBWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:48:43.789568Z"},"content_sha256":"d0b56e9b6d5f06e7081498f148362ccabfe55d2a3c6842181eb4fe416711af7c","schema_version":"1.0","event_id":"sha256:d0b56e9b6d5f06e7081498f148362ccabfe55d2a3c6842181eb4fe416711af7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S52L42EXNGPINNUPKDREJA7XT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy of Some Models of Sparse Random Graphs With Vertex-Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David J. Aldous, Nathan Ross","submitted_at":"2013-01-02T21:47:27Z","abstract_excerpt":"Consider the setting of sparse graphs on N vertices, where the vertices have distinct \"names\", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some model-dependent rate constant c. The mathematical content of this paper is the (often easy) calculation of c for a variety of models, in particular for various standard random graph models adapted to this setting. Our broader purpose is to publicize this particular setting as a natural setting for future theoretical study of data compression for graphs, and (m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0337","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-17T23:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEP7pTwLTo68OtPEsdcar2tqmVIVuo+8wJPEulpXef86YPJ/2EhA6oI3lQxN3Q0cvcXBYCNcfrpRxXVPrzyoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:48:43.789922Z"},"content_sha256":"3d41a7f1620cd75a48bf49c4b2bcf284d8312c07be42239ade180fda79605674","schema_version":"1.0","event_id":"sha256:3d41a7f1620cd75a48bf49c4b2bcf284d8312c07be42239ade180fda79605674"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/bundle.json","state_url":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S52L42EXNGPINNUPKDREJA7XT6/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-27T19:48:43Z","links":{"resolver":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6","bundle":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/bundle.json","state":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S52L42EXNGPINNUPKDREJA7XT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S52L42EXNGPINNUPKDREJA7XT6","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":"e1a70b5cef440b2169c3f80b3c5072934ca4db07cc892f33dbcce5db4ad4a5c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-02T21:47:27Z","title_canon_sha256":"eec2176b76812f2425c3748d11a6e7c6c5d2cbeb1a874c765c5a84f3a2df8ab2"},"schema_version":"1.0","source":{"id":"1301.0337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0337","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0337v1","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0337","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"S52L42EXNGPI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S52L42EXNGPINNUP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S52L42EX","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d41a7f1620cd75a48bf49c4b2bcf284d8312c07be42239ade180fda79605674","target":"graph","created_at":"2026-05-17T23:53:18Z","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":"Consider the setting of sparse graphs on N vertices, where the vertices have distinct \"names\", which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN log N for some model-dependent rate constant c. The mathematical content of this paper is the (often easy) calculation of c for a variety of models, in particular for various standard random graph models adapted to this setting. Our broader purpose is to publicize this particular setting as a natural setting for future theoretical study of data compression for graphs, and (m","authors_text":"David J. Aldous, Nathan Ross","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-02T21:47:27Z","title":"Entropy of Some Models of Sparse Random Graphs With Vertex-Names"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0337","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:d0b56e9b6d5f06e7081498f148362ccabfe55d2a3c6842181eb4fe416711af7c","target":"record","created_at":"2026-05-17T23:53:18Z","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":"e1a70b5cef440b2169c3f80b3c5072934ca4db07cc892f33dbcce5db4ad4a5c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-02T21:47:27Z","title_canon_sha256":"eec2176b76812f2425c3748d11a6e7c6c5d2cbeb1a874c765c5a84f3a2df8ab2"},"schema_version":"1.0","source":{"id":"1301.0337","kind":"arxiv","version":1}},"canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","first_computed_at":"2026-05-17T23:53:18.126384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:18.126384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J5+0tcQDl+4ukRdjsvaTKTNTr1SmFTY25uP17zhRg/1+v7HDVLjJzozQUkC7fANqnKrFLX67yLDPl/JNPeMUAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:18.127001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b56e9b6d5f06e7081498f148362ccabfe55d2a3c6842181eb4fe416711af7c","sha256:3d41a7f1620cd75a48bf49c4b2bcf284d8312c07be42239ade180fda79605674"],"state_sha256":"94b936fedd46c604aec11adea5c299b83d0325c2ca0d6d0e3e64606443d90a16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2H3vJbWLweC0imqtNly30+CYsEB1I9Nfu+NAZuNtrbZD8AsQYDurJgK9f/sXFUSkAh3q4uyNboA5W13IDnNyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:48:43.792952Z","bundle_sha256":"8caab88b5060a06a3426db30cfd110722876e1bead9c6b0913ef0fba92ca4dc7"}}