{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:67XYUZAUPHROEK4DA6NID36HU7","short_pith_number":"pith:67XYUZAU","schema_version":"1.0","canonical_sha256":"f7ef8a641479e2e22b83079a81efc7a7e0eea19888d8f50d5795095c463d362f","source":{"kind":"arxiv","id":"1907.09588","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.09588","created_at":"2026-05-17T23:39:52.835477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09588v1","created_at":"2026-05-17T23:39:52.835477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09588","created_at":"2026-05-17T23:39:52.835477+00:00"},{"alias_kind":"pith_short_12","alias_value":"67XYUZAUPHRO","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"67XYUZAUPHROEK4D","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"67XYUZAU","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7","json":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7.json","graph_json":"https://pith.science/api/pith-number/67XYUZAUPHROEK4DA6NID36HU7/graph.json","events_json":"https://pith.science/api/pith-number/67XYUZAUPHROEK4DA6NID36HU7/events.json","paper":"https://pith.science/paper/67XYUZAU"},"agent_actions":{"view_html":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7","download_json":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7.json","view_paper":"https://pith.science/paper/67XYUZAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09588&json=true","fetch_graph":"https://pith.science/api/pith-number/67XYUZAUPHROEK4DA6NID36HU7/graph.json","fetch_events":"https://pith.science/api/pith-number/67XYUZAUPHROEK4DA6NID36HU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/action/storage_attestation","attest_author":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/action/author_attestation","sign_citation":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/action/citation_signature","submit_replication":"https://pith.science/pith/67XYUZAUPHROEK4DA6NID36HU7/action/replication_record"}},"created_at":"2026-05-17T23:39:52.835477+00:00","updated_at":"2026-05-17T23:39:52.835477+00:00"}