{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B64DE4JDWZ2FNFJH44I5CKSJUT","short_pith_number":"pith:B64DE4JD","canonical_record":{"source":{"id":"1609.01672","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-06T17:53:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c629ef3834c21fc60646cb7f732bc09b52d917f359a2737a7fc2d6e81ad65e18","abstract_canon_sha256":"a32314961c5a1f58302f4cd4bf22bd1e5165ecfd89f17bc4329d6333c6dba76d"},"schema_version":"1.0"},"canonical_sha256":"0fb8327123b674569527e711d12a49a4d77ba93f87b1c6fe93d29d7119737b0d","source":{"kind":"arxiv","id":"1609.01672","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01672","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01672v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01672","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"B64DE4JDWZ2F","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B64DE4JDWZ2FNFJH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B64DE4JD","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B64DE4JDWZ2FNFJH44I5CKSJUT","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01672","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-06T17:53:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c629ef3834c21fc60646cb7f732bc09b52d917f359a2737a7fc2d6e81ad65e18","abstract_canon_sha256":"a32314961c5a1f58302f4cd4bf22bd1e5165ecfd89f17bc4329d6333c6dba76d"},"schema_version":"1.0"},"canonical_sha256":"0fb8327123b674569527e711d12a49a4d77ba93f87b1c6fe93d29d7119737b0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.851022Z","signature_b64":"TweSYXnObAqAWZJ4FClPq0x6me/A3ZQP3GDX/6CGC7nQYSP3zUd4bkxHhtqdTEO4hJUzqFM2kzxSFEVcQmwaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fb8327123b674569527e711d12a49a4d77ba93f87b1c6fe93d29d7119737b0d","last_reissued_at":"2026-05-17T23:58:54.850602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.850602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01672","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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x57o4mEQqhIDFcEj1Uo9cKUqvspTsBb2TTpVYS8nwHmg+OmhHSmOx4UPISoHbK8VoD79QdMqySsbxud99o2OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:36.428525Z"},"content_sha256":"0901fb77e594c6acb09e2e29a58817108415874ea351135e51e809010d376f9f","schema_version":"1.0","event_id":"sha256:0901fb77e594c6acb09e2e29a58817108415874ea351135e51e809010d376f9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B64DE4JDWZ2FNFJH44I5CKSJUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectome Smoothing via Low-rank Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Alexandra Badea, Carey E. Priebe, Daniel L. Sussman, Daniel S. Margulies, Evan D. Calabrese, Joshua T. Vogelstein, Michael Ketcha, Runze Tang","submitted_at":"2016-09-06T17:53:37Z","abstract_excerpt":"In statistical connectomics, the quantitative study of brain networks, estimating the mean of a population of graphs based on a sample is a core problem. Often, this problem is especially difficult because the sample or cohort size is relatively small, sometimes even a single subject. While using the element-wise sample mean of the adjacency matrices is a common approach, this method does not exploit any underlying structural properties of the graphs. We propose using a low-rank method which incorporates tools for dimension selection and diagonal augmentation to smooth the estimates and improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01672","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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+8iFjXz1aSUSU3yoTxlRihTosDRMrS9UGchhAHGPC5QXAtghQ9iFw8RKxAQoTDz5ai8HTe80oUm7gcEYGitCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:36.428879Z"},"content_sha256":"1741fea6f7abcfbe252118c0c2b68ca680d7cd7916c13bf41ad8e265547758aa","schema_version":"1.0","event_id":"sha256:1741fea6f7abcfbe252118c0c2b68ca680d7cd7916c13bf41ad8e265547758aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/bundle.json","state_url":"https://pith.science/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/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-04T00:26:36Z","links":{"resolver":"https://pith.science/pith/B64DE4JDWZ2FNFJH44I5CKSJUT","bundle":"https://pith.science/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/bundle.json","state":"https://pith.science/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B64DE4JDWZ2FNFJH44I5CKSJUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B64DE4JDWZ2FNFJH44I5CKSJUT","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":"a32314961c5a1f58302f4cd4bf22bd1e5165ecfd89f17bc4329d6333c6dba76d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-06T17:53:37Z","title_canon_sha256":"c629ef3834c21fc60646cb7f732bc09b52d917f359a2737a7fc2d6e81ad65e18"},"schema_version":"1.0","source":{"id":"1609.01672","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01672","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01672v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01672","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"B64DE4JDWZ2F","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B64DE4JDWZ2FNFJH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B64DE4JD","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:1741fea6f7abcfbe252118c0c2b68ca680d7cd7916c13bf41ad8e265547758aa","target":"graph","created_at":"2026-05-17T23:58:54Z","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":"In statistical connectomics, the quantitative study of brain networks, estimating the mean of a population of graphs based on a sample is a core problem. Often, this problem is especially difficult because the sample or cohort size is relatively small, sometimes even a single subject. While using the element-wise sample mean of the adjacency matrices is a common approach, this method does not exploit any underlying structural properties of the graphs. We propose using a low-rank method which incorporates tools for dimension selection and diagonal augmentation to smooth the estimates and improv","authors_text":"Alexandra Badea, Carey E. Priebe, Daniel L. Sussman, Daniel S. Margulies, Evan D. Calabrese, Joshua T. Vogelstein, Michael Ketcha, Runze Tang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-06T17:53:37Z","title":"Connectome Smoothing via Low-rank Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01672","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:0901fb77e594c6acb09e2e29a58817108415874ea351135e51e809010d376f9f","target":"record","created_at":"2026-05-17T23:58:54Z","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":"a32314961c5a1f58302f4cd4bf22bd1e5165ecfd89f17bc4329d6333c6dba76d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-06T17:53:37Z","title_canon_sha256":"c629ef3834c21fc60646cb7f732bc09b52d917f359a2737a7fc2d6e81ad65e18"},"schema_version":"1.0","source":{"id":"1609.01672","kind":"arxiv","version":3}},"canonical_sha256":"0fb8327123b674569527e711d12a49a4d77ba93f87b1c6fe93d29d7119737b0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fb8327123b674569527e711d12a49a4d77ba93f87b1c6fe93d29d7119737b0d","first_computed_at":"2026-05-17T23:58:54.850602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:54.850602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TweSYXnObAqAWZJ4FClPq0x6me/A3ZQP3GDX/6CGC7nQYSP3zUd4bkxHhtqdTEO4hJUzqFM2kzxSFEVcQmwaAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:54.851022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01672","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0901fb77e594c6acb09e2e29a58817108415874ea351135e51e809010d376f9f","sha256:1741fea6f7abcfbe252118c0c2b68ca680d7cd7916c13bf41ad8e265547758aa"],"state_sha256":"738b3478b7db55d3f982ccde6fe621c84a5245911a7deccb16e9438ebf54f0ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gU63alYRQ39E63ZVoVcsKapYt76nCxuqozX59krVecQOFQOMUYFItMfTX2/VF1QUiNAzgupZm8G57U78N/SZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:26:36.430995Z","bundle_sha256":"f457419965c0e47ca28d33de51b55b5730862be00cb9bd57bcf2083b82fcdf40"}}