{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LBTS4EPEPO5NQZ762YICOHLDOC","short_pith_number":"pith:LBTS4EPE","schema_version":"1.0","canonical_sha256":"58672e11e47bbad867fed610271d63708caf47123706e582cfa8e05972d9c6bb","source":{"kind":"arxiv","id":"2602.07882","version":2},"attestation_state":"computed","paper":{"title":"Rethinking Code Complexity Through the Lens of Large Language Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Beijun Shen, Chen Xie, Xiaodong Gu, Yuling Shi","submitted_at":"2026-02-08T09:20:20Z","abstract_excerpt":"Code complexity metrics such as cyclomatic complexity have long been used to assess software quality and maintainability. With the rapid advancement of large language models (LLMs) on coding tasks, an important yet underexplored question arises: do traditional complexity metrics meaningfully characterize the coding difficulty that LLMs perceive? In this work, we empirically demonstrate that classical complexity metrics exhibit no consistent correlation with LLM performance, revealing a fundamental mismatch with model-perceived difficulty. To address this gap, we propose LM-CC, a novel code com"},"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":"2602.07882","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SE","submitted_at":"2026-02-08T09:20:20Z","cross_cats_sorted":[],"title_canon_sha256":"050b73c0de2afb2d479794f226ff63db624949d9032fe332fa5934e7a65fe413","abstract_canon_sha256":"cffd805299b5c959d7d536d215514143b1d3c3d8822529b8944b93d07ffc781e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:46.105633Z","signature_b64":"96AlOmRrBwYXWG+3kVJ5PlJ2pcSDEAnQpil/WJjXF9YyPR903f1JYL9yfkKnHVQ7lKjchyR9C5kRe3uTgMy0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58672e11e47bbad867fed610271d63708caf47123706e582cfa8e05972d9c6bb","last_reissued_at":"2026-05-28T02:04:46.105097Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:46.105097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Code Complexity Through the Lens of Large Language Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Beijun Shen, Chen Xie, Xiaodong Gu, Yuling Shi","submitted_at":"2026-02-08T09:20:20Z","abstract_excerpt":"Code complexity metrics such as cyclomatic complexity have long been used to assess software quality and maintainability. With the rapid advancement of large language models (LLMs) on coding tasks, an important yet underexplored question arises: do traditional complexity metrics meaningfully characterize the coding difficulty that LLMs perceive? In this work, we empirically demonstrate that classical complexity metrics exhibit no consistent correlation with LLM performance, revealing a fundamental mismatch with model-perceived difficulty. To address this gap, we propose LM-CC, a novel code com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.07882","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.07882/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":"2602.07882","created_at":"2026-05-28T02:04:46.105160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.07882v2","created_at":"2026-05-28T02:04:46.105160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.07882","created_at":"2026-05-28T02:04:46.105160+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBTS4EPEPO5N","created_at":"2026-05-28T02:04:46.105160+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBTS4EPEPO5NQZ76","created_at":"2026-05-28T02:04:46.105160+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBTS4EPE","created_at":"2026-05-28T02:04:46.105160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.21058","citing_title":"Zero-Shot Vulnerability Detection in Low-Resource Smart Contracts Through Solidity-Only Training","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC","json":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC.json","graph_json":"https://pith.science/api/pith-number/LBTS4EPEPO5NQZ762YICOHLDOC/graph.json","events_json":"https://pith.science/api/pith-number/LBTS4EPEPO5NQZ762YICOHLDOC/events.json","paper":"https://pith.science/paper/LBTS4EPE"},"agent_actions":{"view_html":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC","download_json":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC.json","view_paper":"https://pith.science/paper/LBTS4EPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.07882&json=true","fetch_graph":"https://pith.science/api/pith-number/LBTS4EPEPO5NQZ762YICOHLDOC/graph.json","fetch_events":"https://pith.science/api/pith-number/LBTS4EPEPO5NQZ762YICOHLDOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC/action/storage_attestation","attest_author":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC/action/author_attestation","sign_citation":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC/action/citation_signature","submit_replication":"https://pith.science/pith/LBTS4EPEPO5NQZ762YICOHLDOC/action/replication_record"}},"created_at":"2026-05-28T02:04:46.105160+00:00","updated_at":"2026-05-28T02:04:46.105160+00:00"}