{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A7IQPMEBE2GGLPM7HMFMSYNYHV","short_pith_number":"pith:A7IQPMEB","canonical_record":{"source":{"id":"1612.02908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-09T04:11:50Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"0e4a2503bdd6d2d64deb679990c23a546629edee6eac3f9d7727ce5a3d155416","abstract_canon_sha256":"4b341713d71823d0d6af4b634bb2d4e083e152731bfce79bcaad78bc2057b035"},"schema_version":"1.0"},"canonical_sha256":"07d107b081268c65bd9f3b0ac961b83d79a97bbab073e3bc4b504c788b5183e7","source":{"kind":"arxiv","id":"1612.02908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02908","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02908v1","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02908","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"A7IQPMEBE2GG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7IQPMEBE2GGLPM7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7IQPMEB","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A7IQPMEBE2GGLPM7HMFMSYNYHV","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-09T04:11:50Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"0e4a2503bdd6d2d64deb679990c23a546629edee6eac3f9d7727ce5a3d155416","abstract_canon_sha256":"4b341713d71823d0d6af4b634bb2d4e083e152731bfce79bcaad78bc2057b035"},"schema_version":"1.0"},"canonical_sha256":"07d107b081268c65bd9f3b0ac961b83d79a97bbab073e3bc4b504c788b5183e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:27.994101Z","signature_b64":"2XcjsfR5COvXM6ARtXrQC9qMUxqjFfw2QVe+0uyE7H+Oxytt5MExTOSE64AVIhJnBVXtKmnpTnbLPB1w9E85CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d107b081268c65bd9f3b0ac961b83d79a97bbab073e3bc4b504c788b5183e7","last_reissued_at":"2026-05-18T00:55:27.993661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:27.993661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02908","source_version":1,"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-18T00:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXe47BPEjSVPl1MrvQEtBp6XXRxcv9mCQ7o5HIBmK3AupNIUxAEp2S7+GZ/KuGR93EfujKcE2/mf65PAOIGkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:04.536838Z"},"content_sha256":"13809334dc1a75339d544b1c2c3272c8eb654d4203dcad8c2ad8732fe97e06b3","schema_version":"1.0","event_id":"sha256:13809334dc1a75339d544b1c2c3272c8eb654d4203dcad8c2ad8732fe97e06b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A7IQPMEBE2GGLPM7HMFMSYNYHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data mining when each data point is a network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cs.SI","authors_text":"Alexander Holiday, Assimakis A. Kattis, Ioannis G. Kevrekidis, Karthikeyan Rajendran, Risi Kondor","submitted_at":"2016-12-09T04:11:50Z","abstract_excerpt":"We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of modeling contexts, especially when coarse-graining the detailed graph information is of interest. One of the main challenges in mining graph data is the definition of a suitable pairwise similarity metric in the space of graphs. We explore two practical solutions to solving this problem: one based on finding subgraph densities, and one using spectral information. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02908","kind":"arxiv","version":1},"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-18T00:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKUuhY4LQN+I/0Rvuy2tb4jj6LasaRNcNJTuWZnFxhLI8GnVzYCF+zJeZux3Sj2yfemtPI/6j9uF5WDCjxykBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:04.537255Z"},"content_sha256":"be666ccd276e4d16a2cafadac968b9534327fc461af26d8891764f3c6f30df12","schema_version":"1.0","event_id":"sha256:be666ccd276e4d16a2cafadac968b9534327fc461af26d8891764f3c6f30df12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/bundle.json","state_url":"https://pith.science/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/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-05-31T21:54:04Z","links":{"resolver":"https://pith.science/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV","bundle":"https://pith.science/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/bundle.json","state":"https://pith.science/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7IQPMEBE2GGLPM7HMFMSYNYHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A7IQPMEBE2GGLPM7HMFMSYNYHV","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":"4b341713d71823d0d6af4b634bb2d4e083e152731bfce79bcaad78bc2057b035","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-09T04:11:50Z","title_canon_sha256":"0e4a2503bdd6d2d64deb679990c23a546629edee6eac3f9d7727ce5a3d155416"},"schema_version":"1.0","source":{"id":"1612.02908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02908","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02908v1","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02908","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"A7IQPMEBE2GG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7IQPMEBE2GGLPM7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7IQPMEB","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:be666ccd276e4d16a2cafadac968b9534327fc461af26d8891764f3c6f30df12","target":"graph","created_at":"2026-05-18T00:55:27Z","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 discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of modeling contexts, especially when coarse-graining the detailed graph information is of interest. One of the main challenges in mining graph data is the definition of a suitable pairwise similarity metric in the space of graphs. We explore two practical solutions to solving this problem: one based on finding subgraph densities, and one using spectral information. ","authors_text":"Alexander Holiday, Assimakis A. Kattis, Ioannis G. Kevrekidis, Karthikeyan Rajendran, Risi Kondor","cross_cats":["physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-09T04:11:50Z","title":"Data mining when each data point is a network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02908","kind":"arxiv","version":1},"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:13809334dc1a75339d544b1c2c3272c8eb654d4203dcad8c2ad8732fe97e06b3","target":"record","created_at":"2026-05-18T00:55:27Z","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":"4b341713d71823d0d6af4b634bb2d4e083e152731bfce79bcaad78bc2057b035","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-09T04:11:50Z","title_canon_sha256":"0e4a2503bdd6d2d64deb679990c23a546629edee6eac3f9d7727ce5a3d155416"},"schema_version":"1.0","source":{"id":"1612.02908","kind":"arxiv","version":1}},"canonical_sha256":"07d107b081268c65bd9f3b0ac961b83d79a97bbab073e3bc4b504c788b5183e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d107b081268c65bd9f3b0ac961b83d79a97bbab073e3bc4b504c788b5183e7","first_computed_at":"2026-05-18T00:55:27.993661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:27.993661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XcjsfR5COvXM6ARtXrQC9qMUxqjFfw2QVe+0uyE7H+Oxytt5MExTOSE64AVIhJnBVXtKmnpTnbLPB1w9E85CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:27.994101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13809334dc1a75339d544b1c2c3272c8eb654d4203dcad8c2ad8732fe97e06b3","sha256:be666ccd276e4d16a2cafadac968b9534327fc461af26d8891764f3c6f30df12"],"state_sha256":"e1f079c13399e68cd8823344e7b7239950ba71c678fd6a2de57498101f36d1c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7ICKm79dBU2FVRNz2/hKRIein4fb6v3SQwN17hCQ0+dnB+CAlIZxzIH93u1Ge6wF/ke2BWIPcZXSDL+FivOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:54:04.540622Z","bundle_sha256":"47731239f17773d72338ac195b2b7ff6f0c42408b3073f1dd1643c59db98335c"}}