{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:25LASIOF6HITE3NAWJCCLJV2IP","short_pith_number":"pith:25LASIOF","canonical_record":{"source":{"id":"1808.04580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T08:24:01Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"3c423c6b0452bdf506dd2bf6149345848e30f407f53dce3c1f59f57f1f1b1b37","abstract_canon_sha256":"f6ec7843b38293337c51cb3a207143a8325a05104113bc02261d575c807fb558"},"schema_version":"1.0"},"canonical_sha256":"d7560921c5f1d1326da0b24425a6ba43ea341c832ee6f5ed547585caa485d42f","source":{"kind":"arxiv","id":"1808.04580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04580","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04580v2","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04580","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"25LASIOF6HIT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25LASIOF6HITE3NA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25LASIOF","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:25LASIOF6HITE3NAWJCCLJV2IP","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T08:24:01Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"3c423c6b0452bdf506dd2bf6149345848e30f407f53dce3c1f59f57f1f1b1b37","abstract_canon_sha256":"f6ec7843b38293337c51cb3a207143a8325a05104113bc02261d575c807fb558"},"schema_version":"1.0"},"canonical_sha256":"d7560921c5f1d1326da0b24425a6ba43ea341c832ee6f5ed547585caa485d42f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:30.598696Z","signature_b64":"4iTvZBzv/5I4Vkj14SNYepBviSsJeW2Fn2P7bUkgznA6qHIMTBDQERpCLnPB5MbMxj+C/5878qNoQ1MeSWWbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7560921c5f1d1326da0b24425a6ba43ea341c832ee6f5ed547585caa485d42f","last_reissued_at":"2026-05-17T23:58:30.598065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:30.598065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04580","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-17T23:58:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5AXh8sY7aWk2O4Q5Sg1X9H0igaqHaFayVW1Srk8680zDuXbtU2gl9usTO1iFprgWQ4qeFGMreVnIcPbpmPDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:35:41.084149Z"},"content_sha256":"694abd804db2faf3d92e31640d557cfbad6095099f2f381774518b95be57066a","schema_version":"1.0","event_id":"sha256:694abd804db2faf3d92e31640d557cfbad6095099f2f381774518b95be57066a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:25LASIOF6HITE3NAWJCCLJV2IP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Potts, Dominik Alfke, Martin Stoll, Toni Volkmer","submitted_at":"2018-08-14T08:24:01Z","abstract_excerpt":"The graph Laplacian is a standard tool in data science, machine learning, and image processing. The corresponding matrix inherits the complex structure of the underlying network and is in certain applications densely populated. This makes computations, in particular matrix-vector products, with the graph Laplacian a hard task. A typical application is the computation of a number of its eigenvalues and eigenvectors. Standard methods become infeasible as the number of nodes in the graph is too large. We propose the use of the fast summation based on the nonequispaced fast Fourier transform (NFFT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04580","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-17T23:58:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVZcIRiXl31B1Qfv81N5UixLRl1yn4M20c331yhGbiUIZ7l+fQATcA2Wx1iae6RSEcj6XkIsSvLIaB+Bpsj7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:35:41.084505Z"},"content_sha256":"7781cffa701fc617408a5fda97a39ba5a341fde469cf073f713cfdfa78263eb8","schema_version":"1.0","event_id":"sha256:7781cffa701fc617408a5fda97a39ba5a341fde469cf073f713cfdfa78263eb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25LASIOF6HITE3NAWJCCLJV2IP/bundle.json","state_url":"https://pith.science/pith/25LASIOF6HITE3NAWJCCLJV2IP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25LASIOF6HITE3NAWJCCLJV2IP/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-02T04:35:41Z","links":{"resolver":"https://pith.science/pith/25LASIOF6HITE3NAWJCCLJV2IP","bundle":"https://pith.science/pith/25LASIOF6HITE3NAWJCCLJV2IP/bundle.json","state":"https://pith.science/pith/25LASIOF6HITE3NAWJCCLJV2IP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25LASIOF6HITE3NAWJCCLJV2IP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:25LASIOF6HITE3NAWJCCLJV2IP","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":"f6ec7843b38293337c51cb3a207143a8325a05104113bc02261d575c807fb558","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T08:24:01Z","title_canon_sha256":"3c423c6b0452bdf506dd2bf6149345848e30f407f53dce3c1f59f57f1f1b1b37"},"schema_version":"1.0","source":{"id":"1808.04580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04580","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04580v2","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04580","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"25LASIOF6HIT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25LASIOF6HITE3NA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25LASIOF","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:7781cffa701fc617408a5fda97a39ba5a341fde469cf073f713cfdfa78263eb8","target":"graph","created_at":"2026-05-17T23:58:30Z","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":"The graph Laplacian is a standard tool in data science, machine learning, and image processing. The corresponding matrix inherits the complex structure of the underlying network and is in certain applications densely populated. This makes computations, in particular matrix-vector products, with the graph Laplacian a hard task. A typical application is the computation of a number of its eigenvalues and eigenvectors. Standard methods become infeasible as the number of nodes in the graph is too large. We propose the use of the fast summation based on the nonequispaced fast Fourier transform (NFFT","authors_text":"Daniel Potts, Dominik Alfke, Martin Stoll, Toni Volkmer","cross_cats":["math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T08:24:01Z","title":"NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04580","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:694abd804db2faf3d92e31640d557cfbad6095099f2f381774518b95be57066a","target":"record","created_at":"2026-05-17T23:58:30Z","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":"f6ec7843b38293337c51cb3a207143a8325a05104113bc02261d575c807fb558","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T08:24:01Z","title_canon_sha256":"3c423c6b0452bdf506dd2bf6149345848e30f407f53dce3c1f59f57f1f1b1b37"},"schema_version":"1.0","source":{"id":"1808.04580","kind":"arxiv","version":2}},"canonical_sha256":"d7560921c5f1d1326da0b24425a6ba43ea341c832ee6f5ed547585caa485d42f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7560921c5f1d1326da0b24425a6ba43ea341c832ee6f5ed547585caa485d42f","first_computed_at":"2026-05-17T23:58:30.598065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:30.598065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4iTvZBzv/5I4Vkj14SNYepBviSsJeW2Fn2P7bUkgznA6qHIMTBDQERpCLnPB5MbMxj+C/5878qNoQ1MeSWWbCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:30.598696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:694abd804db2faf3d92e31640d557cfbad6095099f2f381774518b95be57066a","sha256:7781cffa701fc617408a5fda97a39ba5a341fde469cf073f713cfdfa78263eb8"],"state_sha256":"076df13593eb2f7042039d370fd3c80016168d74c42ded496f6b1db4ce02d9f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHW/4Y3uQXewMheiPiR1on5/KZVtLT/CbsVX/h7KWmea31BKb8hXikXb/Cc7KvY53C/h91xux7WWCYuXrUZuBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:35:41.086513Z","bundle_sha256":"1c55ff1c6e364863a1309994ac7256fd3fc73041d8980e2b775e2c0f2e15c34a"}}