{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GMEWGMXQUH65GL5IIOU5JBI7NJ","short_pith_number":"pith:GMEWGMXQ","schema_version":"1.0","canonical_sha256":"33096332f0a1fdd32fa843a9d4851f6a5aee7ed35b4f15df57989bb4c43a3fc0","source":{"kind":"arxiv","id":"1506.02445","version":1},"attestation_state":"computed","paper":{"title":"Partite Saturation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts","submitted_at":"2015-06-08T11:31:45Z","abstract_excerpt":"We look at several saturation problems in complete balanced blow-ups of graphs. We let $H[n]$ denote the blow-up of $H$ onto parts of size $n$ and refer to a copy of $H$ in $H[n]$ as 'partite' if it has one vertex in each part of $H[n]$. We then ask how few edges a subgraph $G$ of $H[n]$ can have such that $G$ has no partite copy of $H$ but such that the addition of any new edge from $H[n]$ creates a partite $H$. When $H$ is a triangle this value was determined by Ferrara, Jacobson, Pfender, and Wenger. Our main result is to calculate this value for $H=K_4$ when $n$ is large. We also give exac"},"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":"1506.02445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-08T11:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"357e4471fca03ca53937e53ccd160ccd427717ada6d17908293d912047798cab","abstract_canon_sha256":"24b64de0912902f7c70290e0b9eeb45e1d9222243e778e2c37f67e0fea6f8897"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:51.077343Z","signature_b64":"QVi3VZ/Nz1t4Nsg8Vki5R1++SZw6fra+dYY6XJxlG3LxhFwLLscB2R/Wdr/4Et5rGCmV7piOUVSiOnAi3TcFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33096332f0a1fdd32fa843a9d4851f6a5aee7ed35b4f15df57989bb4c43a3fc0","last_reissued_at":"2026-05-18T01:55:51.076587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:51.076587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partite Saturation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barnaby Roberts","submitted_at":"2015-06-08T11:31:45Z","abstract_excerpt":"We look at several saturation problems in complete balanced blow-ups of graphs. We let $H[n]$ denote the blow-up of $H$ onto parts of size $n$ and refer to a copy of $H$ in $H[n]$ as 'partite' if it has one vertex in each part of $H[n]$. We then ask how few edges a subgraph $G$ of $H[n]$ can have such that $G$ has no partite copy of $H$ but such that the addition of any new edge from $H[n]$ creates a partite $H$. When $H$ is a triangle this value was determined by Ferrara, Jacobson, Pfender, and Wenger. Our main result is to calculate this value for $H=K_4$ when $n$ is large. We also give exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02445","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":"1506.02445","created_at":"2026-05-18T01:55:51.076721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02445v1","created_at":"2026-05-18T01:55:51.076721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02445","created_at":"2026-05-18T01:55:51.076721+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMEWGMXQUH65","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMEWGMXQUH65GL5I","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMEWGMXQ","created_at":"2026-05-18T12:29:22.688609+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/GMEWGMXQUH65GL5IIOU5JBI7NJ","json":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ.json","graph_json":"https://pith.science/api/pith-number/GMEWGMXQUH65GL5IIOU5JBI7NJ/graph.json","events_json":"https://pith.science/api/pith-number/GMEWGMXQUH65GL5IIOU5JBI7NJ/events.json","paper":"https://pith.science/paper/GMEWGMXQ"},"agent_actions":{"view_html":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ","download_json":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ.json","view_paper":"https://pith.science/paper/GMEWGMXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02445&json=true","fetch_graph":"https://pith.science/api/pith-number/GMEWGMXQUH65GL5IIOU5JBI7NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GMEWGMXQUH65GL5IIOU5JBI7NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ/action/storage_attestation","attest_author":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ/action/author_attestation","sign_citation":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ/action/citation_signature","submit_replication":"https://pith.science/pith/GMEWGMXQUH65GL5IIOU5JBI7NJ/action/replication_record"}},"created_at":"2026-05-18T01:55:51.076721+00:00","updated_at":"2026-05-18T01:55:51.076721+00:00"}