{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ECCAWNUTH2J5ZYMWUEAHLB32HW","short_pith_number":"pith:ECCAWNUT","canonical_record":{"source":{"id":"1112.5506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-23T02:47:31Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"766354762154729856ac75b3a7d4cd10d4381ed008333730ae830ba71a55db10","abstract_canon_sha256":"d1b46decfa17b71ece1a5b48203f870a1e54e06fb91d8be4ff07793ba5df3b3a"},"schema_version":"1.0"},"canonical_sha256":"20840b36933e93dce196a10075877a3d8cbc70140f12ea327aca0c13058d165d","source":{"kind":"arxiv","id":"1112.5506","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5506","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5506v2","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5506","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"ECCAWNUTH2J5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"ECCAWNUTH2J5ZYMW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"ECCAWNUT","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ECCAWNUTH2J5ZYMWUEAHLB32HW","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-23T02:47:31Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"766354762154729856ac75b3a7d4cd10d4381ed008333730ae830ba71a55db10","abstract_canon_sha256":"d1b46decfa17b71ece1a5b48203f870a1e54e06fb91d8be4ff07793ba5df3b3a"},"schema_version":"1.0"},"canonical_sha256":"20840b36933e93dce196a10075877a3d8cbc70140f12ea327aca0c13058d165d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:07.463523Z","signature_b64":"QWJ2ibRIa6Xh5L2Q0t9PoMQQZRSYBKyU8CEetW32ioHaH3W19TrX6ghhbBjntOO3g25wStz7mKgwnGLygT+yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20840b36933e93dce196a10075877a3d8cbc70140f12ea327aca0c13058d165d","last_reissued_at":"2026-05-18T03:43:07.462834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:07.462834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5506","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZZY7ziLiUU40zyAIYXvV6oCuVY6g7YK3dRievOBzr9Iw0l5qweMEidMFu299TMbRCfPDPUvhyi1efA7K+jqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:21:34.469373Z"},"content_sha256":"531835d8ca64de84623ab05f0494b4807f52656d9282ccd574a88f0bb91721c8","schema_version":"1.0","event_id":"sha256:531835d8ca64de84623ab05f0494b4807f52656d9282ccd574a88f0bb91721c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ECCAWNUTH2J5ZYMWUEAHLB32HW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shuffled Graph Classification: Theory and Connectome Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"q-bio.QM","authors_text":"Carey E. Priebe, Joshua T. Vogelstein","submitted_at":"2011-12-23T02:47:31Z","abstract_excerpt":"We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are called shuffled graphs. Our formalism provides insight to trivially answer a number of open statistical questions including: (i) under what conditions does shuffling the vertices degrade classification performance and (ii) do universally consistent graph classifiers exist? The answers to these questions lead to practical heuristic algorithms with state-of-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5506","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggHBXguzjbnFKffbboukhHMQXiXwzIh0uxyuiF+7xGPKGIq+iFnf+fhMpLBhaJlJlLYTNRs+bL6RrlK0IS5pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:21:34.470113Z"},"content_sha256":"a2843b3c3dc0d81b90b92485c11679e92b5f15de520710f7a07999e1bfd606ae","schema_version":"1.0","event_id":"sha256:a2843b3c3dc0d81b90b92485c11679e92b5f15de520710f7a07999e1bfd606ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/bundle.json","state_url":"https://pith.science/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/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-11T16:21:34Z","links":{"resolver":"https://pith.science/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW","bundle":"https://pith.science/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/bundle.json","state":"https://pith.science/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECCAWNUTH2J5ZYMWUEAHLB32HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ECCAWNUTH2J5ZYMWUEAHLB32HW","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":"d1b46decfa17b71ece1a5b48203f870a1e54e06fb91d8be4ff07793ba5df3b3a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-23T02:47:31Z","title_canon_sha256":"766354762154729856ac75b3a7d4cd10d4381ed008333730ae830ba71a55db10"},"schema_version":"1.0","source":{"id":"1112.5506","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5506","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5506v2","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5506","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"ECCAWNUTH2J5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"ECCAWNUTH2J5ZYMW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"ECCAWNUT","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:a2843b3c3dc0d81b90b92485c11679e92b5f15de520710f7a07999e1bfd606ae","target":"graph","created_at":"2026-05-18T03:43:07Z","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":"We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are called shuffled graphs. Our formalism provides insight to trivially answer a number of open statistical questions including: (i) under what conditions does shuffling the vertices degrade classification performance and (ii) do universally consistent graph classifiers exist? The answers to these questions lead to practical heuristic algorithms with state-of-t","authors_text":"Carey E. Priebe, Joshua T. Vogelstein","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-23T02:47:31Z","title":"Shuffled Graph Classification: Theory and Connectome Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5506","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:531835d8ca64de84623ab05f0494b4807f52656d9282ccd574a88f0bb91721c8","target":"record","created_at":"2026-05-18T03:43:07Z","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":"d1b46decfa17b71ece1a5b48203f870a1e54e06fb91d8be4ff07793ba5df3b3a","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2011-12-23T02:47:31Z","title_canon_sha256":"766354762154729856ac75b3a7d4cd10d4381ed008333730ae830ba71a55db10"},"schema_version":"1.0","source":{"id":"1112.5506","kind":"arxiv","version":2}},"canonical_sha256":"20840b36933e93dce196a10075877a3d8cbc70140f12ea327aca0c13058d165d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20840b36933e93dce196a10075877a3d8cbc70140f12ea327aca0c13058d165d","first_computed_at":"2026-05-18T03:43:07.462834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:07.462834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QWJ2ibRIa6Xh5L2Q0t9PoMQQZRSYBKyU8CEetW32ioHaH3W19TrX6ghhbBjntOO3g25wStz7mKgwnGLygT+yBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:07.463523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5506","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531835d8ca64de84623ab05f0494b4807f52656d9282ccd574a88f0bb91721c8","sha256:a2843b3c3dc0d81b90b92485c11679e92b5f15de520710f7a07999e1bfd606ae"],"state_sha256":"b2b9dd104c079d54a9be15e96f2f09770c57f3961535dfc1f7cdc48f5d382859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tpPKQj8eygrZMnDjoz/SV0S396g55xlH3aDXBQSnddqBDATG7bsXsx0VTW0NquIH/oupzXM4J3SaQ/vaS6IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:21:34.474709Z","bundle_sha256":"b2515027ad219616a00e69388f1c4b619877f822ebeedc140b1fed7db0e4d3fb"}}