{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XURB2DM3NW2LXUI23AI7NTAYY7","short_pith_number":"pith:XURB2DM3","canonical_record":{"source":{"id":"1612.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-01T11:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"a121f5c7812e1347e9ee85e45fef85309ee6b5500f00f1f3ae19e2e98825b84b","abstract_canon_sha256":"a937a1b3d9402b286701d74457f012db990d08c344a2c23bbc8e320867177a52"},"schema_version":"1.0"},"canonical_sha256":"bd221d0d9b6db4bbd11ad811f6cc18c7ecba7b48ea5109eece871bf1a4f190ce","source":{"kind":"arxiv","id":"1612.00206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00206","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00206v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00206","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"XURB2DM3NW2L","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XURB2DM3NW2LXUI2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XURB2DM3","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XURB2DM3NW2LXUI23AI7NTAYY7","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-01T11:40:36Z","cross_cats_sorted":[],"title_canon_sha256":"a121f5c7812e1347e9ee85e45fef85309ee6b5500f00f1f3ae19e2e98825b84b","abstract_canon_sha256":"a937a1b3d9402b286701d74457f012db990d08c344a2c23bbc8e320867177a52"},"schema_version":"1.0"},"canonical_sha256":"bd221d0d9b6db4bbd11ad811f6cc18c7ecba7b48ea5109eece871bf1a4f190ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.768854Z","signature_b64":"BmlPo0dZfReAEndd6zjQH+yeWeZHIYldiGma/nHtTzCTSlx/rMu8ScvrphZRtri3IGvMYydK4tkvZIDpBoQfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd221d0d9b6db4bbd11ad811f6cc18c7ecba7b48ea5109eece871bf1a4f190ce","last_reissued_at":"2026-05-18T00:56:05.768275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.768275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00206","source_version":1,"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-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4X6AHlsJXYJo7tGsEg2JrMzgu28d4dPbtKzHYRSVqvvDmubyrh0WJbA2hBVCnGqC9CWmYIZkxcGG3krTrvqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:16:55.401047Z"},"content_sha256":"c652647232b689bb2fe18c1eed3388e0fdab560f75bc966ee4df14b8efe69ee8","schema_version":"1.0","event_id":"sha256:c652647232b689bb2fe18c1eed3388e0fdab560f75bc966ee4df14b8efe69ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XURB2DM3NW2LXUI23AI7NTAYY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local conditions for exponentially many subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Katherine Staden, Maryam Sharifzadeh","submitted_at":"2016-12-01T11:40:36Z","abstract_excerpt":"Given a graph $F$, let $s_t(F)$ be the number of subdivisions of $F$, each with a different vertex set, which one can guarantee in a graph $G$ in which every edge lies in at least $t$ copies of $F$. In 1990, Tuza asked for which graphs $F$ and large $t$, one has that $s_t(F)$ is exponential in a power of $t$. We show that, somewhat surprisingly, the only such $F$ are complete graphs, and for every $F$ which is not complete, $s_t(F)$ is polynomial in $t$. Further, for a natural strengthening of the local condition above, we also characterise those $F$ for which $s_t(F)$ is exponential in a powe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00206","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"},"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-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KvlGyBmCGYaM9gjWWSWX4FZjABhXl8aN1kI9Rt0aPyT2ipAqTiOKBG4RBRE+ctqpY6MYu488LgIjGiPEGoZuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:16:55.401740Z"},"content_sha256":"577ebe191ea54780eca2ce0ed190dfa3c88c76ae29def9e4cac097b847183a45","schema_version":"1.0","event_id":"sha256:577ebe191ea54780eca2ce0ed190dfa3c88c76ae29def9e4cac097b847183a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XURB2DM3NW2LXUI23AI7NTAYY7/bundle.json","state_url":"https://pith.science/pith/XURB2DM3NW2LXUI23AI7NTAYY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XURB2DM3NW2LXUI23AI7NTAYY7/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-28T18:16:55Z","links":{"resolver":"https://pith.science/pith/XURB2DM3NW2LXUI23AI7NTAYY7","bundle":"https://pith.science/pith/XURB2DM3NW2LXUI23AI7NTAYY7/bundle.json","state":"https://pith.science/pith/XURB2DM3NW2LXUI23AI7NTAYY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XURB2DM3NW2LXUI23AI7NTAYY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XURB2DM3NW2LXUI23AI7NTAYY7","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":"a937a1b3d9402b286701d74457f012db990d08c344a2c23bbc8e320867177a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-01T11:40:36Z","title_canon_sha256":"a121f5c7812e1347e9ee85e45fef85309ee6b5500f00f1f3ae19e2e98825b84b"},"schema_version":"1.0","source":{"id":"1612.00206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00206","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00206v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00206","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"XURB2DM3NW2L","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XURB2DM3NW2LXUI2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XURB2DM3","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:577ebe191ea54780eca2ce0ed190dfa3c88c76ae29def9e4cac097b847183a45","target":"graph","created_at":"2026-05-18T00:56:05Z","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":"Given a graph $F$, let $s_t(F)$ be the number of subdivisions of $F$, each with a different vertex set, which one can guarantee in a graph $G$ in which every edge lies in at least $t$ copies of $F$. In 1990, Tuza asked for which graphs $F$ and large $t$, one has that $s_t(F)$ is exponential in a power of $t$. We show that, somewhat surprisingly, the only such $F$ are complete graphs, and for every $F$ which is not complete, $s_t(F)$ is polynomial in $t$. Further, for a natural strengthening of the local condition above, we also characterise those $F$ for which $s_t(F)$ is exponential in a powe","authors_text":"Hong Liu, Katherine Staden, Maryam Sharifzadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-01T11:40:36Z","title":"Local conditions for exponentially many subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00206","kind":"arxiv","version":1},"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:c652647232b689bb2fe18c1eed3388e0fdab560f75bc966ee4df14b8efe69ee8","target":"record","created_at":"2026-05-18T00:56:05Z","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":"a937a1b3d9402b286701d74457f012db990d08c344a2c23bbc8e320867177a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-01T11:40:36Z","title_canon_sha256":"a121f5c7812e1347e9ee85e45fef85309ee6b5500f00f1f3ae19e2e98825b84b"},"schema_version":"1.0","source":{"id":"1612.00206","kind":"arxiv","version":1}},"canonical_sha256":"bd221d0d9b6db4bbd11ad811f6cc18c7ecba7b48ea5109eece871bf1a4f190ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd221d0d9b6db4bbd11ad811f6cc18c7ecba7b48ea5109eece871bf1a4f190ce","first_computed_at":"2026-05-18T00:56:05.768275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:05.768275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BmlPo0dZfReAEndd6zjQH+yeWeZHIYldiGma/nHtTzCTSlx/rMu8ScvrphZRtri3IGvMYydK4tkvZIDpBoQfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:05.768854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c652647232b689bb2fe18c1eed3388e0fdab560f75bc966ee4df14b8efe69ee8","sha256:577ebe191ea54780eca2ce0ed190dfa3c88c76ae29def9e4cac097b847183a45"],"state_sha256":"053ac582bebe226e4ce55838c995836b3bda5d26fe7c4bc98a3b71ad983fcdb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gryyshu8mOBV2WrXErc4Lb7885qMU8lHEJlG+M2ML6AIMHBXTPI1hMLrAFy6K7UbglfsjzL8kBMvcYqzIrajAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:16:55.405192Z","bundle_sha256":"3eb2715a08b77e6bf2b54de0efb51985c79bf1d518c1644ff7585540f83976e5"}}