{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3XMSLVM5SNAVVNYJRWJS5TYOLX","short_pith_number":"pith:3XMSLVM5","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"},"canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","source":{"kind":"arxiv","id":"1108.6280","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6280","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6280v4","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6280","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"3XMSLVM5SNAV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3XMSLVM5SNAVVNYJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3XMSLVM5","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3XMSLVM5SNAVVNYJRWJS5TYOLX","target":"record","payload":{"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"},"canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","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"},"source_kind":"arxiv","source_id":"1108.6280","source_version":4,"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-18T03:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gxc7WwsXj4iY0xYphiA85Nc5/dJKdFwH2qJUgM81eaBEmS+7ZKIhId1FmzZ5euCsECAxCNpYzST3/9UcDqt5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:55:08.953060Z"},"content_sha256":"a5936ee9b093369a9e58af9d317ee952b53ab1de4e580a6bf546fbad9ce703e2","schema_version":"1.0","event_id":"sha256:a5936ee9b093369a9e58af9d317ee952b53ab1de4e580a6bf546fbad9ce703e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3XMSLVM5SNAVVNYJRWJS5TYOLX","target":"graph","payload":{"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"},"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-18T03:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nquUHBgyBBJSQvhc52ITvEOT4JWC0CBLmluGXI+MVJl6RD5OCz9Xk7M17ErCDmS855NCnHGNoBCZGpRRYCoyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:55:08.953505Z"},"content_sha256":"b3ba35f856b1c9f3d359af8fcd082b8a001b02852baeb1ae8557e2df71cb6f6e","schema_version":"1.0","event_id":"sha256:b3ba35f856b1c9f3d359af8fcd082b8a001b02852baeb1ae8557e2df71cb6f6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/bundle.json","state_url":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/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-30T04:55:08Z","links":{"resolver":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX","bundle":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/bundle.json","state":"https://pith.science/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XMSLVM5SNAVVNYJRWJS5TYOLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3XMSLVM5SNAVVNYJRWJS5TYOLX","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":"4991520945091d19535ff3ca5f2b42fe7af52811db640a1c8ea52c5b84dab97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-31T16:08:29Z","title_canon_sha256":"a83565f11481f060f5f090528e8ac5bf88c519bc3e10252b4d505a02c9b84388"},"schema_version":"1.0","source":{"id":"1108.6280","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6280","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6280v4","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6280","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"3XMSLVM5SNAV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3XMSLVM5SNAVVNYJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3XMSLVM5","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:b3ba35f856b1c9f3d359af8fcd082b8a001b02852baeb1ae8557e2df71cb6f6e","target":"graph","created_at":"2026-05-18T03:29:16Z","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":"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.","authors_text":"Daniel Kral, Frantisek Kardos, Jan Volec","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-31T16:08:29Z","title":"Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6280","kind":"arxiv","version":4},"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:a5936ee9b093369a9e58af9d317ee952b53ab1de4e580a6bf546fbad9ce703e2","target":"record","created_at":"2026-05-18T03:29:16Z","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":"4991520945091d19535ff3ca5f2b42fe7af52811db640a1c8ea52c5b84dab97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-31T16:08:29Z","title_canon_sha256":"a83565f11481f060f5f090528e8ac5bf88c519bc3e10252b4d505a02c9b84388"},"schema_version":"1.0","source":{"id":"1108.6280","kind":"arxiv","version":4}},"canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddd925d59d93415ab7098d932ecf0e5dd3ca8140d7e1a64e9074067151da9ef0","first_computed_at":"2026-05-18T03:29:16.485297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:16.485297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rj7rZXG8gUfrHXF3ubElL23NGshru7qO+RNakBPQNuqe64Lfrma6Rh5RLf/WA4SPeyb7eSNsmaG9sfMR9R0zCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:16.486259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.6280","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5936ee9b093369a9e58af9d317ee952b53ab1de4e580a6bf546fbad9ce703e2","sha256:b3ba35f856b1c9f3d359af8fcd082b8a001b02852baeb1ae8557e2df71cb6f6e"],"state_sha256":"31740cc665307f18d2248bf183458a073706b9029f9f62b70def755afd2397e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErIFWVfwnWJpWTaZNekg8Kbts4XBACtPVBdnWc1vnOvFJb13XvvPDDjvjfFibpOmHKRboQZlrd7HQ8xcJoxFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:55:08.955554Z","bundle_sha256":"e5eff5a76e0c2a02823a5b37c19e585a08c59567c5b0ed516ffab19414dc21c8"}}