{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DJPCSMU3QAZEGQ45EDVITSUEZ7","short_pith_number":"pith:DJPCSMU3","schema_version":"1.0","canonical_sha256":"1a5e29329b803243439d20ea89ca84cffab30c81ee238ebbab75303807a87e13","source":{"kind":"arxiv","id":"2606.25875","version":1},"attestation_state":"computed","paper":{"title":"A Stronger Conditional Running-Time Lower Bound for Global Label Min-Cut","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Wei Wang, Yuanhao Wang","submitted_at":"2026-06-24T14:20:47Z","abstract_excerpt":"Let $n$ and $p$ denote the numbers of vertices and labels, respectively, in an undirected edge-labeled graph. Previous work showed that, under the Exponential Time Hypothesis (ETH), there is no deterministic algorithm with running time \\[ (np)^{o\\left(\\frac{\\log n}{(\\log\\log n)^2}\\right)}. \\] In this paper, we give a deterministic reduction that strengthens this conditional running-time lower bound to \\[ (np)^{o\\left(\\frac{\\log n}{\\log\\log n}\\right)}. \\]"},"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":"2606.25875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-24T14:20:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"37af599d99f9f1011bec84ce214f2b49d382a98fde11567a03af46f35357b0b4","abstract_canon_sha256":"d65a3a38e18330e7ac8e9e892f2cbb769f9e8b4d2cf92a40d1bcf08ed7533256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:41.973474Z","signature_b64":"kBXan1TVqawceJhMeYsGJTbuoU0NrsJ1YhC7omTR/q1ZiX2Gk5rmsbDi5WoxbWQZsCaRsYb+tO867gXlgqxTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5e29329b803243439d20ea89ca84cffab30c81ee238ebbab75303807a87e13","last_reissued_at":"2026-06-25T01:18:41.973073Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:41.973073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stronger Conditional Running-Time Lower Bound for Global Label Min-Cut","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Wei Wang, Yuanhao Wang","submitted_at":"2026-06-24T14:20:47Z","abstract_excerpt":"Let $n$ and $p$ denote the numbers of vertices and labels, respectively, in an undirected edge-labeled graph. Previous work showed that, under the Exponential Time Hypothesis (ETH), there is no deterministic algorithm with running time \\[ (np)^{o\\left(\\frac{\\log n}{(\\log\\log n)^2}\\right)}. \\] In this paper, we give a deterministic reduction that strengthens this conditional running-time lower bound to \\[ (np)^{o\\left(\\frac{\\log n}{\\log\\log n}\\right)}. \\]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25875","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/2606.25875/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":"2606.25875","created_at":"2026-06-25T01:18:41.973132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25875v1","created_at":"2026-06-25T01:18:41.973132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25875","created_at":"2026-06-25T01:18:41.973132+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJPCSMU3QAZE","created_at":"2026-06-25T01:18:41.973132+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJPCSMU3QAZEGQ45","created_at":"2026-06-25T01:18:41.973132+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJPCSMU3","created_at":"2026-06-25T01:18:41.973132+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/DJPCSMU3QAZEGQ45EDVITSUEZ7","json":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7.json","graph_json":"https://pith.science/api/pith-number/DJPCSMU3QAZEGQ45EDVITSUEZ7/graph.json","events_json":"https://pith.science/api/pith-number/DJPCSMU3QAZEGQ45EDVITSUEZ7/events.json","paper":"https://pith.science/paper/DJPCSMU3"},"agent_actions":{"view_html":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7","download_json":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7.json","view_paper":"https://pith.science/paper/DJPCSMU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25875&json=true","fetch_graph":"https://pith.science/api/pith-number/DJPCSMU3QAZEGQ45EDVITSUEZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/DJPCSMU3QAZEGQ45EDVITSUEZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7/action/storage_attestation","attest_author":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7/action/author_attestation","sign_citation":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7/action/citation_signature","submit_replication":"https://pith.science/pith/DJPCSMU3QAZEGQ45EDVITSUEZ7/action/replication_record"}},"created_at":"2026-06-25T01:18:41.973132+00:00","updated_at":"2026-06-25T01:18:41.973132+00:00"}