{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ITXCB3Z7TVXTOVLWM5XORQOF3Z","short_pith_number":"pith:ITXCB3Z7","canonical_record":{"source":{"id":"1806.05703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T18:50:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f7e40ac44a161557cd530952daec57f4b48561de930ece9205c6992402033a22","abstract_canon_sha256":"cc148bb4d873d715fb8d446e551ff1897f5504a6819f8d882c662b1a06b5fc5e"},"schema_version":"1.0"},"canonical_sha256":"44ee20ef3f9d6f375576676ee8c1c5de4a9bee6fff1923621396ea8cfbe47f21","source":{"kind":"arxiv","id":"1806.05703","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05703","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05703v3","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05703","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"ITXCB3Z7TVXT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ITXCB3Z7TVXTOVLW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ITXCB3Z7","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ITXCB3Z7TVXTOVLWM5XORQOF3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T18:50:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f7e40ac44a161557cd530952daec57f4b48561de930ece9205c6992402033a22","abstract_canon_sha256":"cc148bb4d873d715fb8d446e551ff1897f5504a6819f8d882c662b1a06b5fc5e"},"schema_version":"1.0"},"canonical_sha256":"44ee20ef3f9d6f375576676ee8c1c5de4a9bee6fff1923621396ea8cfbe47f21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:46.807516Z","signature_b64":"Q4mzQp1jTyVsnmK4CSbW2a9gzANz1Dw4a9Zz8jCbTRny6qnhiIblo0SynAuUYCdWX/Qwz0XRB3uUKSDlNbXfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44ee20ef3f9d6f375576676ee8c1c5de4a9bee6fff1923621396ea8cfbe47f21","last_reissued_at":"2026-05-17T23:45:46.807085Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:46.807085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05703","source_version":3,"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:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QX5zp2U8qW7R+zUq5XtdPGIel1weVuzaNOc+P+oTXPm+xR7YcepFARnuJ1bykqELCYoQfVwPW3uZsuy8pMAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:20:22.542835Z"},"content_sha256":"874099ed90bfe2b21db3ca31b2c5931e7268bc82f1bb7f666b8db9239f5389cd","schema_version":"1.0","event_id":"sha256:874099ed90bfe2b21db3ca31b2c5931e7268bc82f1bb7f666b8db9239f5389cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ITXCB3Z7TVXTOVLWM5XORQOF3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel Artificial Neural Network Training for Spatially Correlated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"C.B. Scott, Eric Mjolsness","submitted_at":"2018-06-14T18:50:47Z","abstract_excerpt":"Multigrid modeling algorithms are a technique used to accelerate relaxation models running on a hierarchy of similar graphlike structures. We introduce and demonstrate a new method for training neural networks which uses multilevel methods. Using an objective function derived from a graph-distance metric, we perform orthogonally-constrained optimization to find optimal prolongation and restriction maps between graphs. We compare and contrast several methods for performing this numerical optimization, and additionally present some new theoretical results on upper bounds of this type of objectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05703","kind":"arxiv","version":3},"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:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfGF6hGem/VOcFdDcwYJ6eHXJznrNEJ0ZjmxI+LpSQ2mMvXofTvPndQ6R9PbDcdOwQWd3Sl+a9SGF6t6EmPJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:20:22.543394Z"},"content_sha256":"39ea2d2ee9d889c0195019d7cd1477271b38417ce2b1574bdeb2d4165d2d1b23","schema_version":"1.0","event_id":"sha256:39ea2d2ee9d889c0195019d7cd1477271b38417ce2b1574bdeb2d4165d2d1b23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/bundle.json","state_url":"https://pith.science/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/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-03T10:20:22Z","links":{"resolver":"https://pith.science/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z","bundle":"https://pith.science/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/bundle.json","state":"https://pith.science/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITXCB3Z7TVXTOVLWM5XORQOF3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ITXCB3Z7TVXTOVLWM5XORQOF3Z","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":"cc148bb4d873d715fb8d446e551ff1897f5504a6819f8d882c662b1a06b5fc5e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T18:50:47Z","title_canon_sha256":"f7e40ac44a161557cd530952daec57f4b48561de930ece9205c6992402033a22"},"schema_version":"1.0","source":{"id":"1806.05703","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05703","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05703v3","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05703","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"ITXCB3Z7TVXT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ITXCB3Z7TVXTOVLW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ITXCB3Z7","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:39ea2d2ee9d889c0195019d7cd1477271b38417ce2b1574bdeb2d4165d2d1b23","target":"graph","created_at":"2026-05-17T23:45:46Z","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":"Multigrid modeling algorithms are a technique used to accelerate relaxation models running on a hierarchy of similar graphlike structures. We introduce and demonstrate a new method for training neural networks which uses multilevel methods. Using an objective function derived from a graph-distance metric, we perform orthogonally-constrained optimization to find optimal prolongation and restriction maps between graphs. We compare and contrast several methods for performing this numerical optimization, and additionally present some new theoretical results on upper bounds of this type of objectiv","authors_text":"C.B. Scott, Eric Mjolsness","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T18:50:47Z","title":"Multilevel Artificial Neural Network Training for Spatially Correlated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05703","kind":"arxiv","version":3},"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:874099ed90bfe2b21db3ca31b2c5931e7268bc82f1bb7f666b8db9239f5389cd","target":"record","created_at":"2026-05-17T23:45:46Z","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":"cc148bb4d873d715fb8d446e551ff1897f5504a6819f8d882c662b1a06b5fc5e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-14T18:50:47Z","title_canon_sha256":"f7e40ac44a161557cd530952daec57f4b48561de930ece9205c6992402033a22"},"schema_version":"1.0","source":{"id":"1806.05703","kind":"arxiv","version":3}},"canonical_sha256":"44ee20ef3f9d6f375576676ee8c1c5de4a9bee6fff1923621396ea8cfbe47f21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44ee20ef3f9d6f375576676ee8c1c5de4a9bee6fff1923621396ea8cfbe47f21","first_computed_at":"2026-05-17T23:45:46.807085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:46.807085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4mzQp1jTyVsnmK4CSbW2a9gzANz1Dw4a9Zz8jCbTRny6qnhiIblo0SynAuUYCdWX/Qwz0XRB3uUKSDlNbXfDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:46.807516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05703","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:874099ed90bfe2b21db3ca31b2c5931e7268bc82f1bb7f666b8db9239f5389cd","sha256:39ea2d2ee9d889c0195019d7cd1477271b38417ce2b1574bdeb2d4165d2d1b23"],"state_sha256":"6d3aece0a5ae8cddad217482313c121d8ebd2791074d4318c8486b74d048834e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3gGz8A6DDJ2XxyrH2PQO60dGz4SawK91mH5uIQnKpALpcMRzg9C7BjPcd2W0rnfw3b4XK7xfF9MXLLzT8i/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:20:22.546100Z","bundle_sha256":"c19a5fbe605002c2404eaedd750237b057bd02c6bc02cdd618f3430d3313303a"}}