{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DI3ODN6BC7N4CSNLTW3OVUZESY","short_pith_number":"pith:DI3ODN6B","schema_version":"1.0","canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","source":{"kind":"arxiv","id":"1606.00200","version":2},"attestation_state":"computed","paper":{"title":"A Fast Order-Based Approach for Core Maintenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Lu Qin, Yikai Zhang, Ying Zhang","submitted_at":"2016-06-01T09:59:17Z","abstract_excerpt":"Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph. Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are updated from time to time dynamically. We identify drawbacks of the existing efficient algorithm, which n"},"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":"1606.00200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-06-01T09:59:17Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"90a7fdf05da4147ddc8af8e3bd6cd51cff258798437859df00a12dda657b5d99","abstract_canon_sha256":"198aa52ccdc83dc182d7c47498fd2389dc9d323d07420a93e01b945baec51e93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:04.191272Z","signature_b64":"gA+IjCUCq20+ciFYOhzQ0nj5qygckAqhQd8un4YZsWLiMs7eoRmJAXIXC2Sa8TSp0B/xRGxBcvswMUhG2VjXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","last_reissued_at":"2026-05-18T01:02:04.190624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:04.190624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Order-Based Approach for Core Maintenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Lu Qin, Yikai Zhang, Ying Zhang","submitted_at":"2016-06-01T09:59:17Z","abstract_excerpt":"Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph. Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are updated from time to time dynamically. We identify drawbacks of the existing efficient algorithm, which n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00200","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":""},"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":"1606.00200","created_at":"2026-05-18T01:02:04.190716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00200v2","created_at":"2026-05-18T01:02:04.190716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00200","created_at":"2026-05-18T01:02:04.190716+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI3ODN6BC7N4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI3ODN6BC7N4CSNL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI3ODN6B","created_at":"2026-05-18T12:30:12.583610+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/DI3ODN6BC7N4CSNLTW3OVUZESY","json":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY.json","graph_json":"https://pith.science/api/pith-number/DI3ODN6BC7N4CSNLTW3OVUZESY/graph.json","events_json":"https://pith.science/api/pith-number/DI3ODN6BC7N4CSNLTW3OVUZESY/events.json","paper":"https://pith.science/paper/DI3ODN6B"},"agent_actions":{"view_html":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY","download_json":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY.json","view_paper":"https://pith.science/paper/DI3ODN6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00200&json=true","fetch_graph":"https://pith.science/api/pith-number/DI3ODN6BC7N4CSNLTW3OVUZESY/graph.json","fetch_events":"https://pith.science/api/pith-number/DI3ODN6BC7N4CSNLTW3OVUZESY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/action/storage_attestation","attest_author":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/action/author_attestation","sign_citation":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/action/citation_signature","submit_replication":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/action/replication_record"}},"created_at":"2026-05-18T01:02:04.190716+00:00","updated_at":"2026-05-18T01:02:04.190716+00:00"}