{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K43H72XKEIKBIGHC3JHSQDGHA5","short_pith_number":"pith:K43H72XK","schema_version":"1.0","canonical_sha256":"57367feaea22141418e2da4f280cc70773edcd376ac52d8a3e354a7e58c69bc7","source":{"kind":"arxiv","id":"1108.1427","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.1427","created_at":"2026-05-18T03:51:14.421702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1427v2","created_at":"2026-05-18T03:51:14.421702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1427","created_at":"2026-05-18T03:51:14.421702+00:00"},{"alias_kind":"pith_short_12","alias_value":"K43H72XKEIKB","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K43H72XKEIKBIGHC","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K43H72XK","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5","json":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5.json","graph_json":"https://pith.science/api/pith-number/K43H72XKEIKBIGHC3JHSQDGHA5/graph.json","events_json":"https://pith.science/api/pith-number/K43H72XKEIKBIGHC3JHSQDGHA5/events.json","paper":"https://pith.science/paper/K43H72XK"},"agent_actions":{"view_html":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5","download_json":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5.json","view_paper":"https://pith.science/paper/K43H72XK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1427&json=true","fetch_graph":"https://pith.science/api/pith-number/K43H72XKEIKBIGHC3JHSQDGHA5/graph.json","fetch_events":"https://pith.science/api/pith-number/K43H72XKEIKBIGHC3JHSQDGHA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/action/storage_attestation","attest_author":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/action/author_attestation","sign_citation":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/action/citation_signature","submit_replication":"https://pith.science/pith/K43H72XKEIKBIGHC3JHSQDGHA5/action/replication_record"}},"created_at":"2026-05-18T03:51:14.421702+00:00","updated_at":"2026-05-18T03:51:14.421702+00:00"}