{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UXGWQTTWQZ6ZPCBMLSQTEMEFGE","short_pith_number":"pith:UXGWQTTW","canonical_record":{"source":{"id":"1808.10650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T09:51:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c5860aecb86e2d79eb8b32498e9379dfc85f86211074fc20eedefacd58730a4e","abstract_canon_sha256":"b698c71ea31471a083118df809eb066ece062f9a21253406002a5733b40ab30f"},"schema_version":"1.0"},"canonical_sha256":"a5cd684e76867d97882c5ca1323085312a8ea872ec946cf683f05d375e8e5f73","source":{"kind":"arxiv","id":"1808.10650","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10650","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10650v2","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10650","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"UXGWQTTWQZ6Z","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UXGWQTTWQZ6ZPCBM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UXGWQTTW","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UXGWQTTWQZ6ZPCBMLSQTEMEFGE","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T09:51:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c5860aecb86e2d79eb8b32498e9379dfc85f86211074fc20eedefacd58730a4e","abstract_canon_sha256":"b698c71ea31471a083118df809eb066ece062f9a21253406002a5733b40ab30f"},"schema_version":"1.0"},"canonical_sha256":"a5cd684e76867d97882c5ca1323085312a8ea872ec946cf683f05d375e8e5f73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:14.974892Z","signature_b64":"D67Qo9eXLTpf/VuiMKup7mTiUCdgxhQ4vzjxq1Xmrr1fBIicBXax1ccyQEmVs0cHWsufBHQMh9VdvMROTM93CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5cd684e76867d97882c5ca1323085312a8ea872ec946cf683f05d375e8e5f73","last_reissued_at":"2026-05-17T23:57:14.974442Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:14.974442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10650","source_version":2,"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:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJRUPKK7o21mpMBCP9UywyjjbN0RgYBTW9yuJN/pXtWeD0gXDJn8rLyE6ozqbHe8cBBC+AOATsVgjE6twmbtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:57:31.198656Z"},"content_sha256":"ef0407a1c171c02c4481c26af381d09a05382930a78b53ae17ee98f688ecdf7e","schema_version":"1.0","event_id":"sha256:ef0407a1c171c02c4481c26af381d09a05382930a78b53ae17ee98f688ecdf7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UXGWQTTWQZ6ZPCBMLSQTEMEFGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph reduction with spectral and cut guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Andreas Loukas","submitted_at":"2018-08-31T09:51:12Z","abstract_excerpt":"Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity measure used for graph sparsification. This choice is motivated by the observation that restricted approximation carries strong spectral and cut guarantees, and that it implies approximation results for unsupervised learning problems relying on spectral embeddings.\n  The paper then focuses on coarsening---the most common type of graph reduction. Sufficient con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10650","kind":"arxiv","version":2},"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:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yl+lR1/rlB0SOVOD73qN/FWBRNhKvQFipfvf8UibYOLqhIAQdXBFuU1BSTkIBpQ6AucOpAkqeuUfAecibBbgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:57:31.199308Z"},"content_sha256":"08204d329514dd0a62e1aafc33890f4b02cb5ac38bbe29e3b85c859b01e8b8d6","schema_version":"1.0","event_id":"sha256:08204d329514dd0a62e1aafc33890f4b02cb5ac38bbe29e3b85c859b01e8b8d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/bundle.json","state_url":"https://pith.science/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/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-07-02T00:57:31Z","links":{"resolver":"https://pith.science/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE","bundle":"https://pith.science/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/bundle.json","state":"https://pith.science/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXGWQTTWQZ6ZPCBMLSQTEMEFGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UXGWQTTWQZ6ZPCBMLSQTEMEFGE","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":"b698c71ea31471a083118df809eb066ece062f9a21253406002a5733b40ab30f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T09:51:12Z","title_canon_sha256":"c5860aecb86e2d79eb8b32498e9379dfc85f86211074fc20eedefacd58730a4e"},"schema_version":"1.0","source":{"id":"1808.10650","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10650","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10650v2","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10650","created_at":"2026-05-17T23:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"UXGWQTTWQZ6Z","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UXGWQTTWQZ6ZPCBM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UXGWQTTW","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:08204d329514dd0a62e1aafc33890f4b02cb5ac38bbe29e3b85c859b01e8b8d6","target":"graph","created_at":"2026-05-17T23:57:14Z","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":"Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity measure used for graph sparsification. This choice is motivated by the observation that restricted approximation carries strong spectral and cut guarantees, and that it implies approximation results for unsupervised learning problems relying on spectral embeddings.\n  The paper then focuses on coarsening---the most common type of graph reduction. Sufficient con","authors_text":"Andreas Loukas","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T09:51:12Z","title":"Graph reduction with spectral and cut guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10650","kind":"arxiv","version":2},"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:ef0407a1c171c02c4481c26af381d09a05382930a78b53ae17ee98f688ecdf7e","target":"record","created_at":"2026-05-17T23:57:14Z","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":"b698c71ea31471a083118df809eb066ece062f9a21253406002a5733b40ab30f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T09:51:12Z","title_canon_sha256":"c5860aecb86e2d79eb8b32498e9379dfc85f86211074fc20eedefacd58730a4e"},"schema_version":"1.0","source":{"id":"1808.10650","kind":"arxiv","version":2}},"canonical_sha256":"a5cd684e76867d97882c5ca1323085312a8ea872ec946cf683f05d375e8e5f73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5cd684e76867d97882c5ca1323085312a8ea872ec946cf683f05d375e8e5f73","first_computed_at":"2026-05-17T23:57:14.974442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:14.974442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D67Qo9eXLTpf/VuiMKup7mTiUCdgxhQ4vzjxq1Xmrr1fBIicBXax1ccyQEmVs0cHWsufBHQMh9VdvMROTM93CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:14.974892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10650","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef0407a1c171c02c4481c26af381d09a05382930a78b53ae17ee98f688ecdf7e","sha256:08204d329514dd0a62e1aafc33890f4b02cb5ac38bbe29e3b85c859b01e8b8d6"],"state_sha256":"ad4ceb2282e9102c8a2d674e2c2399863be9db4c8ab7d1face9cfb36b47983b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ag8Skjt8WAaY/WHBeZmuueCB0A2KSnSMHV6zRT/7PmZPWeaB+lu4nRGZqBKnitLVqKFPbHpa4m+Oro+ALPzxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T00:57:31.202294Z","bundle_sha256":"e16295aff0841a0f6aad8b2fa544fea1ce3b35cddaa50bdcd63351b92793749d"}}