{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SWCY5BK4C5F535L7HKX26ME5CI","short_pith_number":"pith:SWCY5BK4","canonical_record":{"source":{"id":"1702.05570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-18T04:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"d69dcbe6b4aa0bc06bf311d4a5735c05b95d3e42d1a85834c7fafe968de1c680","abstract_canon_sha256":"ab1bce650b3cb443b8ac7de9d5b64b136e0e22b7f48b12cfecbf29ca8fb4868c"},"schema_version":"1.0"},"canonical_sha256":"95858e855c174bddf57f3aafaf309d122f0a18d434c9918d80e2d2e6934f6b9f","source":{"kind":"arxiv","id":"1702.05570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05570","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05570v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05570","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"SWCY5BK4C5F5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SWCY5BK4C5F535L7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SWCY5BK4","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SWCY5BK4C5F535L7HKX26ME5CI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-18T04:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"d69dcbe6b4aa0bc06bf311d4a5735c05b95d3e42d1a85834c7fafe968de1c680","abstract_canon_sha256":"ab1bce650b3cb443b8ac7de9d5b64b136e0e22b7f48b12cfecbf29ca8fb4868c"},"schema_version":"1.0"},"canonical_sha256":"95858e855c174bddf57f3aafaf309d122f0a18d434c9918d80e2d2e6934f6b9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:30.431670Z","signature_b64":"vGJ7ZTVXtY/9cyRY8ek2hCBEozX1oPxIPQ2kSuLozFfCyOTN+49tY17rg0AY6BTKWQJBaMXE3kgMwKm6n2vHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95858e855c174bddf57f3aafaf309d122f0a18d434c9918d80e2d2e6934f6b9f","last_reissued_at":"2026-05-18T00:50:30.430938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:30.430938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05570","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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yFw5PaHCCqAVFAv8XjPgojL8zVnQUeUFQpXOpx7tsWA08HJQuhtZzemX/LLzKb1S4dhimM99ITpR48phMV3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:07:34.535297Z"},"content_sha256":"f116d0578c6e95e458311aad90c195a712058b85c8307f30e3f3926cdd6a9dbb","schema_version":"1.0","event_id":"sha256:f116d0578c6e95e458311aad90c195a712058b85c8307f30e3f3926cdd6a9dbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SWCY5BK4C5F535L7HKX26ME5CI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-way sparsest cut problem on trees with a control on the number of parts and outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ramin Javadi, Saleh Ashkboos","submitted_at":"2017-02-18T04:49:13Z","abstract_excerpt":"Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generalization of this problem seeking for $ k $ disjoint subsets of vertices (clusters) whose all edge expansions are small and furthermore, the number of vertices remained in the exterior of the subsets (outliers) is also small. We prove that although this problem is $ NP-$hard for trees, it can be solved in polynomial time for all weighted trees, provided that we restrict the search space to subsets which induce connected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05570","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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxsZIKvycPR+Gve1EpLOYt7m67S8Be37EKWvl6BcA6rbP0FWIUmYyRjpSH0EIoievashqJoJQ/Yw3uEhd9dYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:07:34.535680Z"},"content_sha256":"dfabc21ee67821d9764b7419dbb5b6a315222f1ef6621f86af0e4c1f5a28806b","schema_version":"1.0","event_id":"sha256:dfabc21ee67821d9764b7419dbb5b6a315222f1ef6621f86af0e4c1f5a28806b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWCY5BK4C5F535L7HKX26ME5CI/bundle.json","state_url":"https://pith.science/pith/SWCY5BK4C5F535L7HKX26ME5CI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWCY5BK4C5F535L7HKX26ME5CI/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-05-20T01:07:34Z","links":{"resolver":"https://pith.science/pith/SWCY5BK4C5F535L7HKX26ME5CI","bundle":"https://pith.science/pith/SWCY5BK4C5F535L7HKX26ME5CI/bundle.json","state":"https://pith.science/pith/SWCY5BK4C5F535L7HKX26ME5CI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWCY5BK4C5F535L7HKX26ME5CI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SWCY5BK4C5F535L7HKX26ME5CI","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":"ab1bce650b3cb443b8ac7de9d5b64b136e0e22b7f48b12cfecbf29ca8fb4868c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-18T04:49:13Z","title_canon_sha256":"d69dcbe6b4aa0bc06bf311d4a5735c05b95d3e42d1a85834c7fafe968de1c680"},"schema_version":"1.0","source":{"id":"1702.05570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05570","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05570v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05570","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"SWCY5BK4C5F5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SWCY5BK4C5F535L7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SWCY5BK4","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:dfabc21ee67821d9764b7419dbb5b6a315222f1ef6621f86af0e4c1f5a28806b","target":"graph","created_at":"2026-05-18T00:50:30Z","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":"Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generalization of this problem seeking for $ k $ disjoint subsets of vertices (clusters) whose all edge expansions are small and furthermore, the number of vertices remained in the exterior of the subsets (outliers) is also small. We prove that although this problem is $ NP-$hard for trees, it can be solved in polynomial time for all weighted trees, provided that we restrict the search space to subsets which induce connected","authors_text":"Ramin Javadi, Saleh Ashkboos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-18T04:49:13Z","title":"Multi-way sparsest cut problem on trees with a control on the number of parts and outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05570","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:f116d0578c6e95e458311aad90c195a712058b85c8307f30e3f3926cdd6a9dbb","target":"record","created_at":"2026-05-18T00:50:30Z","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":"ab1bce650b3cb443b8ac7de9d5b64b136e0e22b7f48b12cfecbf29ca8fb4868c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-18T04:49:13Z","title_canon_sha256":"d69dcbe6b4aa0bc06bf311d4a5735c05b95d3e42d1a85834c7fafe968de1c680"},"schema_version":"1.0","source":{"id":"1702.05570","kind":"arxiv","version":1}},"canonical_sha256":"95858e855c174bddf57f3aafaf309d122f0a18d434c9918d80e2d2e6934f6b9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95858e855c174bddf57f3aafaf309d122f0a18d434c9918d80e2d2e6934f6b9f","first_computed_at":"2026-05-18T00:50:30.430938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:30.430938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGJ7ZTVXtY/9cyRY8ek2hCBEozX1oPxIPQ2kSuLozFfCyOTN+49tY17rg0AY6BTKWQJBaMXE3kgMwKm6n2vHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:30.431670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f116d0578c6e95e458311aad90c195a712058b85c8307f30e3f3926cdd6a9dbb","sha256:dfabc21ee67821d9764b7419dbb5b6a315222f1ef6621f86af0e4c1f5a28806b"],"state_sha256":"9adf6928ddaa49950fba3abf291507729f9059824e1f8d19a07868aa5c2cee6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQs9Ak5Xqh3I8CVbRCBMsvkKdPXuinJjU5FMh9VZSnKIG98YEesY3TQwVWF3trnebYTLsmGzuzBx6u0ZY0Q3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:07:34.537737Z","bundle_sha256":"138186d95337ae7aa870156851fb0751b266abff29442d8a5e0eb7dab5b334f6"}}