{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CYQGG5PW2HTU4BG5R656DFCRDI","short_pith_number":"pith:CYQGG5PW","schema_version":"1.0","canonical_sha256":"16206375f6d1e74e04dd8fbbe194511a13afe4828eb097c48fada15ac98dc165","source":{"kind":"arxiv","id":"2603.06930","version":3},"attestation_state":"computed","paper":{"title":"Explicit Formulas and Unimodality Phenomena for General Position Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bilal Ahmad Rather","submitted_at":"2026-03-06T23:03:04Z","abstract_excerpt":"The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\\psi(G)$, asks for all such possible sets. In this paper, We describe general position sets for several classes of graphs and provide explicit formulas for the general position polynomials of complete multipartite graphs. We specialize to balanced complete multipartite graphs and show that for part size $r\\le 4$, the polynomial $\\psi(K_{r,\\dots,r})$ is log-concave and unimodal for all numbers of parts, while for"},"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":"2603.06930","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-06T23:03:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9b37576059420d06f980290cf5e3e28e59e2cee85cdbdc63468539ebe0c5677f","abstract_canon_sha256":"7de8b543aa186dc2d9111563652849e40aa289a004606b9f3c1e9d0a92a88e96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T00:15:25.275750Z","signature_b64":"18TKrYyhI/kGs+KTDQipooxgAI001yi7xQ02RqlQho1Gp2KTNzO+wr/qFsqhP++6EyDPVES3QZ4filDS0YUSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16206375f6d1e74e04dd8fbbe194511a13afe4828eb097c48fada15ac98dc165","last_reissued_at":"2026-06-26T00:15:25.275202Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T00:15:25.275202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Formulas and Unimodality Phenomena for General Position Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bilal Ahmad Rather","submitted_at":"2026-03-06T23:03:04Z","abstract_excerpt":"The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\\psi(G)$, asks for all such possible sets. In this paper, We describe general position sets for several classes of graphs and provide explicit formulas for the general position polynomials of complete multipartite graphs. We specialize to balanced complete multipartite graphs and show that for part size $r\\le 4$, the polynomial $\\psi(K_{r,\\dots,r})$ is log-concave and unimodal for all numbers of parts, while for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.06930","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.06930/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":"2603.06930","created_at":"2026-06-26T00:15:25.275259+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.06930v3","created_at":"2026-06-26T00:15:25.275259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.06930","created_at":"2026-06-26T00:15:25.275259+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYQGG5PW2HTU","created_at":"2026-06-26T00:15:25.275259+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYQGG5PW2HTU4BG5","created_at":"2026-06-26T00:15:25.275259+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYQGG5PW","created_at":"2026-06-26T00:15:25.275259+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/CYQGG5PW2HTU4BG5R656DFCRDI","json":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI.json","graph_json":"https://pith.science/api/pith-number/CYQGG5PW2HTU4BG5R656DFCRDI/graph.json","events_json":"https://pith.science/api/pith-number/CYQGG5PW2HTU4BG5R656DFCRDI/events.json","paper":"https://pith.science/paper/CYQGG5PW"},"agent_actions":{"view_html":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI","download_json":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI.json","view_paper":"https://pith.science/paper/CYQGG5PW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.06930&json=true","fetch_graph":"https://pith.science/api/pith-number/CYQGG5PW2HTU4BG5R656DFCRDI/graph.json","fetch_events":"https://pith.science/api/pith-number/CYQGG5PW2HTU4BG5R656DFCRDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI/action/storage_attestation","attest_author":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI/action/author_attestation","sign_citation":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI/action/citation_signature","submit_replication":"https://pith.science/pith/CYQGG5PW2HTU4BG5R656DFCRDI/action/replication_record"}},"created_at":"2026-06-26T00:15:25.275259+00:00","updated_at":"2026-06-26T00:15:25.275259+00:00"}