{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2LLYQPYVSRAZQTE3XLIO3U5Z5H","short_pith_number":"pith:2LLYQPYV","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"},"canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","source":{"kind":"arxiv","id":"2211.04627","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04627","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04627v2","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04627","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"2LLYQPYVSRAZ","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"2LLYQPYVSRAZQTE3","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"2LLYQPYV","created_at":"2026-07-05T05:16:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2LLYQPYVSRAZQTE3XLIO3U5Z5H","target":"record","payload":{"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"},"canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","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"},"source_kind":"arxiv","source_id":"2211.04627","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9P8JBGXuC6fLDyC+DaWrzEh58mHRh56RsPFHyBN6rA62VORYfOzf9/lZ/Vbtj+rEuVgD+3pTp1qTJKTBpDKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:41:36.931606Z"},"content_sha256":"a8d141f22c2042fad65806d457bff02c3df0c15c0d367476c49897e47995977b","schema_version":"1.0","event_id":"sha256:a8d141f22c2042fad65806d457bff02c3df0c15c0d367476c49897e47995977b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2LLYQPYVSRAZQTE3XLIO3U5Z5H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFQjzJCMzDuAEh5Nz6l9qLDgswlX5/bp5toQ4Z2f0r2FKNbSikcTofWq5TlGgD8hzG7GZ9OYyJmtVyMbBj+7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:41:36.932216Z"},"content_sha256":"9d8a588b39d3ddd7580cdb9ab24a40ba2db045d341f1122773c62c01c600d590","schema_version":"1.0","event_id":"sha256:9d8a588b39d3ddd7580cdb9ab24a40ba2db045d341f1122773c62c01c600d590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/bundle.json","state_url":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T15:41:36Z","links":{"resolver":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H","bundle":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/bundle.json","state":"https://pith.science/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LLYQPYVSRAZQTE3XLIO3U5Z5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2LLYQPYVSRAZQTE3XLIO3U5Z5H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b764f07be68c3f38e26561a931c6f47ed5d18f9080d967f01c5f4c91aa061040","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T01:06:46Z","title_canon_sha256":"cc4cc6e3129b20beaa278dd85743054d8cb34e8664f79736f8b34ac4066995bf"},"schema_version":"1.0","source":{"id":"2211.04627","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04627","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04627v2","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04627","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"2LLYQPYVSRAZ","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"2LLYQPYVSRAZQTE3","created_at":"2026-07-05T05:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"2LLYQPYV","created_at":"2026-07-05T05:16:03Z"}],"graph_snapshots":[{"event_id":"sha256:9d8a588b39d3ddd7580cdb9ab24a40ba2db045d341f1122773c62c01c600d590","target":"graph","created_at":"2026-07-05T05:16:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.04627/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alex Thomo, Quinton Yong, Valerie King","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T01:06:46Z","title":"Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04627","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a8d141f22c2042fad65806d457bff02c3df0c15c0d367476c49897e47995977b","target":"record","created_at":"2026-07-05T05:16:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b764f07be68c3f38e26561a931c6f47ed5d18f9080d967f01c5f4c91aa061040","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T01:06:46Z","title_canon_sha256":"cc4cc6e3129b20beaa278dd85743054d8cb34e8664f79736f8b34ac4066995bf"},"schema_version":"1.0","source":{"id":"2211.04627","kind":"arxiv","version":2}},"canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2d7883f159441984c9bbad0edd3b9e9d331363891d123b123f58a807a2cfd65","first_computed_at":"2026-07-05T05:16:03.882802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:03.882802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ebvp1o6E/6fcFA0zLtgTGctcyDgzeGgu1czZzXQ0G8ioRhd+Zj3j8eupFeUuqa17WA8+z0IwKqE0erBGe04jBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:03.883246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04627","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8d141f22c2042fad65806d457bff02c3df0c15c0d367476c49897e47995977b","sha256:9d8a588b39d3ddd7580cdb9ab24a40ba2db045d341f1122773c62c01c600d590"],"state_sha256":"288cc7facc7b3e03a56e8acbaf8d57cf1cce80a8491f6a0650462b5d7d0f3d0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Toea49XUC6rR4GPsYTVdsuTWOH08z4OvSkTpC4OzZEDrD172SA4oVbwCk9/LY34/pm/VC4PKxAk0oZd3XA5TAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:41:36.937615Z","bundle_sha256":"b0fc5fb7df404208f82678230098b46a6ddfe8734d15008b21953cf8a8971d9d"}}