{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MFHHM72M6GBWHHWY2GXQBNNW2Y","short_pith_number":"pith:MFHHM72M","schema_version":"1.0","canonical_sha256":"614e767f4cf183639ed8d1af00b5b6d61401b8322f2cacbd42629eaa6d928356","source":{"kind":"arxiv","id":"1402.2543","version":1},"attestation_state":"computed","paper":{"title":"Large Cuts with Local Algorithms on Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Joel Rybicki, Juho Hirvonen, Jukka Suomela, Stefan Schmid","submitted_at":"2014-02-11T16:06:35Z","abstract_excerpt":"We study the problem of finding large cuts in $d$-regular triangle-free graphs. In prior work, Shearer (1992) gives a randomised algorithm that finds a cut of expected size $(1/2 + 0.177/\\sqrt{d})m$, where $m$ is the number of edges. We give a simpler algorithm that does much better: it finds a cut of expected size $(1/2 + 0.28125/\\sqrt{d})m$. As a corollary, this shows that in any $d$-regular triangle-free graph there exists a cut of at least this size.\n  Our algorithm can be interpreted as a very efficient randomised distributed algorithm: each node needs to produce only one random bit, and "},"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":"1402.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-11T16:06:35Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"04de7d0cc3a9f7ac7d482c41dcc5526221c1819456a53e0a6c9cfc091d0675d4","abstract_canon_sha256":"57fb17176bb78c7e6437835ecf3d2948c4ae46239d83fcd1a11599c2501ce698"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.367137Z","signature_b64":"LHSwI2H8x2u2ltuSpjUoiZNhHAvMwEK+4qVidwQEh/m40oxmOCmBzkBh3FtJQpz5jeD9hzl3nMknj+VP5+UACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614e767f4cf183639ed8d1af00b5b6d61401b8322f2cacbd42629eaa6d928356","last_reissued_at":"2026-05-18T02:59:19.366392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.366392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Cuts with Local Algorithms on Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Joel Rybicki, Juho Hirvonen, Jukka Suomela, Stefan Schmid","submitted_at":"2014-02-11T16:06:35Z","abstract_excerpt":"We study the problem of finding large cuts in $d$-regular triangle-free graphs. In prior work, Shearer (1992) gives a randomised algorithm that finds a cut of expected size $(1/2 + 0.177/\\sqrt{d})m$, where $m$ is the number of edges. We give a simpler algorithm that does much better: it finds a cut of expected size $(1/2 + 0.28125/\\sqrt{d})m$. As a corollary, this shows that in any $d$-regular triangle-free graph there exists a cut of at least this size.\n  Our algorithm can be interpreted as a very efficient randomised distributed algorithm: each node needs to produce only one random bit, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2543","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":"1402.2543","created_at":"2026-05-18T02:59:19.366505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2543v1","created_at":"2026-05-18T02:59:19.366505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2543","created_at":"2026-05-18T02:59:19.366505+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFHHM72M6GBW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFHHM72M6GBWHHWY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFHHM72M","created_at":"2026-05-18T12:28:38.356838+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/MFHHM72M6GBWHHWY2GXQBNNW2Y","json":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y.json","graph_json":"https://pith.science/api/pith-number/MFHHM72M6GBWHHWY2GXQBNNW2Y/graph.json","events_json":"https://pith.science/api/pith-number/MFHHM72M6GBWHHWY2GXQBNNW2Y/events.json","paper":"https://pith.science/paper/MFHHM72M"},"agent_actions":{"view_html":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y","download_json":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y.json","view_paper":"https://pith.science/paper/MFHHM72M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2543&json=true","fetch_graph":"https://pith.science/api/pith-number/MFHHM72M6GBWHHWY2GXQBNNW2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/MFHHM72M6GBWHHWY2GXQBNNW2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y/action/storage_attestation","attest_author":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y/action/author_attestation","sign_citation":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y/action/citation_signature","submit_replication":"https://pith.science/pith/MFHHM72M6GBWHHWY2GXQBNNW2Y/action/replication_record"}},"created_at":"2026-05-18T02:59:19.366505+00:00","updated_at":"2026-05-18T02:59:19.366505+00:00"}