{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5XFDNFZGW3G75K6TCEAB4CHRM3","short_pith_number":"pith:5XFDNFZG","canonical_record":{"source":{"id":"1705.10817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-30T18:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"5410fd8b088109554f24d8ee7c90902f97dbcd4157aabe839661c474c0c6824d","abstract_canon_sha256":"314459c88af75b6ffb9baba50590917971cae264a4850f20512ea0914b6091d7"},"schema_version":"1.0"},"canonical_sha256":"edca369726b6cdfeabd311001e08f166d842ae1ba5886199d6befc2639fe338a","source":{"kind":"arxiv","id":"1705.10817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10817","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10817v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10817","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"5XFDNFZGW3G7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XFDNFZGW3G75K6T","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XFDNFZG","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5XFDNFZGW3G75K6TCEAB4CHRM3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-30T18:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"5410fd8b088109554f24d8ee7c90902f97dbcd4157aabe839661c474c0c6824d","abstract_canon_sha256":"314459c88af75b6ffb9baba50590917971cae264a4850f20512ea0914b6091d7"},"schema_version":"1.0"},"canonical_sha256":"edca369726b6cdfeabd311001e08f166d842ae1ba5886199d6befc2639fe338a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.161644Z","signature_b64":"GQEa7UNw5CvT6LrIR7yMnk3B3Wi/xLB8QKNpwTldcOE1tDH0Ty+ll24bTxn66S+hbehYlCj8yfw8w/vzU1uGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edca369726b6cdfeabd311001e08f166d842ae1ba5886199d6befc2639fe338a","last_reissued_at":"2026-05-18T00:43:20.161026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.161026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10817","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiQG9ExpsbdCI1xvMy2lLoEDOPhY4BI94FJStO47E7OndeLUH/r0Ryr6AeG+ZFtd+Sux8/+nTkhg2ICSlmqdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:01:52.158057Z"},"content_sha256":"0103faf9d2fdd68bd677cb02052924ae0e8ebad6347e418016c42fec39f5662f","schema_version":"1.0","event_id":"sha256:0103faf9d2fdd68bd677cb02052924ae0e8ebad6347e418016c42fec39f5662f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5XFDNFZGW3G75K6TCEAB4CHRM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamics Based Features For Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Benjamin Chiem, Jean-Charles Delvenne, Leonardo Gutierrez Gomez","submitted_at":"2017-05-30T18:33:44Z","abstract_excerpt":"Numerous social, medical, engineering and biological challenges can be framed as graph-based learning tasks. Here, we propose a new feature based approach to network classification. We show how dynamics on a network can be useful to reveal patterns about the organization of the components of the underlying graph where the process takes place. We define generalized assortativities on networks and use them as generalized features across multiple time scales. These features turn out to be suitable signatures for discriminating between different classes of networks. Our method is evaluated empiric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10817","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9g+VKegT5F2Q5h4Ag0JQ5DybPY2lZsa8zmcN2vp2ymGNNApR/VP9sFd/4A+oBwQ1cVtYEnwdMOgHdQbrjuMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:01:52.158405Z"},"content_sha256":"56ada31b8ae1cd44beaa6d8dd6611db7f14b1e85946739afa7b41e09ee07ae74","schema_version":"1.0","event_id":"sha256:56ada31b8ae1cd44beaa6d8dd6611db7f14b1e85946739afa7b41e09ee07ae74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/bundle.json","state_url":"https://pith.science/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/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-26T20:01:52Z","links":{"resolver":"https://pith.science/pith/5XFDNFZGW3G75K6TCEAB4CHRM3","bundle":"https://pith.science/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/bundle.json","state":"https://pith.science/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XFDNFZGW3G75K6TCEAB4CHRM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5XFDNFZGW3G75K6TCEAB4CHRM3","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":"314459c88af75b6ffb9baba50590917971cae264a4850f20512ea0914b6091d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-30T18:33:44Z","title_canon_sha256":"5410fd8b088109554f24d8ee7c90902f97dbcd4157aabe839661c474c0c6824d"},"schema_version":"1.0","source":{"id":"1705.10817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10817","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10817v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10817","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"5XFDNFZGW3G7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XFDNFZGW3G75K6T","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XFDNFZG","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:56ada31b8ae1cd44beaa6d8dd6611db7f14b1e85946739afa7b41e09ee07ae74","target":"graph","created_at":"2026-05-18T00:43:20Z","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":"Numerous social, medical, engineering and biological challenges can be framed as graph-based learning tasks. Here, we propose a new feature based approach to network classification. We show how dynamics on a network can be useful to reveal patterns about the organization of the components of the underlying graph where the process takes place. We define generalized assortativities on networks and use them as generalized features across multiple time scales. These features turn out to be suitable signatures for discriminating between different classes of networks. Our method is evaluated empiric","authors_text":"Benjamin Chiem, Jean-Charles Delvenne, Leonardo Gutierrez Gomez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-30T18:33:44Z","title":"Dynamics Based Features For Graph Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10817","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:0103faf9d2fdd68bd677cb02052924ae0e8ebad6347e418016c42fec39f5662f","target":"record","created_at":"2026-05-18T00:43:20Z","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":"314459c88af75b6ffb9baba50590917971cae264a4850f20512ea0914b6091d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-30T18:33:44Z","title_canon_sha256":"5410fd8b088109554f24d8ee7c90902f97dbcd4157aabe839661c474c0c6824d"},"schema_version":"1.0","source":{"id":"1705.10817","kind":"arxiv","version":1}},"canonical_sha256":"edca369726b6cdfeabd311001e08f166d842ae1ba5886199d6befc2639fe338a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edca369726b6cdfeabd311001e08f166d842ae1ba5886199d6befc2639fe338a","first_computed_at":"2026-05-18T00:43:20.161026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:20.161026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQEa7UNw5CvT6LrIR7yMnk3B3Wi/xLB8QKNpwTldcOE1tDH0Ty+ll24bTxn66S+hbehYlCj8yfw8w/vzU1uGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:20.161644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0103faf9d2fdd68bd677cb02052924ae0e8ebad6347e418016c42fec39f5662f","sha256:56ada31b8ae1cd44beaa6d8dd6611db7f14b1e85946739afa7b41e09ee07ae74"],"state_sha256":"6e823bc56de902efd43ad90b3988a189a5f01b70ff6d6c57346d76aba2aa5a8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwWg1NoObhJH6BeWbtlfDTXnlP726n2jLtSi6uLtOksL6eTCLmFoW3EgOD8pHPB7ITd/wnOjtn7LhvQm0gX9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:01:52.160256Z","bundle_sha256":"fb4d3fff961c891a8e16962b9e72431d7a5c57c989cf7fb157f7cc3e9fefb7ec"}}