{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K43H72XKEIKBIGHC3JHSQDGHA5","short_pith_number":"pith:K43H72XK","canonical_record":{"source":{"id":"1108.1427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-08-06T00:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"2c9a4827a34b492820545afcd1025be056e2d0cd1acb8a1b5abf3f2898498826","abstract_canon_sha256":"960782f223c4de1494ba36f2aa1de64697844bfbbd19f5f7a260c5745c5e40d1"},"schema_version":"1.0"},"canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","source":{"kind":"arxiv","id":"1108.1427","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1427","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1427v2","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1427","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"K43H72XKEIKB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K43H72XKEIKBIGHC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K43H72XK","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K43H72XKEIKBIGHC3JHSQDGHA5","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-08-06T00:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"2c9a4827a34b492820545afcd1025be056e2d0cd1acb8a1b5abf3f2898498826","abstract_canon_sha256":"960782f223c4de1494ba36f2aa1de64697844bfbbd19f5f7a260c5745c5e40d1"},"schema_version":"1.0"},"canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:14.422242Z","signature_b64":"3bztDgxtauBMCQEVZRYk47cFkYKGnM7Xmms9lrz4DJW+kYcVql/1QVHHHeK6WSJElcD1DTVZnWbrpn8ps0shBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","last_reissued_at":"2026-05-18T03:51:14.421588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:14.421588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1427","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-18T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utJ3XIBg45d4FfT4rvLLcmPKEF5IzGRYZe7zlN2JphhojKoWr0GKCzCo+cHhYCuTjadiwiee9lDVYyWQ9bruAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:22.966612Z"},"content_sha256":"2db7573926beb5a5502f34b842ffe58a25e510642b5a9cc6e56d71e1ae062b87","schema_version":"1.0","event_id":"sha256:2db7573926beb5a5502f34b842ffe58a25e510642b5a9cc6e56d71e1ae062b87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K43H72XKEIKBIGHC3JHSQDGHA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Classification using Signal-Subgraphs: Applications in Statistical Connectomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Carey E. Priebe, Joshua T. Vogelstein, R. Jacob Vogelstein, William R. Gray","submitted_at":"2011-08-06T00:05:53Z","abstract_excerpt":"This manuscript considers the following \"graph classification\" question: given a collection of graphs and associated classes, how can one predict the class of a newly observed graph? To address this question we propose a statistical model for graph/class pairs. This model naturally leads to a set of estimators to identify the class-conditional signal, or \"signal-subgraph,\" defined as the collection of edges that are probabilistically different between the classes. The estimators admit classifiers which are asymptotically optimal and efficient, but differ by their assumption about the \"coherenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1427","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-18T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yfyoQ4dbaWnNolx+QOnuKEhnEjDHetvLzzCIJpyCt39/otNnpGRkQgc9wy87R0CLSozyojM/NKbQQqBeTQuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:22.966958Z"},"content_sha256":"3f195466386f6bb758e9b5a831e4c905ce88f4ee1bb91b5634f16066a49eea10","schema_version":"1.0","event_id":"sha256:3f195466386f6bb758e9b5a831e4c905ce88f4ee1bb91b5634f16066a49eea10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/bundle.json","state_url":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K43H72XKEIKBIGHC3JHSQDGHA5/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-05T11:03:22Z","links":{"resolver":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5","bundle":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/bundle.json","state":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K43H72XKEIKBIGHC3JHSQDGHA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K43H72XKEIKBIGHC3JHSQDGHA5","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":"960782f223c4de1494ba36f2aa1de64697844bfbbd19f5f7a260c5745c5e40d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-08-06T00:05:53Z","title_canon_sha256":"2c9a4827a34b492820545afcd1025be056e2d0cd1acb8a1b5abf3f2898498826"},"schema_version":"1.0","source":{"id":"1108.1427","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1427","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1427v2","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1427","created_at":"2026-05-18T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"K43H72XKEIKB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K43H72XKEIKBIGHC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K43H72XK","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:3f195466386f6bb758e9b5a831e4c905ce88f4ee1bb91b5634f16066a49eea10","target":"graph","created_at":"2026-05-18T03:51:14Z","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":"This manuscript considers the following \"graph classification\" question: given a collection of graphs and associated classes, how can one predict the class of a newly observed graph? To address this question we propose a statistical model for graph/class pairs. This model naturally leads to a set of estimators to identify the class-conditional signal, or \"signal-subgraph,\" defined as the collection of edges that are probabilistically different between the classes. The estimators admit classifiers which are asymptotically optimal and efficient, but differ by their assumption about the \"coherenc","authors_text":"Carey E. Priebe, Joshua T. Vogelstein, R. Jacob Vogelstein, William R. Gray","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-08-06T00:05:53Z","title":"Graph Classification using Signal-Subgraphs: Applications in Statistical Connectomics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1427","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:2db7573926beb5a5502f34b842ffe58a25e510642b5a9cc6e56d71e1ae062b87","target":"record","created_at":"2026-05-18T03:51:14Z","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":"960782f223c4de1494ba36f2aa1de64697844bfbbd19f5f7a260c5745c5e40d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-08-06T00:05:53Z","title_canon_sha256":"2c9a4827a34b492820545afcd1025be056e2d0cd1acb8a1b5abf3f2898498826"},"schema_version":"1.0","source":{"id":"1108.1427","kind":"arxiv","version":2}},"canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","first_computed_at":"2026-05-18T03:51:14.421588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:14.421588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3bztDgxtauBMCQEVZRYk47cFkYKGnM7Xmms9lrz4DJW+kYcVql/1QVHHHeK6WSJElcD1DTVZnWbrpn8ps0shBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:14.422242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1427","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2db7573926beb5a5502f34b842ffe58a25e510642b5a9cc6e56d71e1ae062b87","sha256:3f195466386f6bb758e9b5a831e4c905ce88f4ee1bb91b5634f16066a49eea10"],"state_sha256":"ced47c77d8e42a4bba4fdebc111ff2249f00bc8564aa6c03c9f8a72fe6246740"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygAwMMoN3Drm1pb9uDjBH1yR+Z/Rk/7RhKZB9bJoC5eS+8yerhCCTmIJzaGuC0jm42oLdwdg0oZBG5TIvmYsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:03:22.968894Z","bundle_sha256":"fcdfc2ce515349b0b81310b908b31fd8f656a95568f8e0b69943a94d0845e6a3"}}