{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OSXZCPDZRD4YJ37E7WIS5FDZLD","short_pith_number":"pith:OSXZCPDZ","schema_version":"1.0","canonical_sha256":"74af913c7988f984efe4fd912e947958d904bbfcc63468486fb1ad64c1681dc5","source":{"kind":"arxiv","id":"1408.4257","version":2},"attestation_state":"computed","paper":{"title":"Random graphs from a block-stable class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Colin McDiarmid","submitted_at":"2014-08-19T09:06:03Z","abstract_excerpt":"A class of graphs is called block-stable when a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most $n$-vertex graphs in such a class, each vertex is in at most $(1+o(1)) \\log n / \\log\\log n$ blocks, and each path passes through at most $5 (n \\log n)^{1/2}$ blocks. These results extend to `weakly block-stable' classes of graphs."},"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":"1408.4257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-19T09:06:03Z","cross_cats_sorted":[],"title_canon_sha256":"fc05653c464e5135834359f86163b139f0f75b69e1c05bdaa01de512dc3ffa61","abstract_canon_sha256":"844534f1c3cf00be4785623c4dff33dab708f9463b0e1ca10be6b21fb4e07858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.421629Z","signature_b64":"i6L9MSqw1wvBdkEqdytAVln+50b+IxfHkO8h8BFYuKMfG7dZ2k409a9ufAKg/me9buQzwjt9+clzI6lG/+gGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74af913c7988f984efe4fd912e947958d904bbfcc63468486fb1ad64c1681dc5","last_reissued_at":"2026-05-18T01:14:53.421031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.421031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random graphs from a block-stable class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Colin McDiarmid","submitted_at":"2014-08-19T09:06:03Z","abstract_excerpt":"A class of graphs is called block-stable when a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most $n$-vertex graphs in such a class, each vertex is in at most $(1+o(1)) \\log n / \\log\\log n$ blocks, and each path passes through at most $5 (n \\log n)^{1/2}$ blocks. These results extend to `weakly block-stable' classes of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4257","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.4257","created_at":"2026-05-18T01:14:53.421119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4257v2","created_at":"2026-05-18T01:14:53.421119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4257","created_at":"2026-05-18T01:14:53.421119+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSXZCPDZRD4Y","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSXZCPDZRD4YJ37E","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSXZCPDZ","created_at":"2026-05-18T12:28:43.426989+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/OSXZCPDZRD4YJ37E7WIS5FDZLD","json":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD.json","graph_json":"https://pith.science/api/pith-number/OSXZCPDZRD4YJ37E7WIS5FDZLD/graph.json","events_json":"https://pith.science/api/pith-number/OSXZCPDZRD4YJ37E7WIS5FDZLD/events.json","paper":"https://pith.science/paper/OSXZCPDZ"},"agent_actions":{"view_html":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD","download_json":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD.json","view_paper":"https://pith.science/paper/OSXZCPDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4257&json=true","fetch_graph":"https://pith.science/api/pith-number/OSXZCPDZRD4YJ37E7WIS5FDZLD/graph.json","fetch_events":"https://pith.science/api/pith-number/OSXZCPDZRD4YJ37E7WIS5FDZLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD/action/storage_attestation","attest_author":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD/action/author_attestation","sign_citation":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD/action/citation_signature","submit_replication":"https://pith.science/pith/OSXZCPDZRD4YJ37E7WIS5FDZLD/action/replication_record"}},"created_at":"2026-05-18T01:14:53.421119+00:00","updated_at":"2026-05-18T01:14:53.421119+00:00"}