{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:67XYUZAUPHROEK4DA6NID36HU7","short_pith_number":"pith:67XYUZAU","canonical_record":{"source":{"id":"1907.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-22T21:34:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3e33f8e8cb5c7b92643b6edbc4aa831c1b71769be09ce075ca0eccaaca5edeb","abstract_canon_sha256":"b5aa747baf1a4db2efa72366081f0a6e661115f388bfdc37e9e0c0fbf87309e2"},"schema_version":"1.0"},"canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","source":{"kind":"arxiv","id":"1907.09588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09588","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09588v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09588","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"67XYUZAUPHRO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"67XYUZAUPHROEK4D","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"67XYUZAU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:67XYUZAUPHROEK4DA6NID36HU7","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-22T21:34:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3e33f8e8cb5c7b92643b6edbc4aa831c1b71769be09ce075ca0eccaaca5edeb","abstract_canon_sha256":"b5aa747baf1a4db2efa72366081f0a6e661115f388bfdc37e9e0c0fbf87309e2"},"schema_version":"1.0"},"canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:52.835915Z","signature_b64":"ONuX6gFgkdG4/ihZN4jPSqE/e3GiV4OZ7eg7zlmoEVNyy1XWGnH+6uyvEjT1MyCbA5sZpSRYgbXaepCh4AN3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","last_reissued_at":"2026-05-17T23:39:52.835413Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:52.835413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09588","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-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/pR56EHCdRwYRBlpi/6A96mXjyULbWgozYvp3/LYEAoCSYiL78l7k4NU/9qsRbFDeny9k5iuvMPMOJm9JE7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:37:14.248252Z"},"content_sha256":"92279fa3c9b8c97339a8bd955fa9a09062607f5848628fdf4c8ef7854e0f0c33","schema_version":"1.0","event_id":"sha256:92279fa3c9b8c97339a8bd955fa9a09062607f5848628fdf4c8ef7854e0f0c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:67XYUZAUPHROEK4DA6NID36HU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aapo Hyv\\\"arinen, Gang Niu, Masashi Sugiyama, Wenkai Xu","submitted_at":"2019-07-22T21:34:47Z","abstract_excerpt":"Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on \"Min-Cut\"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. On the other hand, compressing the vertices while preserving the directed edge information provides a way to learn the small-scale representation of a directed graph. The reconstruction error, which measures the edge information preserved by the summarized graph, can be used to le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09588","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-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ay9g9Gk8wldl4r1pLkSqQvF7e+roRMnTA0qUsrnUYxT/4Ud/oOgvGqo5wlw8pnNDxQqnWWhXuv6seITZVIwkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:37:14.248616Z"},"content_sha256":"6576561afc9d5a9d01809463bc6c23f07729db4e4cf14e69f46d2ca7f43d793c","schema_version":"1.0","event_id":"sha256:6576561afc9d5a9d01809463bc6c23f07729db4e4cf14e69f46d2ca7f43d793c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/bundle.json","state_url":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67XYUZAUPHROEK4DA6NID36HU7/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-03T06:37:14Z","links":{"resolver":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7","bundle":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/bundle.json","state":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67XYUZAUPHROEK4DA6NID36HU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:67XYUZAUPHROEK4DA6NID36HU7","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":"b5aa747baf1a4db2efa72366081f0a6e661115f388bfdc37e9e0c0fbf87309e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-22T21:34:47Z","title_canon_sha256":"d3e33f8e8cb5c7b92643b6edbc4aa831c1b71769be09ce075ca0eccaaca5edeb"},"schema_version":"1.0","source":{"id":"1907.09588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09588","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09588v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09588","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"67XYUZAUPHRO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"67XYUZAUPHROEK4D","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"67XYUZAU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6576561afc9d5a9d01809463bc6c23f07729db4e4cf14e69f46d2ca7f43d793c","target":"graph","created_at":"2026-05-17T23:39:52Z","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":"Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on \"Min-Cut\"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. On the other hand, compressing the vertices while preserving the directed edge information provides a way to learn the small-scale representation of a directed graph. The reconstruction error, which measures the edge information preserved by the summarized graph, can be used to le","authors_text":"Aapo Hyv\\\"arinen, Gang Niu, Masashi Sugiyama, Wenkai Xu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-22T21:34:47Z","title":"Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09588","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:92279fa3c9b8c97339a8bd955fa9a09062607f5848628fdf4c8ef7854e0f0c33","target":"record","created_at":"2026-05-17T23:39:52Z","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":"b5aa747baf1a4db2efa72366081f0a6e661115f388bfdc37e9e0c0fbf87309e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-22T21:34:47Z","title_canon_sha256":"d3e33f8e8cb5c7b92643b6edbc4aa831c1b71769be09ce075ca0eccaaca5edeb"},"schema_version":"1.0","source":{"id":"1907.09588","kind":"arxiv","version":1}},"canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","first_computed_at":"2026-05-17T23:39:52.835413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:52.835413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ONuX6gFgkdG4/ihZN4jPSqE/e3GiV4OZ7eg7zlmoEVNyy1XWGnH+6uyvEjT1MyCbA5sZpSRYgbXaepCh4AN3Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:52.835915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92279fa3c9b8c97339a8bd955fa9a09062607f5848628fdf4c8ef7854e0f0c33","sha256:6576561afc9d5a9d01809463bc6c23f07729db4e4cf14e69f46d2ca7f43d793c"],"state_sha256":"7f3564800998dc395c0c7b0d9d97915779ce146a1dfd709b683d3f2b459166d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzcO6CewwqQPqhzFsK14oAqDXJj8xGmA9x4gN1oMgVdpI+/28BV9MrQOIKhutsqgMeomIENlQkOAEzFFVOmXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:37:14.250611Z","bundle_sha256":"30e9a09c80b5c3ab05ebc9e164d3c83e0c434b2342fe937cbeb1003254b8efaa"}}