{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2LLYQPYVSRAZQTE3XLIO3U5Z5H","short_pith_number":"pith:2LLYQPYV","schema_version":"1.0","canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","source":{"kind":"arxiv","id":"2211.04627","version":2},"attestation_state":"computed","paper":{"title":"Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Thomo, Quinton Yong, Valerie King","submitted_at":"2022-11-09T01:06:46Z","abstract_excerpt":"The problem of finding the degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + epsilon)-approximate solution to the degeneracy problem which runs in O(n log n) time, sublinear in the input size for dense graphs, by sampling a small number of neighbors adjacent to high degree nodes. Our algorithm can also be extended to an O(n log n) time solution to the k-core decomposition problem. This improves upon the method by Bhattacharya et al., which implies a (4 + epsilon)-approximate ~O(n) solution to the degeneracy problem, and our techniques a"},"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.04627","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T01:06:46Z","cross_cats_sorted":[],"title_canon_sha256":"cc4cc6e3129b20beaa278dd85743054d8cb34e8664f79736f8b34ac4066995bf","abstract_canon_sha256":"b764f07be68c3f38e26561a931c6f47ed5d18f9080d967f01c5f4c91aa061040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:03.883246Z","signature_b64":"Ebvp1o6E/6fcFA0zLtgTGctcyDgzeGgu1czZzXQ0G8ioRhd+Zj3j8eupFeUuqa17WA8+z0IwKqE0erBGe04jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","last_reissued_at":"2026-07-05T05:16:03.882802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:03.882802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Thomo, Quinton Yong, Valerie King","submitted_at":"2022-11-09T01:06:46Z","abstract_excerpt":"The problem of finding the degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + epsilon)-approximate solution to the degeneracy problem which runs in O(n log n) time, sublinear in the input size for dense graphs, by sampling a small number of neighbors adjacent to high degree nodes. Our algorithm can also be extended to an O(n log n) time solution to the k-core decomposition problem. This improves upon the method by Bhattacharya et al., which implies a (4 + epsilon)-approximate ~O(n) solution to the degeneracy problem, and our techniques a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04627","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/2211.04627/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.04627","created_at":"2026-07-05T05:16:03.882860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04627v2","created_at":"2026-07-05T05:16:03.882860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04627","created_at":"2026-07-05T05:16:03.882860+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LLYQPYVSRAZ","created_at":"2026-07-05T05:16:03.882860+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LLYQPYVSRAZQTE3","created_at":"2026-07-05T05:16:03.882860+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LLYQPYV","created_at":"2026-07-05T05:16:03.882860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08042","citing_title":"Parallel $k$-Core Decomposition: Theory and Practice","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H","json":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H.json","graph_json":"https://pith.science/api/pith-number/2LLYQPYVSRAZQTE3XLIO3U5Z5H/graph.json","events_json":"https://pith.science/api/pith-number/2LLYQPYVSRAZQTE3XLIO3U5Z5H/events.json","paper":"https://pith.science/paper/2LLYQPYV"},"agent_actions":{"view_html":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H","download_json":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H.json","view_paper":"https://pith.science/paper/2LLYQPYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04627&json=true","fetch_graph":"https://pith.science/api/pith-number/2LLYQPYVSRAZQTE3XLIO3U5Z5H/graph.json","fetch_events":"https://pith.science/api/pith-number/2LLYQPYVSRAZQTE3XLIO3U5Z5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/action/storage_attestation","attest_author":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/action/author_attestation","sign_citation":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/action/citation_signature","submit_replication":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/action/replication_record"}},"created_at":"2026-07-05T05:16:03.882860+00:00","updated_at":"2026-07-05T05:16:03.882860+00:00"}