{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4CJPZWT3BU4Z3CDOF57AQSFEXN","short_pith_number":"pith:4CJPZWT3","canonical_record":{"source":{"id":"1802.05421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-15T07:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"c7755810d9bd97dc03fa89052738aeeef2eac35abdd3caa6619fb0c24dba615c","abstract_canon_sha256":"797ce005b5066dd1ba2893b6e7defcc1d3b18c0b75f9cbfc61e9f3caba7cd613"},"schema_version":"1.0"},"canonical_sha256":"e092fcda7b0d399d886e2f7e0848a4bb6b2a5e2c6bd4d8cdc769914394fb49f6","source":{"kind":"arxiv","id":"1802.05421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05421","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05421v1","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05421","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"4CJPZWT3BU4Z","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CJPZWT3BU4Z3CDO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CJPZWT3","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4CJPZWT3BU4Z3CDOF57AQSFEXN","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-15T07:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"c7755810d9bd97dc03fa89052738aeeef2eac35abdd3caa6619fb0c24dba615c","abstract_canon_sha256":"797ce005b5066dd1ba2893b6e7defcc1d3b18c0b75f9cbfc61e9f3caba7cd613"},"schema_version":"1.0"},"canonical_sha256":"e092fcda7b0d399d886e2f7e0848a4bb6b2a5e2c6bd4d8cdc769914394fb49f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:15.732954Z","signature_b64":"gIiU3m7kIlj3KnfCbQzHt/i4aceDVVDvQcNINH96fMveUd7zc765xTh1cICH2ogfRe0FvU1cQtlcJJhGajavDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e092fcda7b0d399d886e2f7e0848a4bb6b2a5e2c6bd4d8cdc769914394fb49f6","last_reissued_at":"2026-05-18T00:23:15.732168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:15.732168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05421","source_version":1,"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQJGQsMdOSuuV2Dq9yNm75OiRU5LxnqG0+Xn9txmKnUViVcmwIyW+EbLtzh2EBeW+l7BhEL/m46Av4S3+sXVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T21:57:38.981235Z"},"content_sha256":"5ee1666082ec37b73b92b489e8b1eeaedc874122cb7b3a97cb653fd6fba2b6ae","schema_version":"1.0","event_id":"sha256:5ee1666082ec37b73b92b489e8b1eeaedc874122cb7b3a97cb653fd6fba2b6ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4CJPZWT3BU4Z3CDOF57AQSFEXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CADDeLaG: Framework for distributed anomaly detection in large dense graph sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aniruddha Basak, Kamalika Das, Ole J. Mengshoel","submitted_at":"2018-02-15T07:18:41Z","abstract_excerpt":"Random walk based distance measures for graphs such as commute-time distance are useful in a variety of graph algorithms, such as clustering, anomaly detection, and creating low dimensional embeddings. Since such measures hinge on the spectral decomposition of the graph, the computation becomes a bottleneck for large graphs and do not scale easily to graphs that cannot be loaded in memory. Most existing graph mining libraries for large graphs either resort to sampling or exploit the sparsity structure of such graphs for spectral analysis. However, such methods do not work for dense graphs cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05421","kind":"arxiv","version":1},"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4D8kyqm624TxlT0BhmdujLhTOaDEK3f82QSOH6HHn5VJFybf2pufElPPxoxykaqo74bZa1T/UZmygrwWQi6GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T21:57:38.981838Z"},"content_sha256":"5afe3a79877db886f210551291efbd9990a6cd6b820d9ef46806fa7f58d1042a","schema_version":"1.0","event_id":"sha256:5afe3a79877db886f210551291efbd9990a6cd6b820d9ef46806fa7f58d1042a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/bundle.json","state_url":"https://pith.science/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/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-07-12T21:57:38Z","links":{"resolver":"https://pith.science/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN","bundle":"https://pith.science/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/bundle.json","state":"https://pith.science/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CJPZWT3BU4Z3CDOF57AQSFEXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4CJPZWT3BU4Z3CDOF57AQSFEXN","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":"797ce005b5066dd1ba2893b6e7defcc1d3b18c0b75f9cbfc61e9f3caba7cd613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-15T07:18:41Z","title_canon_sha256":"c7755810d9bd97dc03fa89052738aeeef2eac35abdd3caa6619fb0c24dba615c"},"schema_version":"1.0","source":{"id":"1802.05421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05421","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05421v1","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05421","created_at":"2026-05-18T00:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"4CJPZWT3BU4Z","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CJPZWT3BU4Z3CDO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CJPZWT3","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:5afe3a79877db886f210551291efbd9990a6cd6b820d9ef46806fa7f58d1042a","target":"graph","created_at":"2026-05-18T00:23:15Z","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":"Random walk based distance measures for graphs such as commute-time distance are useful in a variety of graph algorithms, such as clustering, anomaly detection, and creating low dimensional embeddings. Since such measures hinge on the spectral decomposition of the graph, the computation becomes a bottleneck for large graphs and do not scale easily to graphs that cannot be loaded in memory. Most existing graph mining libraries for large graphs either resort to sampling or exploit the sparsity structure of such graphs for spectral analysis. However, such methods do not work for dense graphs cons","authors_text":"Aniruddha Basak, Kamalika Das, Ole J. Mengshoel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-15T07:18:41Z","title":"CADDeLaG: Framework for distributed anomaly detection in large dense graph sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05421","kind":"arxiv","version":1},"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:5ee1666082ec37b73b92b489e8b1eeaedc874122cb7b3a97cb653fd6fba2b6ae","target":"record","created_at":"2026-05-18T00:23:15Z","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":"797ce005b5066dd1ba2893b6e7defcc1d3b18c0b75f9cbfc61e9f3caba7cd613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-15T07:18:41Z","title_canon_sha256":"c7755810d9bd97dc03fa89052738aeeef2eac35abdd3caa6619fb0c24dba615c"},"schema_version":"1.0","source":{"id":"1802.05421","kind":"arxiv","version":1}},"canonical_sha256":"e092fcda7b0d399d886e2f7e0848a4bb6b2a5e2c6bd4d8cdc769914394fb49f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e092fcda7b0d399d886e2f7e0848a4bb6b2a5e2c6bd4d8cdc769914394fb49f6","first_computed_at":"2026-05-18T00:23:15.732168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:15.732168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gIiU3m7kIlj3KnfCbQzHt/i4aceDVVDvQcNINH96fMveUd7zc765xTh1cICH2ogfRe0FvU1cQtlcJJhGajavDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:15.732954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee1666082ec37b73b92b489e8b1eeaedc874122cb7b3a97cb653fd6fba2b6ae","sha256:5afe3a79877db886f210551291efbd9990a6cd6b820d9ef46806fa7f58d1042a"],"state_sha256":"d1635c21271875944519c0ca049d3c7d98d7e17ee7b8b9aaadf5afdf90d5184e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHCo9O/kf3SkR+KKjOI/GqP7aPnO7nMwbZvOq1P3oLBqGn4iZgY7gRLjd9sXmzkLvd9Jo2gdaRWTsLL8VhjIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T21:57:38.987423Z","bundle_sha256":"7b964ee8f62d8e5290afc8651458816b70ec20bc3fdf9fe64a1aa461975aebcf"}}