{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XFW4NK4CQS7JF3RN6SGXK2IBIT","short_pith_number":"pith:XFW4NK4C","canonical_record":{"source":{"id":"2302.03615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-02-07T17:19:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d15ce0114705602d55e09e4392186b85961e7ec951131e25ee6be19bb261f72d","abstract_canon_sha256":"07a3a05bdb783451f1050db79cb682a780949ed1b1bd159129655104364bb9d1"},"schema_version":"1.0"},"canonical_sha256":"b96dc6ab8284be92ee2df48d75690144e45ec665dc375210aee8117984d2d91d","source":{"kind":"arxiv","id":"2302.03615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03615","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03615v1","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03615","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"XFW4NK4CQS7J","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"XFW4NK4CQS7JF3RN","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"XFW4NK4C","created_at":"2026-07-05T05:39:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XFW4NK4CQS7JF3RN6SGXK2IBIT","target":"record","payload":{"canonical_record":{"source":{"id":"2302.03615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-02-07T17:19:59Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d15ce0114705602d55e09e4392186b85961e7ec951131e25ee6be19bb261f72d","abstract_canon_sha256":"07a3a05bdb783451f1050db79cb682a780949ed1b1bd159129655104364bb9d1"},"schema_version":"1.0"},"canonical_sha256":"b96dc6ab8284be92ee2df48d75690144e45ec665dc375210aee8117984d2d91d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:38.811129Z","signature_b64":"yTTO0CP5hR5RQKLFPSIkZGD5JFI89+zg0bpXISCfuoo5m/wPpQiyzjhIfw5Uv14Te6HwXyO6Hkn1EI2KsnScDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96dc6ab8284be92ee2df48d75690144e45ec665dc375210aee8117984d2d91d","last_reissued_at":"2026-07-05T05:39:38.810761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:38.810761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.03615","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-07-05T05:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGEEtJoGmBBY6DNIgiFky34Sn6bQJ/WJZ+FvLgtOMitSDwRP/GWqIvqnRvJStzpecFyWe2Mei9qgim0SywbIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:23:21.052849Z"},"content_sha256":"a1de1d94d746faa5a6b1751d7c6cfa5be4888a0334b96c8497c51698866b2a04","schema_version":"1.0","event_id":"sha256:a1de1d94d746faa5a6b1751d7c6cfa5be4888a0334b96c8497c51698866b2a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XFW4NK4CQS7JF3RN6SGXK2IBIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lars Eld\\'en","submitted_at":"2023-02-07T17:19:59Z","abstract_excerpt":"The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph Laplacian) are computed. It is shown that the information necessary for partitioning is contained in the subspace spanned by the k eigenvectors. The partitioning is encoded in a matrix $\\Psi$ in indicator form, which is computed by approximating the eigenvector matrix by a product of $\\Psi$ and an orthogonal matrix. A measure of the distance of a graph to bei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03615","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.03615/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEesFRjPqbFshyCUcMcpz2ld61uQBnXqDURsPK2COBa171C7ck44rOvjUXU7X97D2Ihc+9SEWmklweoX9FCkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:23:21.053808Z"},"content_sha256":"b89cb4a248f1667ebc67e5802d833cacf7b51796af9a1a6b69afc7978e716257","schema_version":"1.0","event_id":"sha256:b89cb4a248f1667ebc67e5802d833cacf7b51796af9a1a6b69afc7978e716257"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/bundle.json","state_url":"https://pith.science/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/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-08-16T13:23:21Z","links":{"resolver":"https://pith.science/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT","bundle":"https://pith.science/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/bundle.json","state":"https://pith.science/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFW4NK4CQS7JF3RN6SGXK2IBIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XFW4NK4CQS7JF3RN6SGXK2IBIT","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":"07a3a05bdb783451f1050db79cb682a780949ed1b1bd159129655104364bb9d1","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-02-07T17:19:59Z","title_canon_sha256":"d15ce0114705602d55e09e4392186b85961e7ec951131e25ee6be19bb261f72d"},"schema_version":"1.0","source":{"id":"2302.03615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03615","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03615v1","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03615","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"XFW4NK4CQS7J","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"XFW4NK4CQS7JF3RN","created_at":"2026-07-05T05:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"XFW4NK4C","created_at":"2026-07-05T05:39:38Z"}],"graph_snapshots":[{"event_id":"sha256:b89cb4a248f1667ebc67e5802d833cacf7b51796af9a1a6b69afc7978e716257","target":"graph","created_at":"2026-07-05T05:39:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.03615/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph Laplacian) are computed. It is shown that the information necessary for partitioning is contained in the subspace spanned by the k eigenvectors. The partitioning is encoded in a matrix $\\Psi$ in indicator form, which is computed by approximating the eigenvector matrix by a product of $\\Psi$ and an orthogonal matrix. A measure of the distance of a graph to bei","authors_text":"Lars Eld\\'en","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-02-07T17:19:59Z","title":"Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03615","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:a1de1d94d746faa5a6b1751d7c6cfa5be4888a0334b96c8497c51698866b2a04","target":"record","created_at":"2026-07-05T05:39:38Z","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":"07a3a05bdb783451f1050db79cb682a780949ed1b1bd159129655104364bb9d1","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2023-02-07T17:19:59Z","title_canon_sha256":"d15ce0114705602d55e09e4392186b85961e7ec951131e25ee6be19bb261f72d"},"schema_version":"1.0","source":{"id":"2302.03615","kind":"arxiv","version":1}},"canonical_sha256":"b96dc6ab8284be92ee2df48d75690144e45ec665dc375210aee8117984d2d91d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96dc6ab8284be92ee2df48d75690144e45ec665dc375210aee8117984d2d91d","first_computed_at":"2026-07-05T05:39:38.810761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:39:38.810761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTTO0CP5hR5RQKLFPSIkZGD5JFI89+zg0bpXISCfuoo5m/wPpQiyzjhIfw5Uv14Te6HwXyO6Hkn1EI2KsnScDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:39:38.811129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.03615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1de1d94d746faa5a6b1751d7c6cfa5be4888a0334b96c8497c51698866b2a04","sha256:b89cb4a248f1667ebc67e5802d833cacf7b51796af9a1a6b69afc7978e716257"],"state_sha256":"d05be5c8af8de32b2677a1dcc1b7fffd76ffecb44ace1a0904e505e221778db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pek+bfdBUx8yZQPQ17DdUkp8m/Wz33zDkOJzJRGDpzozlxsE2siHzLtQECg2b5YU2el4hAi7sR5095WeAajoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:23:21.060160Z","bundle_sha256":"416167c2450b5e45a9252c7a4cfdb0f77a91a06da67fdf8f0a8e30de0efa487a"}}