{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KBUH6KM3KCSAYJRJTFN24OPM6Q","short_pith_number":"pith:KBUH6KM3","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"},"canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","source":{"kind":"arxiv","id":"1510.01415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01415","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01415v1","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01415","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"KBUH6KM3KCSA","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KBUH6KM3KCSAYJRJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KBUH6KM3","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KBUH6KM3KCSAYJRJTFN24OPM6Q","target":"record","payload":{"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"},"canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","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"},"source_kind":"arxiv","source_id":"1510.01415","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltrFjqv7N7OZAdwRV0PvsBr4iEovXkNQ43Ut0PcKgRRCu10P0AwT3TDMoev1HgecJgi0mKFWJJhyuN4h7hLqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:58:20.111493Z"},"content_sha256":"21d07f87a3d4f06cdf3f16db3656e6387c1db2e68ca3b3f8afaa819144bb7b0f","schema_version":"1.0","event_id":"sha256:21d07f87a3d4f06cdf3f16db3656e6387c1db2e68ca3b3f8afaa819144bb7b0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KBUH6KM3KCSAYJRJTFN24OPM6Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6cwlWuoYzJIWi4zCrVvusUtwI1q9I+uHtRh6A6VJ/NAsmaoST8RLZnPCWZsz+XsXlr+wmfUP7p7rMk+LpKFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:58:20.114546Z"},"content_sha256":"f691363ea5445dd98dd0624421ac92a96bc16f05f11c8ac5509ff891d52ad534","schema_version":"1.0","event_id":"sha256:f691363ea5445dd98dd0624421ac92a96bc16f05f11c8ac5509ff891d52ad534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/bundle.json","state_url":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T12:58:20Z","links":{"resolver":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q","bundle":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/bundle.json","state":"https://pith.science/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBUH6KM3KCSAYJRJTFN24OPM6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KBUH6KM3KCSAYJRJTFN24OPM6Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c951adb3a45a357b63afbfd106028b8d7c4663756276916389e2d2be009db55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-06T02:24:48Z","title_canon_sha256":"2dfe019ec0baa78919a81bc22f3087dfbd0bfd91a1d9dbb735d33e278a836d71"},"schema_version":"1.0","source":{"id":"1510.01415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01415","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01415v1","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01415","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"KBUH6KM3KCSA","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KBUH6KM3KCSAYJRJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KBUH6KM3","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:f691363ea5445dd98dd0624421ac92a96bc16f05f11c8ac5509ff891d52ad534","target":"graph","created_at":"2026-05-18T01:30:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ehsan Chiniforooshan, Seyed Saeed Changiz Rezaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-06T02:24:48Z","title":"Symmetric Graphs with respect to Graph Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01415","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:21d07f87a3d4f06cdf3f16db3656e6387c1db2e68ca3b3f8afaa819144bb7b0f","target":"record","created_at":"2026-05-18T01:30:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c951adb3a45a357b63afbfd106028b8d7c4663756276916389e2d2be009db55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-06T02:24:48Z","title_canon_sha256":"2dfe019ec0baa78919a81bc22f3087dfbd0bfd91a1d9dbb735d33e278a836d71"},"schema_version":"1.0","source":{"id":"1510.01415","kind":"arxiv","version":1}},"canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50687f299b50a40c2629995bae39ecf430ab6190ce75d210673c81b6308d1351","first_computed_at":"2026-05-18T01:30:56.948136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:56.948136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LgNmh3pawGh5gE/hI8/D/LRXeYp1jDQw4tWYpcLiF0bFiBafhap4O+ET6/x+7zqngGlJL/SwEtUdjC+xtasiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:56.948647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21d07f87a3d4f06cdf3f16db3656e6387c1db2e68ca3b3f8afaa819144bb7b0f","sha256:f691363ea5445dd98dd0624421ac92a96bc16f05f11c8ac5509ff891d52ad534"],"state_sha256":"8a70f8d5d5b929d7861629991b25d3acc076db4b98c608a59e26e013d3b948ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AyoDu7VwDqBl1xGfQHA2mMvAJj0A4BxZ1avpQk7qydLW0qPV19u6ElUAnexvYLiwtDVEvWhmISCqF18IGw9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:58:20.118516Z","bundle_sha256":"034066f4fdb39f94ed784f8a9e769a468ab873696a6a90d998aaaed66e35703b"}}