{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FU7YBFX52XBNY43MGKD74WH5TS","short_pith_number":"pith:FU7YBFX5","schema_version":"1.0","canonical_sha256":"2d3f8096fdd5c2dc736c3287fe58fd9ca23d7df774101274202e19aa8f6b7a75","source":{"kind":"arxiv","id":"1708.01822","version":3},"attestation_state":"computed","paper":{"title":"Maximum star densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Stephan Wagner","submitted_at":"2017-08-05T22:10:48Z","abstract_excerpt":"Given an integer $k \\geq 2$ and a real number $\\gamma\\in [0, 1]$, which graphs of edge density $\\gamma$ contain the largest number of $k$-edge stars? For $k=2$ Ahlswede and Katona proved that asymptotically there cannot be more such stars than in a clique or in the complement of a clique (depending on the value of $\\gamma$). Here we extend their result to all integers $k\\ge 2$."},"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":"1708.01822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T22:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"087a2fc9e4b9ecac184e1ae2df57199370eb7a368127227a1a0edd67c10e2d85","abstract_canon_sha256":"8f28496e9da5846f91cdfe3fae73cd85b717bdab1fabb5bd84afdde5843acac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:06.716227Z","signature_b64":"/AwOqf2CAOkCOIl+DRaZgeeKJ4/cBAq5eU4k2xukYVD+/oJh8zymX68v/fiBljr4leWH9Q54tdpXCFXJ2KwFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d3f8096fdd5c2dc736c3287fe58fd9ca23d7df774101274202e19aa8f6b7a75","last_reissued_at":"2026-05-18T00:14:06.715708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:06.715708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum star densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Stephan Wagner","submitted_at":"2017-08-05T22:10:48Z","abstract_excerpt":"Given an integer $k \\geq 2$ and a real number $\\gamma\\in [0, 1]$, which graphs of edge density $\\gamma$ contain the largest number of $k$-edge stars? For $k=2$ Ahlswede and Katona proved that asymptotically there cannot be more such stars than in a clique or in the complement of a clique (depending on the value of $\\gamma$). Here we extend their result to all integers $k\\ge 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01822","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":""},"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":"1708.01822","created_at":"2026-05-18T00:14:06.715791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01822v3","created_at":"2026-05-18T00:14:06.715791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01822","created_at":"2026-05-18T00:14:06.715791+00:00"},{"alias_kind":"pith_short_12","alias_value":"FU7YBFX52XBN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FU7YBFX52XBNY43M","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FU7YBFX5","created_at":"2026-05-18T12:31:15.632608+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/FU7YBFX52XBNY43MGKD74WH5TS","json":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS.json","graph_json":"https://pith.science/api/pith-number/FU7YBFX52XBNY43MGKD74WH5TS/graph.json","events_json":"https://pith.science/api/pith-number/FU7YBFX52XBNY43MGKD74WH5TS/events.json","paper":"https://pith.science/paper/FU7YBFX5"},"agent_actions":{"view_html":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS","download_json":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS.json","view_paper":"https://pith.science/paper/FU7YBFX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01822&json=true","fetch_graph":"https://pith.science/api/pith-number/FU7YBFX52XBNY43MGKD74WH5TS/graph.json","fetch_events":"https://pith.science/api/pith-number/FU7YBFX52XBNY43MGKD74WH5TS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS/action/storage_attestation","attest_author":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS/action/author_attestation","sign_citation":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS/action/citation_signature","submit_replication":"https://pith.science/pith/FU7YBFX52XBNY43MGKD74WH5TS/action/replication_record"}},"created_at":"2026-05-18T00:14:06.715791+00:00","updated_at":"2026-05-18T00:14:06.715791+00:00"}