{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KBUH6KM3KCSAYJRJTFN24OPM6Q","short_pith_number":"pith:KBUH6KM3","schema_version":"1.0","canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","source":{"kind":"arxiv","id":"1510.01415","version":1},"attestation_state":"computed","paper":{"title":"Symmetric Graphs with respect to Graph Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ehsan Chiniforooshan, Seyed Saeed Changiz Rezaei","submitted_at":"2015-10-06T02:24:48Z","abstract_excerpt":"Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \\emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$. Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we characterize all graphs which are symmetric with respect to graph entropy. We show that a graph is symmetric with respect to graph entropy if and only if its vertex set can be un"},"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":"1510.01415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-06T02:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"2dfe019ec0baa78919a81bc22f3087dfbd0bfd91a1d9dbb735d33e278a836d71","abstract_canon_sha256":"0c951adb3a45a357b63afbfd106028b8d7c4663756276916389e2d2be009db55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:56.948647Z","signature_b64":"LgNmh3pawGh5gE/hI8/D/LRXeYp1jDQw4tWYpcLiF0bFiBafhap4O+ET6/x+7zqngGlJL/SwEtUdjC+xtasiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","last_reissued_at":"2026-05-18T01:30:56.948136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:56.948136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Graphs with respect to Graph Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ehsan Chiniforooshan, Seyed Saeed Changiz Rezaei","submitted_at":"2015-10-06T02:24:48Z","abstract_excerpt":"Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \\emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$. Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we characterize all graphs which are symmetric with respect to graph entropy. We show that a graph is symmetric with respect to graph entropy if and only if its vertex set can be un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01415","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":"1510.01415","created_at":"2026-05-18T01:30:56.948203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01415v1","created_at":"2026-05-18T01:30:56.948203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01415","created_at":"2026-05-18T01:30:56.948203+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBUH6KM3KCSA","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBUH6KM3KCSAYJRJ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBUH6KM3","created_at":"2026-05-18T12:29:27.538025+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/KBUH6KM3KCSAYJRJTFN24OPM6Q","json":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q.json","graph_json":"https://pith.science/api/pith-number/KBUH6KM3KCSAYJRJTFN24OPM6Q/graph.json","events_json":"https://pith.science/api/pith-number/KBUH6KM3KCSAYJRJTFN24OPM6Q/events.json","paper":"https://pith.science/paper/KBUH6KM3"},"agent_actions":{"view_html":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q","download_json":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q.json","view_paper":"https://pith.science/paper/KBUH6KM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01415&json=true","fetch_graph":"https://pith.science/api/pith-number/KBUH6KM3KCSAYJRJTFN24OPM6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/KBUH6KM3KCSAYJRJTFN24OPM6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/action/storage_attestation","attest_author":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/action/author_attestation","sign_citation":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/action/citation_signature","submit_replication":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/action/replication_record"}},"created_at":"2026-05-18T01:30:56.948203+00:00","updated_at":"2026-05-18T01:30:56.948203+00:00"}