{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ULAXILEY3TAD5T75FPCIGTL26I","short_pith_number":"pith:ULAXILEY","schema_version":"1.0","canonical_sha256":"a2c1742c98dcc03ecffd2bc4834d7af23cbbf1e656b4257e230cc1e71d7e8942","source":{"kind":"arxiv","id":"2403.12016","version":1},"attestation_state":"computed","paper":{"title":"Ordered and colored subgraph density problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Emily Cairncross","submitted_at":"2024-03-18T17:52:07Z","abstract_excerpt":"We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \\in [0, 1]$ is asymptotically maximized by a clique and isolated vertices or its complement. Next, among ordered $n$-vertex graphs with $m$ edges, we determine the maximum and minimum number of copies of a $k$-edge star whose nonleaf vertex is minimum among all vertices of the star. Finally, for $s \\ge 2$, we define a particular $3$-edge-colored complete graph $"},"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":"2403.12016","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-18T17:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"eb2118b604c6447fa3837e2311776f0338816787d28abe424b2607752d336a3d","abstract_canon_sha256":"3c0bc26abc0892ae40ba1e670dd52875d08865072b8c65e0791728abc8a86151"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:35.197842Z","signature_b64":"IyEX3qfJl1N3DDeJn4R5JKSROYPSJ/jA6MPRb0/XJpX0FG6xmKl3bIMfhKveH91kfNre9jUvCFpQUcZHnqjSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c1742c98dcc03ecffd2bc4834d7af23cbbf1e656b4257e230cc1e71d7e8942","last_reissued_at":"2026-07-05T07:57:35.197347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:35.197347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered and colored subgraph density problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Emily Cairncross","submitted_at":"2024-03-18T17:52:07Z","abstract_excerpt":"We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \\in [0, 1]$ is asymptotically maximized by a clique and isolated vertices or its complement. Next, among ordered $n$-vertex graphs with $m$ edges, we determine the maximum and minimum number of copies of a $k$-edge star whose nonleaf vertex is minimum among all vertices of the star. Finally, for $s \\ge 2$, we define a particular $3$-edge-colored complete graph $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12016","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.12016/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.12016","created_at":"2026-07-05T07:57:35.197405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12016v1","created_at":"2026-07-05T07:57:35.197405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12016","created_at":"2026-07-05T07:57:35.197405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULAXILEY3TAD","created_at":"2026-07-05T07:57:35.197405+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULAXILEY3TAD5T75","created_at":"2026-07-05T07:57:35.197405+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULAXILEY","created_at":"2026-07-05T07:57:35.197405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09842","citing_title":"The semi-inducibility problem","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I","json":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I.json","graph_json":"https://pith.science/api/pith-number/ULAXILEY3TAD5T75FPCIGTL26I/graph.json","events_json":"https://pith.science/api/pith-number/ULAXILEY3TAD5T75FPCIGTL26I/events.json","paper":"https://pith.science/paper/ULAXILEY"},"agent_actions":{"view_html":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I","download_json":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I.json","view_paper":"https://pith.science/paper/ULAXILEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12016&json=true","fetch_graph":"https://pith.science/api/pith-number/ULAXILEY3TAD5T75FPCIGTL26I/graph.json","fetch_events":"https://pith.science/api/pith-number/ULAXILEY3TAD5T75FPCIGTL26I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I/action/storage_attestation","attest_author":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I/action/author_attestation","sign_citation":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I/action/citation_signature","submit_replication":"https://pith.science/pith/ULAXILEY3TAD5T75FPCIGTL26I/action/replication_record"}},"created_at":"2026-07-05T07:57:35.197405+00:00","updated_at":"2026-07-05T07:57:35.197405+00:00"}