{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2T5OCLVOF576XPISKINBXJ47C6","short_pith_number":"pith:2T5OCLVO","canonical_record":{"source":{"id":"2112.13119","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"be939127e970edbb1890e8abc69cd8ae1233d6c5e39ca8d5d228ff0c1a49c532","abstract_canon_sha256":"5cd1dde37894c94057d2e165d09dc80ff28cfa68d0f990767d580533566e225f"},"schema_version":"1.0"},"canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","source":{"kind":"arxiv","id":"2112.13119","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13119","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13119v3","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13119","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"2T5OCLVOF576","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_16","alias_value":"2T5OCLVOF576XPIS","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_8","alias_value":"2T5OCLVO","created_at":"2026-07-05T11:18:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2T5OCLVOF576XPISKINBXJ47C6","target":"record","payload":{"canonical_record":{"source":{"id":"2112.13119","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"be939127e970edbb1890e8abc69cd8ae1233d6c5e39ca8d5d228ff0c1a49c532","abstract_canon_sha256":"5cd1dde37894c94057d2e165d09dc80ff28cfa68d0f990767d580533566e225f"},"schema_version":"1.0"},"canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:56.198032Z","signature_b64":"naBh33WvY3rDgQ4cpD3kwQuV41TFD8ngt9QWMJPaImNL/LCS+H6GmXdW8v2TC2HFHtON4v7adflYQG5gTZwaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","last_reissued_at":"2026-07-05T11:18:56.197347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:56.197347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.13119","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-05T11:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DuJD+1Sxs10zysoirThDJMrM1yibKwLoD4+3beBkCmT3cXXmto7T24sjNEDNvw5skurXypamcKrZ1fL4ESIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:13:33.265595Z"},"content_sha256":"5a9fa8f11ee97b2596c59605982caa6f6b64dbc5ffac16af622ca626521c0f18","schema_version":"1.0","event_id":"sha256:5a9fa8f11ee97b2596c59605982caa6f6b64dbc5ffac16af622ca626521c0f18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2T5OCLVOF576XPISKINBXJ47C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an Number of Subdivisions of Multipartite Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danni Peng, Xiao-Chuan Liu, Xu Yang","submitted_at":"2021-12-24T18:30:21Z","abstract_excerpt":"In this paper, we investigate the Tur\\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\\'an number of the 1-subdivision of $K_{s,t}^+$, where $K_{s,t}^+$ is obtained by adding a single edge within the part of size $s$ of the complete bipartite graph $K_{s,t}$, with $4\\leq s \\leq t$. In addition, we derive an upper bound for the extremal number of a family of graphs formed by (possibly degenerate) 1-subdivisions of certain tripartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13119","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/2112.13119/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-05T11:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOfgzgsCQGqliwTnl4LRgBzyJHhzFchfbVOWKdK6lWLWK1zZJvuQt4RDwaI/n+2cXbNvAwelog0JC7WXTkvhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:13:33.266090Z"},"content_sha256":"bb599122ed00563dc6c8af1dddcd1c457af114bf031cbcc29ed94c0c8758c92b","schema_version":"1.0","event_id":"sha256:bb599122ed00563dc6c8af1dddcd1c457af114bf031cbcc29ed94c0c8758c92b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/bundle.json","state_url":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T5OCLVOF576XPISKINBXJ47C6/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-05T07:13:33Z","links":{"resolver":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6","bundle":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/bundle.json","state":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T5OCLVOF576XPISKINBXJ47C6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2T5OCLVOF576XPISKINBXJ47C6","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":"5cd1dde37894c94057d2e165d09dc80ff28cfa68d0f990767d580533566e225f","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","title_canon_sha256":"be939127e970edbb1890e8abc69cd8ae1233d6c5e39ca8d5d228ff0c1a49c532"},"schema_version":"1.0","source":{"id":"2112.13119","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13119","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13119v3","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13119","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"2T5OCLVOF576","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_16","alias_value":"2T5OCLVOF576XPIS","created_at":"2026-07-05T11:18:56Z"},{"alias_kind":"pith_short_8","alias_value":"2T5OCLVO","created_at":"2026-07-05T11:18:56Z"}],"graph_snapshots":[{"event_id":"sha256:bb599122ed00563dc6c8af1dddcd1c457af114bf031cbcc29ed94c0c8758c92b","target":"graph","created_at":"2026-07-05T11:18:56Z","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/2112.13119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate the Tur\\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\\'an number of the 1-subdivision of $K_{s,t}^+$, where $K_{s,t}^+$ is obtained by adding a single edge within the part of size $s$ of the complete bipartite graph $K_{s,t}$, with $4\\leq s \\leq t$. In addition, we derive an upper bound for the extremal number of a family of graphs formed by (possibly degenerate) 1-subdivisions of certain tripartite graphs.","authors_text":"Danni Peng, Xiao-Chuan Liu, Xu Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","title":"Tur\\'an Number of Subdivisions of Multipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13119","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:5a9fa8f11ee97b2596c59605982caa6f6b64dbc5ffac16af622ca626521c0f18","target":"record","created_at":"2026-07-05T11:18:56Z","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":"5cd1dde37894c94057d2e165d09dc80ff28cfa68d0f990767d580533566e225f","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","title_canon_sha256":"be939127e970edbb1890e8abc69cd8ae1233d6c5e39ca8d5d228ff0c1a49c532"},"schema_version":"1.0","source":{"id":"2112.13119","kind":"arxiv","version":3}},"canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","first_computed_at":"2026-07-05T11:18:56.197347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:56.197347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naBh33WvY3rDgQ4cpD3kwQuV41TFD8ngt9QWMJPaImNL/LCS+H6GmXdW8v2TC2HFHtON4v7adflYQG5gTZwaDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:56.198032Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.13119","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a9fa8f11ee97b2596c59605982caa6f6b64dbc5ffac16af622ca626521c0f18","sha256:bb599122ed00563dc6c8af1dddcd1c457af114bf031cbcc29ed94c0c8758c92b"],"state_sha256":"860aedb4091585ccd3b7ebf5d25dbd752f79e0cf7e389bd88a28f5f920e7ab84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SsqXsnJPPoK30iYJBmKW+4V++Bl1EhiiqAOSCjRntWZjHVWTKe2Al8XkKrU/Tkl6oByu7+hmqJ3BUNap35BAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:13:33.269273Z","bundle_sha256":"612d08859b277ef4d41c7b861802cd46a834daaf140edf2248acbdb3f5142c25"}}