{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CAE6FME5EDFQUPYGRMVSXVUMNS","short_pith_number":"pith:CAE6FME5","schema_version":"1.0","canonical_sha256":"1009e2b09d20cb0a3f068b2b2bd68c6c8d797ba9c00bffdccda0bf5080026156","source":{"kind":"arxiv","id":"1808.00050","version":1},"attestation_state":"computed","paper":{"title":"How to sample connected $K$-partitions of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marina Meila","submitted_at":"2018-07-21T00:30:37Z","abstract_excerpt":"A connected undirected graph $G=(V,E)$ is given. This paper presents an algorithm that samples (non-uniformly) a $K$ partition $U_1,\\ldots U_K$ of the graph nodes $V$, such that the subgraph induced by each $U_k$, with $k=1:K$, is connected. Moreover, the probability induced by the algorithm over the set ${\\mathcal C}_K$ of all such partitions is obtained in closed form."},"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":"1808.00050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-21T00:30:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0fbb7f18d31bc181ba3f9dae00bfd10db9924aa0d43c8f1f8191c686cc214407","abstract_canon_sha256":"18d3510b73ada5c0fbdca923a248b980f568a66f2c9416a07ec514abc953bed8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:08.896762Z","signature_b64":"TXygWKJ1EU8EJN8l5Qg+R4wVl/oAyiCFqAWDOj/a/hCJ71R//GnqNVqTszE+2OK6otDhNp6AtDV5FXWZBwuPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1009e2b09d20cb0a3f068b2b2bd68c6c8d797ba9c00bffdccda0bf5080026156","last_reissued_at":"2026-05-18T00:09:08.896136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:08.896136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to sample connected $K$-partitions of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Marina Meila","submitted_at":"2018-07-21T00:30:37Z","abstract_excerpt":"A connected undirected graph $G=(V,E)$ is given. This paper presents an algorithm that samples (non-uniformly) a $K$ partition $U_1,\\ldots U_K$ of the graph nodes $V$, such that the subgraph induced by each $U_k$, with $k=1:K$, is connected. Moreover, the probability induced by the algorithm over the set ${\\mathcal C}_K$ of all such partitions is obtained in closed form."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00050","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":"1808.00050","created_at":"2026-05-18T00:09:08.896232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00050v1","created_at":"2026-05-18T00:09:08.896232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00050","created_at":"2026-05-18T00:09:08.896232+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAE6FME5EDFQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAE6FME5EDFQUPYG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAE6FME5","created_at":"2026-05-18T12:32:16.446611+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/CAE6FME5EDFQUPYGRMVSXVUMNS","json":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS.json","graph_json":"https://pith.science/api/pith-number/CAE6FME5EDFQUPYGRMVSXVUMNS/graph.json","events_json":"https://pith.science/api/pith-number/CAE6FME5EDFQUPYGRMVSXVUMNS/events.json","paper":"https://pith.science/paper/CAE6FME5"},"agent_actions":{"view_html":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS","download_json":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS.json","view_paper":"https://pith.science/paper/CAE6FME5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00050&json=true","fetch_graph":"https://pith.science/api/pith-number/CAE6FME5EDFQUPYGRMVSXVUMNS/graph.json","fetch_events":"https://pith.science/api/pith-number/CAE6FME5EDFQUPYGRMVSXVUMNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS/action/storage_attestation","attest_author":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS/action/author_attestation","sign_citation":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS/action/citation_signature","submit_replication":"https://pith.science/pith/CAE6FME5EDFQUPYGRMVSXVUMNS/action/replication_record"}},"created_at":"2026-05-18T00:09:08.896232+00:00","updated_at":"2026-05-18T00:09:08.896232+00:00"}