{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YH3P3H4WJ7LAMNR4Z2IL5MAZOB","short_pith_number":"pith:YH3P3H4W","schema_version":"1.0","canonical_sha256":"c1f6fd9f964fd606363cce90beb019705c94559fb4b37089f8d9e55b3eccf94a","source":{"kind":"arxiv","id":"1608.08948","version":1},"attestation_state":"computed","paper":{"title":"Extremal theory of locally sparse multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caroline Terry, Dhruv Mubayi","submitted_at":"2016-08-31T17:12:35Z","abstract_excerpt":"An $(n,s,q)$-graph is an $n$-vertex multigraph where every set of $s$ vertices spans at most $q$ edges. In this paper, we determine the maximum product of the edge multiplicities in $(n,s,q)$-graphs if the congruence class of $q$ modulo ${s\\choose 2}$ is in a certain interval of length about $3s/2$. The smallest case that falls outside this range is $(s,q)=(4,15)$, and here the answer is $a^{n^2+o(n^2)}$ where $a$ is transcendental assuming Schanuel's conjecture. This could indicate the difficulty of solving the problem in full generality. Many of our results can be seen as extending work by B"},"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":"1608.08948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-31T17:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"07c350a33df514435c0c6e14fbbdbb7f85335f69b3a7815a2552e1627bbdfed0","abstract_canon_sha256":"b825b5ec3eabea84ea57e141d542d537567bafd156767c5340f1a8f7cf4bd1a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:39.596894Z","signature_b64":"XsYzoqLaXbf41ywy07bW0FNpfySMYVB+TS26i6eV+NK7Vk3IXBilIF9PstDW/yde2v698AbelRi4O5NovwNgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1f6fd9f964fd606363cce90beb019705c94559fb4b37089f8d9e55b3eccf94a","last_reissued_at":"2026-05-18T01:06:39.596345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:39.596345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal theory of locally sparse multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caroline Terry, Dhruv Mubayi","submitted_at":"2016-08-31T17:12:35Z","abstract_excerpt":"An $(n,s,q)$-graph is an $n$-vertex multigraph where every set of $s$ vertices spans at most $q$ edges. In this paper, we determine the maximum product of the edge multiplicities in $(n,s,q)$-graphs if the congruence class of $q$ modulo ${s\\choose 2}$ is in a certain interval of length about $3s/2$. The smallest case that falls outside this range is $(s,q)=(4,15)$, and here the answer is $a^{n^2+o(n^2)}$ where $a$ is transcendental assuming Schanuel's conjecture. This could indicate the difficulty of solving the problem in full generality. Many of our results can be seen as extending work by B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08948","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":"1608.08948","created_at":"2026-05-18T01:06:39.596450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08948v1","created_at":"2026-05-18T01:06:39.596450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08948","created_at":"2026-05-18T01:06:39.596450+00:00"},{"alias_kind":"pith_short_12","alias_value":"YH3P3H4WJ7LA","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YH3P3H4WJ7LAMNR4","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YH3P3H4W","created_at":"2026-05-18T12:30:53.716459+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/YH3P3H4WJ7LAMNR4Z2IL5MAZOB","json":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB.json","graph_json":"https://pith.science/api/pith-number/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/graph.json","events_json":"https://pith.science/api/pith-number/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/events.json","paper":"https://pith.science/paper/YH3P3H4W"},"agent_actions":{"view_html":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB","download_json":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB.json","view_paper":"https://pith.science/paper/YH3P3H4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08948&json=true","fetch_graph":"https://pith.science/api/pith-number/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/graph.json","fetch_events":"https://pith.science/api/pith-number/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/action/storage_attestation","attest_author":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/action/author_attestation","sign_citation":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/action/citation_signature","submit_replication":"https://pith.science/pith/YH3P3H4WJ7LAMNR4Z2IL5MAZOB/action/replication_record"}},"created_at":"2026-05-18T01:06:39.596450+00:00","updated_at":"2026-05-18T01:06:39.596450+00:00"}