{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q36OCKS3U5LD5N6IKE4KFJYQNX","short_pith_number":"pith:Q36OCKS3","canonical_record":{"source":{"id":"1905.02856","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T01:04:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7b86bd04f7db326e2ebd76599cc358f2d6cf602c5ecc048c5ad039398052b39e","abstract_canon_sha256":"dfb848522f3f50dbae914d04428664dbfcff04d1ac3eed0fbca61b7e606ee510"},"schema_version":"1.0"},"canonical_sha256":"86fce12a5ba7563eb7c85138a2a7106df585a98bb88f994d998163bd556dc56f","source":{"kind":"arxiv","id":"1905.02856","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02856","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02856v3","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02856","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"Q36OCKS3U5LD","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"Q36OCKS3U5LD5N6I","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"Q36OCKS3","created_at":"2026-07-05T00:58:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q36OCKS3U5LD5N6IKE4KFJYQNX","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02856","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T01:04:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7b86bd04f7db326e2ebd76599cc358f2d6cf602c5ecc048c5ad039398052b39e","abstract_canon_sha256":"dfb848522f3f50dbae914d04428664dbfcff04d1ac3eed0fbca61b7e606ee510"},"schema_version":"1.0"},"canonical_sha256":"86fce12a5ba7563eb7c85138a2a7106df585a98bb88f994d998163bd556dc56f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:02.880772Z","signature_b64":"g/dy1o5xf7D2x7XMgbUyzS3HS+Rlbt1FIcPQ7o6Qf3VMasX7G80K16XWTpEVEBg1lNQikrHyLBE8tFx+Ui5bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86fce12a5ba7563eb7c85138a2a7106df585a98bb88f994d998163bd556dc56f","last_reissued_at":"2026-07-05T00:58:02.880275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:02.880275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02856","source_version":3,"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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgIlXzhqnPGejepkMkpwWN3Yzbs2yLyFMC6AgK2v/+8l+aLEK1vv5tj3J3MATx/M5ienQ53zWH9tep/kfZUPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:50:35.004908Z"},"content_sha256":"d4c3d31de03255251591b9af87c65d978abab517f65b58a18db53692317919f0","schema_version":"1.0","event_id":"sha256:d4c3d31de03255251591b9af87c65d978abab517f65b58a18db53692317919f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q36OCKS3U5LD5N6IKE4KFJYQNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Cut in Degenerate $H$-Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Nitya Mani, Ray Li","submitted_at":"2019-05-08T01:04:42Z","abstract_excerpt":"We obtain several lower bounds on the $\\textsf{Max-Cut}$ of $d$-degenerate $H$-free graphs. Let $f(m,d,H)$ denote the smallest $\\textsf{Max-Cut}$ of an $H$-free $d$-degenerate graph on $m$ edges. We show that $f(m,d,K_r)\\ge \\left(\\frac{1}{2} + d^{-1+\\Omega(r^{-1})}\\right)m$, generalizing a recent work of Carlson, Kolla, and Trevisan. We also give bounds on $f(m,d,H)$ when $H$ is a cycle, odd wheel, or a complete bipartite graph with at most 4 vertices on one side. We also show stronger bounds on $f(m,d,K_r)$ assuming a conjecture of Alon, Bollabas, Krivelevich, and Sudakov (2003). We conjectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02856","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.02856/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIimviihvuBRNH4QStRlnAa+0vdZj1VKlPnVvv/ZORCuPhTcWlq+DiR23UXJ112ZHgUhUIEQ0pAb6VXLDSGLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:50:35.005432Z"},"content_sha256":"ffce60a5e2d01d1c57c1cc435b72d6c779d22551986b69b9d71363c264551d8e","schema_version":"1.0","event_id":"sha256:ffce60a5e2d01d1c57c1cc435b72d6c779d22551986b69b9d71363c264551d8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/bundle.json","state_url":"https://pith.science/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/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-08-05T13:50:35Z","links":{"resolver":"https://pith.science/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX","bundle":"https://pith.science/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/bundle.json","state":"https://pith.science/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q36OCKS3U5LD5N6IKE4KFJYQNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q36OCKS3U5LD5N6IKE4KFJYQNX","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":"dfb848522f3f50dbae914d04428664dbfcff04d1ac3eed0fbca61b7e606ee510","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T01:04:42Z","title_canon_sha256":"7b86bd04f7db326e2ebd76599cc358f2d6cf602c5ecc048c5ad039398052b39e"},"schema_version":"1.0","source":{"id":"1905.02856","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02856","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02856v3","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02856","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"Q36OCKS3U5LD","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"Q36OCKS3U5LD5N6I","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"Q36OCKS3","created_at":"2026-07-05T00:58:02Z"}],"graph_snapshots":[{"event_id":"sha256:ffce60a5e2d01d1c57c1cc435b72d6c779d22551986b69b9d71363c264551d8e","target":"graph","created_at":"2026-07-05T00:58:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.02856/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We obtain several lower bounds on the $\\textsf{Max-Cut}$ of $d$-degenerate $H$-free graphs. Let $f(m,d,H)$ denote the smallest $\\textsf{Max-Cut}$ of an $H$-free $d$-degenerate graph on $m$ edges. We show that $f(m,d,K_r)\\ge \\left(\\frac{1}{2} + d^{-1+\\Omega(r^{-1})}\\right)m$, generalizing a recent work of Carlson, Kolla, and Trevisan. We also give bounds on $f(m,d,H)$ when $H$ is a cycle, odd wheel, or a complete bipartite graph with at most 4 vertices on one side. We also show stronger bounds on $f(m,d,K_r)$ assuming a conjecture of Alon, Bollabas, Krivelevich, and Sudakov (2003). We conjectur","authors_text":"Nitya Mani, Ray Li","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T01:04:42Z","title":"Max-Cut in Degenerate $H$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02856","kind":"arxiv","version":3},"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:d4c3d31de03255251591b9af87c65d978abab517f65b58a18db53692317919f0","target":"record","created_at":"2026-07-05T00:58:02Z","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":"dfb848522f3f50dbae914d04428664dbfcff04d1ac3eed0fbca61b7e606ee510","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T01:04:42Z","title_canon_sha256":"7b86bd04f7db326e2ebd76599cc358f2d6cf602c5ecc048c5ad039398052b39e"},"schema_version":"1.0","source":{"id":"1905.02856","kind":"arxiv","version":3}},"canonical_sha256":"86fce12a5ba7563eb7c85138a2a7106df585a98bb88f994d998163bd556dc56f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86fce12a5ba7563eb7c85138a2a7106df585a98bb88f994d998163bd556dc56f","first_computed_at":"2026-07-05T00:58:02.880275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:02.880275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/dy1o5xf7D2x7XMgbUyzS3HS+Rlbt1FIcPQ7o6Qf3VMasX7G80K16XWTpEVEBg1lNQikrHyLBE8tFx+Ui5bDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:02.880772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02856","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4c3d31de03255251591b9af87c65d978abab517f65b58a18db53692317919f0","sha256:ffce60a5e2d01d1c57c1cc435b72d6c779d22551986b69b9d71363c264551d8e"],"state_sha256":"12dec06fb392448325a27bef9edf788b335fd9d61ce366a8e892452088cfdc40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pp/MLRdVlfGyq3ocGGSztFVOcVq4w5t5CCZyAvfJOjhvXvyExKT35ApGZSHsDf5eK0ruLAEp/h0aj+amX3vHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:50:35.009251Z","bundle_sha256":"5c2869b352f2109e91f02fe44b92c230e1d07d01a23eaa43615835c47ddd23b3"}}