{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JSAMLV77TIJ6D4DWCJVCNDWJ63","short_pith_number":"pith:JSAMLV77","schema_version":"1.0","canonical_sha256":"4c80c5d7ff9a13e1f076126a268ec9f6c8146f62a580ea016bcecd33d76d6a15","source":{"kind":"arxiv","id":"2211.12348","version":1},"attestation_state":"computed","paper":{"title":"Typical values of extremal-weight combinatorial structures with independent symmetric weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Albert Xu, Tomasz Tkocz, Yixue Liu, Yun Cheng","submitted_at":"2022-11-22T15:36:18Z","abstract_excerpt":"Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common optimisation problems, we establish asymptotically tight bounds when the weights are independent copies of a symmetric random variable (satisfying a mild condition on tail probabilities), in particular when the weights are Gaussian."},"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":"2211.12348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-22T15:36:18Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c82fa6838c02fede10363bb0f4c200eb3ac80ac67e1841ab11b7211932ab871f","abstract_canon_sha256":"434b7614d78256805f55c3e410708cb69e86db164167fc607e9313e2376c638b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:06.212515Z","signature_b64":"1RooJtCoZV0lJHfhw68p1XO5jG9KS/OzkeRNyKeGuB/0Qys1M5NqPbSj1WBUYi6cRX8Xgu1jF6dUlBIcALbBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c80c5d7ff9a13e1f076126a268ec9f6c8146f62a580ea016bcecd33d76d6a15","last_reissued_at":"2026-07-05T10:05:06.212004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:06.212004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical values of extremal-weight combinatorial structures with independent symmetric weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Albert Xu, Tomasz Tkocz, Yixue Liu, Yun Cheng","submitted_at":"2022-11-22T15:36:18Z","abstract_excerpt":"Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common optimisation problems, we establish asymptotically tight bounds when the weights are independent copies of a symmetric random variable (satisfying a mild condition on tail probabilities), in particular when the weights are Gaussian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.12348/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.12348","created_at":"2026-07-05T10:05:06.212067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12348v1","created_at":"2026-07-05T10:05:06.212067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12348","created_at":"2026-07-05T10:05:06.212067+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSAMLV77TIJ6","created_at":"2026-07-05T10:05:06.212067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSAMLV77TIJ6D4DW","created_at":"2026-07-05T10:05:06.212067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSAMLV77","created_at":"2026-07-05T10:05:06.212067+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/JSAMLV77TIJ6D4DWCJVCNDWJ63","json":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63.json","graph_json":"https://pith.science/api/pith-number/JSAMLV77TIJ6D4DWCJVCNDWJ63/graph.json","events_json":"https://pith.science/api/pith-number/JSAMLV77TIJ6D4DWCJVCNDWJ63/events.json","paper":"https://pith.science/paper/JSAMLV77"},"agent_actions":{"view_html":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63","download_json":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63.json","view_paper":"https://pith.science/paper/JSAMLV77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12348&json=true","fetch_graph":"https://pith.science/api/pith-number/JSAMLV77TIJ6D4DWCJVCNDWJ63/graph.json","fetch_events":"https://pith.science/api/pith-number/JSAMLV77TIJ6D4DWCJVCNDWJ63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63/action/storage_attestation","attest_author":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63/action/author_attestation","sign_citation":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63/action/citation_signature","submit_replication":"https://pith.science/pith/JSAMLV77TIJ6D4DWCJVCNDWJ63/action/replication_record"}},"created_at":"2026-07-05T10:05:06.212067+00:00","updated_at":"2026-07-05T10:05:06.212067+00:00"}