{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NXUUBPXNSJXUEMQEZ7ZQ3QDEBO","short_pith_number":"pith:NXUUBPXN","canonical_record":{"source":{"id":"1801.04624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-15T00:13:11Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ecd7076dd0f72ca07a6c154eb030a35ead233d2d319333520de2ae691f0f763d","abstract_canon_sha256":"a26ad80eee5151a9702f28bd76ea26d51c068bff2d5fe0c52bc71e10268fdad7"},"schema_version":"1.0"},"canonical_sha256":"6de940beed926f423204cff30dc0640b876a9fffcea6b538860c17029292af6c","source":{"kind":"arxiv","id":"1801.04624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04624","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04624v2","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04624","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"NXUUBPXNSJXU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXUUBPXNSJXUEMQE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXUUBPXN","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NXUUBPXNSJXUEMQEZ7ZQ3QDEBO","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-15T00:13:11Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ecd7076dd0f72ca07a6c154eb030a35ead233d2d319333520de2ae691f0f763d","abstract_canon_sha256":"a26ad80eee5151a9702f28bd76ea26d51c068bff2d5fe0c52bc71e10268fdad7"},"schema_version":"1.0"},"canonical_sha256":"6de940beed926f423204cff30dc0640b876a9fffcea6b538860c17029292af6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:37.100105Z","signature_b64":"xi6mF/YE3QCWem1LnwpNvVfsx9pCmoERU1Y7svX5QQvvbD9Fm5SylCDFXUIa+n9GKhL5jXeKfiPtG8sOyHsrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de940beed926f423204cff30dc0640b876a9fffcea6b538860c17029292af6c","last_reissued_at":"2026-05-18T00:24:37.099290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:37.099290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04624","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-18T00:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tK8k+Vy3Urd0WMnSSgJ31jQ10MDzm1OHPXQBbnzAVPsZddC+cgVWseXH7LL01VpqJgidIEVmw0qoab6dPx8oAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:01:37.155488Z"},"content_sha256":"aa5036816737560de340f86dc9fc105a0905a6b47c792dff89f1115596b8ed1d","schema_version":"1.0","event_id":"sha256:aa5036816737560de340f86dc9fc105a0905a6b47c792dff89f1115596b8ed1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NXUUBPXNSJXUEMQEZ7ZQ3QDEBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Stratified Graph Sampling Algorithms based on Approximate Degree Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hui Li, Junpeng Zhu, Mei Chen, Ming Zhu, Zhenyu Dai","submitted_at":"2018-01-15T00:13:11Z","abstract_excerpt":"Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the characteristic of scale-free. Scale-free means that degrees of different nodes are subject to a power law distribution. So, there is a significant difference in the degrees between the overall sampling nodes. In this paper, we propose an idea of approximate degree distribution and devise a stratified strategy using it in the complex networks. We also develop two grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04624","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-18T00:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2bAuZxz7+9rWPQ06aHAoYUjB54byJPqPhk76JmtTQwbHJrgVYLJYGp1pkqo8AgwpndyOdfxyUrEZYQ3r6l8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:01:37.155842Z"},"content_sha256":"847a1b2b4bf75a04bea604c4a64191d33bc4f94a93cdfe21084d72a427fae12b","schema_version":"1.0","event_id":"sha256:847a1b2b4bf75a04bea604c4a64191d33bc4f94a93cdfe21084d72a427fae12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/bundle.json","state_url":"https://pith.science/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/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-06-09T15:01:37Z","links":{"resolver":"https://pith.science/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO","bundle":"https://pith.science/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/bundle.json","state":"https://pith.science/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXUUBPXNSJXUEMQEZ7ZQ3QDEBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NXUUBPXNSJXUEMQEZ7ZQ3QDEBO","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":"a26ad80eee5151a9702f28bd76ea26d51c068bff2d5fe0c52bc71e10268fdad7","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-15T00:13:11Z","title_canon_sha256":"ecd7076dd0f72ca07a6c154eb030a35ead233d2d319333520de2ae691f0f763d"},"schema_version":"1.0","source":{"id":"1801.04624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04624","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04624v2","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04624","created_at":"2026-05-18T00:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"NXUUBPXNSJXU","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXUUBPXNSJXUEMQE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXUUBPXN","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:847a1b2b4bf75a04bea604c4a64191d33bc4f94a93cdfe21084d72a427fae12b","target":"graph","created_at":"2026-05-18T00:24:37Z","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":"Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the characteristic of scale-free. Scale-free means that degrees of different nodes are subject to a power law distribution. So, there is a significant difference in the degrees between the overall sampling nodes. In this paper, we propose an idea of approximate degree distribution and devise a stratified strategy using it in the complex networks. We also develop two grap","authors_text":"Hui Li, Junpeng Zhu, Mei Chen, Ming Zhu, Zhenyu Dai","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-15T00:13:11Z","title":"Enhancing Stratified Graph Sampling Algorithms based on Approximate Degree Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04624","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:aa5036816737560de340f86dc9fc105a0905a6b47c792dff89f1115596b8ed1d","target":"record","created_at":"2026-05-18T00:24:37Z","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":"a26ad80eee5151a9702f28bd76ea26d51c068bff2d5fe0c52bc71e10268fdad7","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-01-15T00:13:11Z","title_canon_sha256":"ecd7076dd0f72ca07a6c154eb030a35ead233d2d319333520de2ae691f0f763d"},"schema_version":"1.0","source":{"id":"1801.04624","kind":"arxiv","version":2}},"canonical_sha256":"6de940beed926f423204cff30dc0640b876a9fffcea6b538860c17029292af6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de940beed926f423204cff30dc0640b876a9fffcea6b538860c17029292af6c","first_computed_at":"2026-05-18T00:24:37.099290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:37.099290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xi6mF/YE3QCWem1LnwpNvVfsx9pCmoERU1Y7svX5QQvvbD9Fm5SylCDFXUIa+n9GKhL5jXeKfiPtG8sOyHsrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:37.100105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa5036816737560de340f86dc9fc105a0905a6b47c792dff89f1115596b8ed1d","sha256:847a1b2b4bf75a04bea604c4a64191d33bc4f94a93cdfe21084d72a427fae12b"],"state_sha256":"13b5e1bda4a7b025aaa6322edbf2c870bfc12bb661eeb714739ebd57644c1303"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mz0ufE61pROQfSH8SzkCLiMoBUTw3tmgG49gtDbVsZI+HY6RLb5xtLcyZU3awEOTGUPzz05kSUGn6mh/13/tDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:01:37.157774Z","bundle_sha256":"a649f5575338168a23d7c4f4ed8224a926421a5e62da8cae183f499be435c0ee"}}