{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DI3ODN6BC7N4CSNLTW3OVUZESY","short_pith_number":"pith:DI3ODN6B","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"},"canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","source":{"kind":"arxiv","id":"1606.00200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00200","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00200v2","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00200","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"DI3ODN6BC7N4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DI3ODN6BC7N4CSNL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DI3ODN6B","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DI3ODN6BC7N4CSNLTW3OVUZESY","target":"record","payload":{"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"},"canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","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"},"source_kind":"arxiv","source_id":"1606.00200","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-05-18T01:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDo5wIJhl6Jz4LyWh4wYnoUdD6+0fdhwrFh/LNSEx0Id/kagVDj6sAk0robMqAs7aQR+8DU9lieOziawDDE9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:16:00.897789Z"},"content_sha256":"a2bced757cda8f08f4a7fd22d7558dfb8e71af16036f83cfeef194f287d7478d","schema_version":"1.0","event_id":"sha256:a2bced757cda8f08f4a7fd22d7558dfb8e71af16036f83cfeef194f287d7478d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DI3ODN6BC7N4CSNLTW3OVUZESY","target":"graph","payload":{"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"},"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-05-18T01:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOr6gYkcTgs8ClkO87Z2z8edEIDfDHttrKJBsWFyfOx1mtXhj+q5n/xz/zqB+4TH677ngQVHO14KiuHaUtlpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:16:00.898145Z"},"content_sha256":"ddd38b186273af3bd30eed7c4356d7d9f954478cf71d23cd87ef6ac897794c41","schema_version":"1.0","event_id":"sha256:ddd38b186273af3bd30eed7c4356d7d9f954478cf71d23cd87ef6ac897794c41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/bundle.json","state_url":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/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-05-30T14:16:00Z","links":{"resolver":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY","bundle":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/bundle.json","state":"https://pith.science/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DI3ODN6BC7N4CSNLTW3OVUZESY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DI3ODN6BC7N4CSNLTW3OVUZESY","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":"198aa52ccdc83dc182d7c47498fd2389dc9d323d07420a93e01b945baec51e93","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-06-01T09:59:17Z","title_canon_sha256":"90a7fdf05da4147ddc8af8e3bd6cd51cff258798437859df00a12dda657b5d99"},"schema_version":"1.0","source":{"id":"1606.00200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00200","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00200v2","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00200","created_at":"2026-05-18T01:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"DI3ODN6BC7N4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DI3ODN6BC7N4CSNL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DI3ODN6B","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:ddd38b186273af3bd30eed7c4356d7d9f954478cf71d23cd87ef6ac897794c41","target":"graph","created_at":"2026-05-18T01:02:04Z","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"},"paper":{"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","authors_text":"Jeffrey Xu Yu, Lu Qin, Yikai Zhang, Ying Zhang","cross_cats":["cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-06-01T09:59:17Z","title":"A Fast Order-Based Approach for Core Maintenance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00200","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:a2bced757cda8f08f4a7fd22d7558dfb8e71af16036f83cfeef194f287d7478d","target":"record","created_at":"2026-05-18T01:02:04Z","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":"198aa52ccdc83dc182d7c47498fd2389dc9d323d07420a93e01b945baec51e93","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-06-01T09:59:17Z","title_canon_sha256":"90a7fdf05da4147ddc8af8e3bd6cd51cff258798437859df00a12dda657b5d99"},"schema_version":"1.0","source":{"id":"1606.00200","kind":"arxiv","version":2}},"canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a36e1b7c117dbc149ab9db6ead3249629b653617e1ce456b9455371f6374632","first_computed_at":"2026-05-18T01:02:04.190624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:04.190624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gA+IjCUCq20+ciFYOhzQ0nj5qygckAqhQd8un4YZsWLiMs7eoRmJAXIXC2Sa8TSp0B/xRGxBcvswMUhG2VjXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:04.191272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2bced757cda8f08f4a7fd22d7558dfb8e71af16036f83cfeef194f287d7478d","sha256:ddd38b186273af3bd30eed7c4356d7d9f954478cf71d23cd87ef6ac897794c41"],"state_sha256":"1fa45da48bcc3133ffff5ecc5f4b9d535423f040033012f1078a2ce7257a9307"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIjjmcKFAypoaExVSNV12st9E+TaJr9Q7wo7e+MfiNo9hoP4Omo3GciJBAZAXSsyjZJA+E/MRCX/O+juMF6aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:16:00.900625Z","bundle_sha256":"56c13f735c7a8f67cffd01e81008924e1b865801b1370ff6d43213934d10a273"}}