{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4IL5FCQXJSUYERQ7OKFPUATIQJ","short_pith_number":"pith:4IL5FCQX","schema_version":"1.0","canonical_sha256":"e217d28a174ca982461f728afa0268824ba20a9662cfdbff5c3f4ad7f8c88dce","source":{"kind":"arxiv","id":"1209.2881","version":1},"attestation_state":"computed","paper":{"title":"Far-out Vertices In Weighted Repeated Configuration Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Bartlomiej Blaszczyszyn, Kumar Gaurav","submitted_at":"2012-09-13T13:08:47Z","abstract_excerpt":"We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the rest of the graph by a distance exceeding certain threshold play an important role in determining some global properties of the graph like diameter, flooding time etc., in spite of being statistically rare. We give a convergence result for the distribution of the number of such far-out vertices. We also make a conjecture about how this relates to the longest"},"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":"1209.2881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-13T13:08:47Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4427f35461249cb7100d84d21052d2ba890170906a562541ffd6ce50b9dc28e3","abstract_canon_sha256":"fcc4a767d107a0a73ea5e27916a1ff31edcacd49e9a0d7e1a1ebdd1112cf09b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:40.702478Z","signature_b64":"nJUsUU7unJux58wT3o7VzrB8mGt8o+nw0kE9++TFl2sl2WrCa7bkMKuRPBDcJp9tcLgBOU4VQo7oPXXL8Yt1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e217d28a174ca982461f728afa0268824ba20a9662cfdbff5c3f4ad7f8c88dce","last_reissued_at":"2026-05-18T03:45:40.702000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:40.702000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Far-out Vertices In Weighted Repeated Configuration Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.PR","authors_text":"Bartlomiej Blaszczyszyn, Kumar Gaurav","submitted_at":"2012-09-13T13:08:47Z","abstract_excerpt":"We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the rest of the graph by a distance exceeding certain threshold play an important role in determining some global properties of the graph like diameter, flooding time etc., in spite of being statistically rare. We give a convergence result for the distribution of the number of such far-out vertices. We also make a conjecture about how this relates to the longest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2881","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":"1209.2881","created_at":"2026-05-18T03:45:40.702064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2881v1","created_at":"2026-05-18T03:45:40.702064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2881","created_at":"2026-05-18T03:45:40.702064+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IL5FCQXJSUY","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IL5FCQXJSUYERQ7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IL5FCQX","created_at":"2026-05-18T12:26:53.410803+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/4IL5FCQXJSUYERQ7OKFPUATIQJ","json":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ.json","graph_json":"https://pith.science/api/pith-number/4IL5FCQXJSUYERQ7OKFPUATIQJ/graph.json","events_json":"https://pith.science/api/pith-number/4IL5FCQXJSUYERQ7OKFPUATIQJ/events.json","paper":"https://pith.science/paper/4IL5FCQX"},"agent_actions":{"view_html":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ","download_json":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ.json","view_paper":"https://pith.science/paper/4IL5FCQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2881&json=true","fetch_graph":"https://pith.science/api/pith-number/4IL5FCQXJSUYERQ7OKFPUATIQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4IL5FCQXJSUYERQ7OKFPUATIQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ/action/storage_attestation","attest_author":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ/action/author_attestation","sign_citation":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ/action/citation_signature","submit_replication":"https://pith.science/pith/4IL5FCQXJSUYERQ7OKFPUATIQJ/action/replication_record"}},"created_at":"2026-05-18T03:45:40.702064+00:00","updated_at":"2026-05-18T03:45:40.702064+00:00"}