{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N2EFZKICHHRGWEPRNFINJLSKMD","short_pith_number":"pith:N2EFZKIC","canonical_record":{"source":{"id":"1710.08878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-24T16:34:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d88ec590642e23c2abfc2dccdbe2640d994e9716c05e73992b28dda399cca7fd","abstract_canon_sha256":"cceaf3ebefc15850f0902c182db330a5d8d224e914303e547a38e03b0ed01800"},"schema_version":"1.0"},"canonical_sha256":"6e885ca90239e26b11f16950d4ae4a60d6bd49b8a83ad978149c5fbd0d0ba072","source":{"kind":"arxiv","id":"1710.08878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08878","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08878v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08878","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"N2EFZKICHHRG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2EFZKICHHRGWEPR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2EFZKIC","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N2EFZKICHHRGWEPRNFINJLSKMD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-24T16:34:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d88ec590642e23c2abfc2dccdbe2640d994e9716c05e73992b28dda399cca7fd","abstract_canon_sha256":"cceaf3ebefc15850f0902c182db330a5d8d224e914303e547a38e03b0ed01800"},"schema_version":"1.0"},"canonical_sha256":"6e885ca90239e26b11f16950d4ae4a60d6bd49b8a83ad978149c5fbd0d0ba072","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:03.547057Z","signature_b64":"nfR1NQNdOdrr70plHUEZuT4IBsNegQod+anMOYWQj75XxiQhXzXr0gGt8ib9qcAVUQ3eqBwYMRWQeLbtrY7YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e885ca90239e26b11f16950d4ae4a60d6bd49b8a83ad978149c5fbd0d0ba072","last_reissued_at":"2026-05-18T00:32:03.546429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:03.546429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08878","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:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cb+/NeYUVV+X6UHAY1UEgvg2ELQ8QGsG0/yX+M2b9saJq1VOaoLzRd+oUk1HJR4kr3tqn1ZwcxdMYLh9I0oUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:11:48.003632Z"},"content_sha256":"a686a5ca4335f7f8dbd6ec25d78aecca4a3940ae7ea639da15c8fc117b946e1f","schema_version":"1.0","event_id":"sha256:a686a5ca4335f7f8dbd6ec25d78aecca4a3940ae7ea639da15c8fc117b946e1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N2EFZKICHHRGWEPRNFINJLSKMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification on Large Networks: A Quantitative Bound via Motifs and Graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Haupt, Mohammad Khatami, Ngoc Mai Tran, Thomas Schultz","submitted_at":"2017-10-24T16:34:37Z","abstract_excerpt":"When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with theoretically. Via graphon theory, we give an explicit quantitative bound for the ability of motif homomorphisms to distinguish large networks under both generative and sampling noise. Furthermore, we give similar bounds for the graph spectrum and connect it to homomorphism densities of cycles. This results in an easily computable classifier on graph data wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08878","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:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYX1Md6/tw8dVCmKWNNy/Zh0rvQ69hdwFHNOK53acN/YMk1dxxCFz4xF7S/MJqAMgunnNaRFVyvRVAFuVXxJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:11:48.004401Z"},"content_sha256":"47f6f4061d30b5ba1d3596391cf60bf9efb7c3debee33b3d6b2383a1dcbaf3f9","schema_version":"1.0","event_id":"sha256:47f6f4061d30b5ba1d3596391cf60bf9efb7c3debee33b3d6b2383a1dcbaf3f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2EFZKICHHRGWEPRNFINJLSKMD/bundle.json","state_url":"https://pith.science/pith/N2EFZKICHHRGWEPRNFINJLSKMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2EFZKICHHRGWEPRNFINJLSKMD/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-25T19:11:48Z","links":{"resolver":"https://pith.science/pith/N2EFZKICHHRGWEPRNFINJLSKMD","bundle":"https://pith.science/pith/N2EFZKICHHRGWEPRNFINJLSKMD/bundle.json","state":"https://pith.science/pith/N2EFZKICHHRGWEPRNFINJLSKMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2EFZKICHHRGWEPRNFINJLSKMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N2EFZKICHHRGWEPRNFINJLSKMD","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":"cceaf3ebefc15850f0902c182db330a5d8d224e914303e547a38e03b0ed01800","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-24T16:34:37Z","title_canon_sha256":"d88ec590642e23c2abfc2dccdbe2640d994e9716c05e73992b28dda399cca7fd"},"schema_version":"1.0","source":{"id":"1710.08878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08878","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08878v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08878","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"N2EFZKICHHRG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N2EFZKICHHRGWEPR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N2EFZKIC","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:47f6f4061d30b5ba1d3596391cf60bf9efb7c3debee33b3d6b2383a1dcbaf3f9","target":"graph","created_at":"2026-05-18T00:32:03Z","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":"When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with theoretically. Via graphon theory, we give an explicit quantitative bound for the ability of motif homomorphisms to distinguish large networks under both generative and sampling noise. Furthermore, we give similar bounds for the graph spectrum and connect it to homomorphism densities of cycles. This results in an easily computable classifier on graph data wit","authors_text":"Andreas Haupt, Mohammad Khatami, Ngoc Mai Tran, Thomas Schultz","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-24T16:34:37Z","title":"Classification on Large Networks: A Quantitative Bound via Motifs and Graphons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08878","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:a686a5ca4335f7f8dbd6ec25d78aecca4a3940ae7ea639da15c8fc117b946e1f","target":"record","created_at":"2026-05-18T00:32:03Z","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":"cceaf3ebefc15850f0902c182db330a5d8d224e914303e547a38e03b0ed01800","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-24T16:34:37Z","title_canon_sha256":"d88ec590642e23c2abfc2dccdbe2640d994e9716c05e73992b28dda399cca7fd"},"schema_version":"1.0","source":{"id":"1710.08878","kind":"arxiv","version":1}},"canonical_sha256":"6e885ca90239e26b11f16950d4ae4a60d6bd49b8a83ad978149c5fbd0d0ba072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e885ca90239e26b11f16950d4ae4a60d6bd49b8a83ad978149c5fbd0d0ba072","first_computed_at":"2026-05-18T00:32:03.546429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:03.546429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nfR1NQNdOdrr70plHUEZuT4IBsNegQod+anMOYWQj75XxiQhXzXr0gGt8ib9qcAVUQ3eqBwYMRWQeLbtrY7YBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:03.547057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a686a5ca4335f7f8dbd6ec25d78aecca4a3940ae7ea639da15c8fc117b946e1f","sha256:47f6f4061d30b5ba1d3596391cf60bf9efb7c3debee33b3d6b2383a1dcbaf3f9"],"state_sha256":"825990de114caee623cd966dc5b7f48829760faece61c2ac276c7b66fc8826fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//Dkgtcxap15TDhgG0/x8uBhBNRxtN/7TQY3SPOJklgwXGNoBiYUnfMzXOY36lWpyUnMKPlsZ+vR+I9acXGKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:11:48.008730Z","bundle_sha256":"34d77eb944712340e84c66b6f32c944bbe691dd2b7fae7589806790ad8f7ca88"}}