{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TXYDPKRJWVEWZN36ETMYMFAGSQ","short_pith_number":"pith:TXYDPKRJ","canonical_record":{"source":{"id":"1605.09776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-31T19:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"21eef71ce9810c5eca5d9a664de916dec911558d76ff39561a3eec5b7e42d871","abstract_canon_sha256":"f8f6bf45b4a2f97bb99d3bd9b86ec43cb718843335202c85a1da28101e9e1405"},"schema_version":"1.0"},"canonical_sha256":"9df037aa29b5496cb77e24d98614069404fba1f7dfab601ea9cc581e368b0ad3","source":{"kind":"arxiv","id":"1605.09776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09776","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09776v2","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09776","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"TXYDPKRJWVEW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXYDPKRJWVEWZN36","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXYDPKRJ","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TXYDPKRJWVEWZN36ETMYMFAGSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-31T19:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"21eef71ce9810c5eca5d9a664de916dec911558d76ff39561a3eec5b7e42d871","abstract_canon_sha256":"f8f6bf45b4a2f97bb99d3bd9b86ec43cb718843335202c85a1da28101e9e1405"},"schema_version":"1.0"},"canonical_sha256":"9df037aa29b5496cb77e24d98614069404fba1f7dfab601ea9cc581e368b0ad3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.021200Z","signature_b64":"H4iJWuQlo47r9pPIor32kf38O3QSbi8E/ifNCkDhbd6TCb/PS9H7kymD3UdULyWT/+K6uDqW5IZy7BHND5XZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df037aa29b5496cb77e24d98614069404fba1f7dfab601ea9cc581e368b0ad3","last_reissued_at":"2026-05-18T00:42:22.020597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.020597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09776","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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilstYrg3vW5h4MIo73icBVpNKnRAHlG9JIM7W6jfUFK83dTfZKXHzHI0CNNJXq0OKMAE0Eqz7Q9i/BftXgN2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:47.568901Z"},"content_sha256":"a4a62bce706f4819cf1d6dd0958bb45231e628ce708b387d06f5c1ea9a7fb834","schema_version":"1.0","event_id":"sha256:a4a62bce706f4819cf1d6dd0958bb45231e628ce708b387d06f5c1ea9a7fb834"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TXYDPKRJWVEWZN36ETMYMFAGSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Guyue Han, Harish Sethu","submitted_at":"2016-05-31T19:22:40Z","abstract_excerpt":"Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists, computer scientists and marketeers alike. However, the computation of these network motif statistics via naive enumeration is infeasible for either its prohibitive computational costs or access restrictions on the full graph data. Methods to estimate the motif statistics based on random walks by sampling only a small fraction of the subgraphs in the large graph address both of these challenges. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09776","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:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3DZfbZXuOdOKb96eqwYJJG9qAox5yW7flZccB+uVd/nkpDFJWq3g/MwNFLYFFZ2pfWyrktmBTj2IC8hiWd1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:09:47.569238Z"},"content_sha256":"6bb4f52e101dc977c3fa2a3e9f0ca38c8cf7c0b1e65d6327299d4a21f99a7885","schema_version":"1.0","event_id":"sha256:6bb4f52e101dc977c3fa2a3e9f0ca38c8cf7c0b1e65d6327299d4a21f99a7885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/bundle.json","state_url":"https://pith.science/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/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-29T13:09:47Z","links":{"resolver":"https://pith.science/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ","bundle":"https://pith.science/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/bundle.json","state":"https://pith.science/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXYDPKRJWVEWZN36ETMYMFAGSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TXYDPKRJWVEWZN36ETMYMFAGSQ","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":"f8f6bf45b4a2f97bb99d3bd9b86ec43cb718843335202c85a1da28101e9e1405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-31T19:22:40Z","title_canon_sha256":"21eef71ce9810c5eca5d9a664de916dec911558d76ff39561a3eec5b7e42d871"},"schema_version":"1.0","source":{"id":"1605.09776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09776","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09776v2","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09776","created_at":"2026-05-18T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"TXYDPKRJWVEW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXYDPKRJWVEWZN36","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXYDPKRJ","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:6bb4f52e101dc977c3fa2a3e9f0ca38c8cf7c0b1e65d6327299d4a21f99a7885","target":"graph","created_at":"2026-05-18T00:42:22Z","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":"Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists, computer scientists and marketeers alike. However, the computation of these network motif statistics via naive enumeration is infeasible for either its prohibitive computational costs or access restrictions on the full graph data. Methods to estimate the motif statistics based on random walks by sampling only a small fraction of the subgraphs in the large graph address both of these challenges. In thi","authors_text":"Guyue Han, Harish Sethu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-31T19:22:40Z","title":"Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09776","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:a4a62bce706f4819cf1d6dd0958bb45231e628ce708b387d06f5c1ea9a7fb834","target":"record","created_at":"2026-05-18T00:42:22Z","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":"f8f6bf45b4a2f97bb99d3bd9b86ec43cb718843335202c85a1da28101e9e1405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-31T19:22:40Z","title_canon_sha256":"21eef71ce9810c5eca5d9a664de916dec911558d76ff39561a3eec5b7e42d871"},"schema_version":"1.0","source":{"id":"1605.09776","kind":"arxiv","version":2}},"canonical_sha256":"9df037aa29b5496cb77e24d98614069404fba1f7dfab601ea9cc581e368b0ad3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9df037aa29b5496cb77e24d98614069404fba1f7dfab601ea9cc581e368b0ad3","first_computed_at":"2026-05-18T00:42:22.020597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:22.020597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H4iJWuQlo47r9pPIor32kf38O3QSbi8E/ifNCkDhbd6TCb/PS9H7kymD3UdULyWT/+K6uDqW5IZy7BHND5XZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:22.021200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4a62bce706f4819cf1d6dd0958bb45231e628ce708b387d06f5c1ea9a7fb834","sha256:6bb4f52e101dc977c3fa2a3e9f0ca38c8cf7c0b1e65d6327299d4a21f99a7885"],"state_sha256":"50fa84bcabb315b9b6ece671b2d35bbfc2966326e73deade912657a420297fa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiuJVz+2S1sIsl+PoV0u3cxqQFljZqVX4rRFX47YJ5zw3oZJnNRXkHoQbzPA3HYHrFJD8HO+9KSIvEbBv+7QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:09:47.571138Z","bundle_sha256":"1f37557e234f12d755782e96fb65117e0a72a7cfcd820a96b4227994e1d39126"}}