{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XJ4J2J2AFXVB5K53CUMFSJQ37H","short_pith_number":"pith:XJ4J2J2A","schema_version":"1.0","canonical_sha256":"ba789d27402dea1eabbb151859261bf9f4d7ed33526c9f61c65d1fa4144b4670","source":{"kind":"arxiv","id":"2503.21086","version":1},"attestation_state":"computed","paper":{"title":"Less Noise, More Signal: DRR for Better Optimizations of SE Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andre Lustosa, Tim Menzies","submitted_at":"2025-03-27T02:02:06Z","abstract_excerpt":"SE analytics problems do not always need complex AI. Better and faster solutions can sometimes be obtained by matching the complexity of the problem to the complexity of the solution. This paper introduces the Dimensionality Reduction Ratio (DRR), a new metric for predicting when lightweight algorithms suffice. Analyzing SE optimization problems from software configuration to process decisions and open-source project health we show that DRR pinpoints \"simple\" tasks where costly methods like DEHB (a state-of-the-art evolutionary optimizer) are overkill. For high-DRR problems, simpler methods ca"},"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":"2503.21086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-27T02:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b0e0637f5071c5671992a1f449e830214ae838aac6d48e142606b90735a0363","abstract_canon_sha256":"fd43c4cc7fe8f02f21a15dcdee1a6445bf12dba6e3d976bddc2d65e6ff892958"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:52.876218Z","signature_b64":"mlE9Ee2W+7wwPfhvAziU6KPbTmDzAby3Ro8H5djW8pUSPh1K+Ael/E1CSpSRkGaAI0Qj3hQE2NYTsemA4hBTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba789d27402dea1eabbb151859261bf9f4d7ed33526c9f61c65d1fa4144b4670","last_reissued_at":"2026-07-05T10:39:52.875792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:52.875792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Less Noise, More Signal: DRR for Better Optimizations of SE Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andre Lustosa, Tim Menzies","submitted_at":"2025-03-27T02:02:06Z","abstract_excerpt":"SE analytics problems do not always need complex AI. Better and faster solutions can sometimes be obtained by matching the complexity of the problem to the complexity of the solution. This paper introduces the Dimensionality Reduction Ratio (DRR), a new metric for predicting when lightweight algorithms suffice. Analyzing SE optimization problems from software configuration to process decisions and open-source project health we show that DRR pinpoints \"simple\" tasks where costly methods like DEHB (a state-of-the-art evolutionary optimizer) are overkill. For high-DRR problems, simpler methods ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21086","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/2503.21086/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":"2503.21086","created_at":"2026-07-05T10:39:52.875843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.21086v1","created_at":"2026-07-05T10:39:52.875843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21086","created_at":"2026-07-05T10:39:52.875843+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJ4J2J2AFXVB","created_at":"2026-07-05T10:39:52.875843+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJ4J2J2AFXVB5K53","created_at":"2026-07-05T10:39:52.875843+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJ4J2J2A","created_at":"2026-07-05T10:39:52.875843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2509.08667","citing_title":"Minimal Data, Maximum Clarity: A Heuristic for Explaining Optimization","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09658","citing_title":"Zoom, Don't Wander: Why Regional Search Outperforms Pareto Reasoning and Global Optimization in Budget-Constrained SBSE","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H","json":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H.json","graph_json":"https://pith.science/api/pith-number/XJ4J2J2AFXVB5K53CUMFSJQ37H/graph.json","events_json":"https://pith.science/api/pith-number/XJ4J2J2AFXVB5K53CUMFSJQ37H/events.json","paper":"https://pith.science/paper/XJ4J2J2A"},"agent_actions":{"view_html":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H","download_json":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H.json","view_paper":"https://pith.science/paper/XJ4J2J2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.21086&json=true","fetch_graph":"https://pith.science/api/pith-number/XJ4J2J2AFXVB5K53CUMFSJQ37H/graph.json","fetch_events":"https://pith.science/api/pith-number/XJ4J2J2AFXVB5K53CUMFSJQ37H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H/action/storage_attestation","attest_author":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H/action/author_attestation","sign_citation":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H/action/citation_signature","submit_replication":"https://pith.science/pith/XJ4J2J2AFXVB5K53CUMFSJQ37H/action/replication_record"}},"created_at":"2026-07-05T10:39:52.875843+00:00","updated_at":"2026-07-05T10:39:52.875843+00:00"}