{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3APUGMQUL4QLFMTXSPNE42NTSM","short_pith_number":"pith:3APUGMQU","schema_version":"1.0","canonical_sha256":"d81f4332145f20b2b27793da4e69b39312746469bf36eb864cd7c0fe33887e14","source":{"kind":"arxiv","id":"1201.3955","version":2},"attestation_state":"computed","paper":{"title":"The min mean-weight cycle in a random network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Claire Mathieu, David B. Wilson","submitted_at":"2012-01-19T01:05:45Z","abstract_excerpt":"The mean weight of a cycle in an edge-weighted graph is the sum of the cycle's edge weights divided by the cycle's length. We study the minimum mean-weight cycle on the complete graph on n vertices, with random i.i.d. edge weights drawn from an exponential distribution with mean 1. We show that the probability of the min mean weight being at most c/n tends to a limiting function of c which is analytic for c<=1/e, discontinuous at c=1/e, and equal to 1 for c>1/e. We further show that if the min mean weight is <=1/(en), then the length of the relevant cycle is Theta_p(1) (i.e., it has a limiting"},"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":"1201.3955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-19T01:05:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1436e0c8c055dfc8b7e77a73bff8b38a451a81dcaa78af745df0fcfe3a0ade5a","abstract_canon_sha256":"7910b3ab8c929785811c287c02ddd0adda4bcda73389dfd48f352c10dc738bef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.407042Z","signature_b64":"h1lFltCTb79gxwothpVnt5K7E0yT0c//AoOvwxYmQreMYf3z83pebW8nlr4hJmT2zvzCGHs2bvgocOg9tSu0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81f4332145f20b2b27793da4e69b39312746469bf36eb864cd7c0fe33887e14","last_reissued_at":"2026-05-18T02:21:18.406481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.406481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The min mean-weight cycle in a random network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Claire Mathieu, David B. Wilson","submitted_at":"2012-01-19T01:05:45Z","abstract_excerpt":"The mean weight of a cycle in an edge-weighted graph is the sum of the cycle's edge weights divided by the cycle's length. We study the minimum mean-weight cycle on the complete graph on n vertices, with random i.i.d. edge weights drawn from an exponential distribution with mean 1. We show that the probability of the min mean weight being at most c/n tends to a limiting function of c which is analytic for c<=1/e, discontinuous at c=1/e, and equal to 1 for c>1/e. We further show that if the min mean weight is <=1/(en), then the length of the relevant cycle is Theta_p(1) (i.e., it has a limiting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3955","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":"1201.3955","created_at":"2026-05-18T02:21:18.406562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3955v2","created_at":"2026-05-18T02:21:18.406562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3955","created_at":"2026-05-18T02:21:18.406562+00:00"},{"alias_kind":"pith_short_12","alias_value":"3APUGMQUL4QL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3APUGMQUL4QLFMTX","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3APUGMQU","created_at":"2026-05-18T12:26:50.516681+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/3APUGMQUL4QLFMTXSPNE42NTSM","json":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM.json","graph_json":"https://pith.science/api/pith-number/3APUGMQUL4QLFMTXSPNE42NTSM/graph.json","events_json":"https://pith.science/api/pith-number/3APUGMQUL4QLFMTXSPNE42NTSM/events.json","paper":"https://pith.science/paper/3APUGMQU"},"agent_actions":{"view_html":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM","download_json":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM.json","view_paper":"https://pith.science/paper/3APUGMQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3955&json=true","fetch_graph":"https://pith.science/api/pith-number/3APUGMQUL4QLFMTXSPNE42NTSM/graph.json","fetch_events":"https://pith.science/api/pith-number/3APUGMQUL4QLFMTXSPNE42NTSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM/action/storage_attestation","attest_author":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM/action/author_attestation","sign_citation":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM/action/citation_signature","submit_replication":"https://pith.science/pith/3APUGMQUL4QLFMTXSPNE42NTSM/action/replication_record"}},"created_at":"2026-05-18T02:21:18.406562+00:00","updated_at":"2026-05-18T02:21:18.406562+00:00"}