{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S52L42EXNGPINNUPKDREJA7XT6","short_pith_number":"pith:S52L42EX","schema_version":"1.0","canonical_sha256":"9774be6897699e86b68f50e24483f79f9d8ae4bc9ec8c134ac1c51d7e0856e5f","source":{"kind":"arxiv","id":"1301.0337","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.0337","created_at":"2026-05-17T23:53:18.126478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0337v1","created_at":"2026-05-17T23:53:18.126478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0337","created_at":"2026-05-17T23:53:18.126478+00:00"},{"alias_kind":"pith_short_12","alias_value":"S52L42EXNGPI","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S52L42EXNGPINNUP","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S52L42EX","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6","json":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6.json","graph_json":"https://pith.science/api/pith-number/S52L42EXNGPINNUPKDREJA7XT6/graph.json","events_json":"https://pith.science/api/pith-number/S52L42EXNGPINNUPKDREJA7XT6/events.json","paper":"https://pith.science/paper/S52L42EX"},"agent_actions":{"view_html":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6","download_json":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6.json","view_paper":"https://pith.science/paper/S52L42EX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0337&json=true","fetch_graph":"https://pith.science/api/pith-number/S52L42EXNGPINNUPKDREJA7XT6/graph.json","fetch_events":"https://pith.science/api/pith-number/S52L42EXNGPINNUPKDREJA7XT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/action/storage_attestation","attest_author":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/action/author_attestation","sign_citation":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/action/citation_signature","submit_replication":"https://pith.science/pith/S52L42EXNGPINNUPKDREJA7XT6/action/replication_record"}},"created_at":"2026-05-17T23:53:18.126478+00:00","updated_at":"2026-05-17T23:53:18.126478+00:00"}