{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3XMSLVM5SNAVVNYJRWJS5TYOLX","short_pith_number":"pith:3XMSLVM5","schema_version":"1.0","canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","source":{"kind":"arxiv","id":"1108.6280","version":4},"attestation_state":"computed","paper":{"title":"Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Frantisek Kardos, Jan Volec","submitted_at":"2011-08-31T16:08:29Z","abstract_excerpt":"We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an edge-cut of size at least 1.33008n, where n is the number of vertices of G, and has fractional cut covering number at most 1.127752. The lower bound on the size of maximum edge-cut also applies to random cubic graphs. Specifically, a random n-vertex cubic graph a.a.s. contains an edge cut of size 1.33008n."},"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":"1108.6280","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-31T16:08:29Z","cross_cats_sorted":[],"title_canon_sha256":"a83565f11481f060f5f090528e8ac5bf88c519bc3e10252b4d505a02c9b84388","abstract_canon_sha256":"4991520945091d19535ff3ca5f2b42fe7af52811db640a1c8ea52c5b84dab97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:16.486259Z","signature_b64":"rj7rZXG8gUfrHXF3ubElL23NGshru7qO+RNakBPQNuqe64Lfrma6Rh5RLf/WA4SPeyb7eSNsmaG9sfMR9R0zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","last_reissued_at":"2026-05-18T03:29:16.485297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:16.485297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Frantisek Kardos, Jan Volec","submitted_at":"2011-08-31T16:08:29Z","abstract_excerpt":"We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an edge-cut of size at least 1.33008n, where n is the number of vertices of G, and has fractional cut covering number at most 1.127752. The lower bound on the size of maximum edge-cut also applies to random cubic graphs. Specifically, a random n-vertex cubic graph a.a.s. contains an edge cut of size 1.33008n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6280","kind":"arxiv","version":4},"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":"1108.6280","created_at":"2026-05-18T03:29:16.485395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.6280v4","created_at":"2026-05-18T03:29:16.485395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6280","created_at":"2026-05-18T03:29:16.485395+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XMSLVM5SNAV","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XMSLVM5SNAVVNYJ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XMSLVM5","created_at":"2026-05-18T12:26:20.644004+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/3XMSLVM5SNAVVNYJRWJS5TYOLX","json":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX.json","graph_json":"https://pith.science/api/pith-number/3XMSLVM5SNAVVNYJRWJS5TYOLX/graph.json","events_json":"https://pith.science/api/pith-number/3XMSLVM5SNAVVNYJRWJS5TYOLX/events.json","paper":"https://pith.science/paper/3XMSLVM5"},"agent_actions":{"view_html":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX","download_json":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX.json","view_paper":"https://pith.science/paper/3XMSLVM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.6280&json=true","fetch_graph":"https://pith.science/api/pith-number/3XMSLVM5SNAVVNYJRWJS5TYOLX/graph.json","fetch_events":"https://pith.science/api/pith-number/3XMSLVM5SNAVVNYJRWJS5TYOLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/action/storage_attestation","attest_author":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/action/author_attestation","sign_citation":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/action/citation_signature","submit_replication":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/action/replication_record"}},"created_at":"2026-05-18T03:29:16.485395+00:00","updated_at":"2026-05-18T03:29:16.485395+00:00"}