{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3BVOWJVK4QRYBZ5NHQ3NHTA6LJ","short_pith_number":"pith:3BVOWJVK","canonical_record":{"source":{"id":"1311.6561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T05:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"e66b769a45e9a205c3d59f467e9d9f7ee617f0cf807c465bf6c65a8217b4a363","abstract_canon_sha256":"26e7e99dbe2ad24888ecc92442f50de047a3a4a78ee9ce8fc308c1b7a4cc79d7"},"schema_version":"1.0"},"canonical_sha256":"d86aeb26aae42380e7ad3c36d3cc1e5a74f9ce7dd6e7a2eb51cf194b398a8b38","source":{"kind":"arxiv","id":"1311.6561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6561","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6561v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6561","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"3BVOWJVK4QRY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3BVOWJVK4QRYBZ5N","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3BVOWJVK","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3BVOWJVK4QRYBZ5NHQ3NHTA6LJ","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T05:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"e66b769a45e9a205c3d59f467e9d9f7ee617f0cf807c465bf6c65a8217b4a363","abstract_canon_sha256":"26e7e99dbe2ad24888ecc92442f50de047a3a4a78ee9ce8fc308c1b7a4cc79d7"},"schema_version":"1.0"},"canonical_sha256":"d86aeb26aae42380e7ad3c36d3cc1e5a74f9ce7dd6e7a2eb51cf194b398a8b38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.356711Z","signature_b64":"Kp2MNHNuU2aMOVtVKmUlE2vTozGwVcJmf0Fokq/7oBX20NEJpGNzWpJ+ZbsgixbtmOy2DKCKpmnyLaiMOHnVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d86aeb26aae42380e7ad3c36d3cc1e5a74f9ce7dd6e7a2eb51cf194b398a8b38","last_reissued_at":"2026-05-18T03:06:12.356288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.356288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6561","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-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SW79maF/ylcod78fMnE4111ttSBtjnlUR2M2DOhMNxNOQo5ksBOTLdjh1k2VgJ8R7gVffoxxnbWRstxRsSUOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:45.252838Z"},"content_sha256":"104ff9ecd04e824ff571e874dd41126c4e2f4e8d4a33a259aa520b411af9de7c","schema_version":"1.0","event_id":"sha256:104ff9ecd04e824ff571e874dd41126c4e2f4e8d4a33a259aa520b411af9de7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3BVOWJVK4QRYBZ5NHQ3NHTA6LJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy of Symmetric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Godsil, Seyed Saeed Changiz Rezaei","submitted_at":"2013-11-26T05:40:14Z","abstract_excerpt":"A graph $G$ is called \\emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. 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 prove that vertex transitive graphs are symmetric with respect to graph entropy. As the main result of this paper, we prove that a perfect graph is symmetric with respect to graph entropy if and on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6561","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-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyJ0Wjmn5mfR/oXhqaw38O7oKjxyy3a1Y//d3i3tU1cG/goiYPr75/hwjpjwN969yPLE44p3Y4ZtSJns8iRzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:06:45.253551Z"},"content_sha256":"1027cbd07187640d3c27d74f40a81017a7891bb2d7d25d4b365cbf01dfdbd2d8","schema_version":"1.0","event_id":"sha256:1027cbd07187640d3c27d74f40a81017a7891bb2d7d25d4b365cbf01dfdbd2d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/bundle.json","state_url":"https://pith.science/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/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-26T07:06:45Z","links":{"resolver":"https://pith.science/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ","bundle":"https://pith.science/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/bundle.json","state":"https://pith.science/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BVOWJVK4QRYBZ5NHQ3NHTA6LJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3BVOWJVK4QRYBZ5NHQ3NHTA6LJ","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":"26e7e99dbe2ad24888ecc92442f50de047a3a4a78ee9ce8fc308c1b7a4cc79d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T05:40:14Z","title_canon_sha256":"e66b769a45e9a205c3d59f467e9d9f7ee617f0cf807c465bf6c65a8217b4a363"},"schema_version":"1.0","source":{"id":"1311.6561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6561","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6561v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6561","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"3BVOWJVK4QRY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3BVOWJVK4QRYBZ5N","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3BVOWJVK","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:1027cbd07187640d3c27d74f40a81017a7891bb2d7d25d4b365cbf01dfdbd2d8","target":"graph","created_at":"2026-05-18T03:06:12Z","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":"A graph $G$ is called \\emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. 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 prove that vertex transitive graphs are symmetric with respect to graph entropy. As the main result of this paper, we prove that a perfect graph is symmetric with respect to graph entropy if and on","authors_text":"Chris Godsil, Seyed Saeed Changiz Rezaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T05:40:14Z","title":"Entropy of Symmetric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6561","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:104ff9ecd04e824ff571e874dd41126c4e2f4e8d4a33a259aa520b411af9de7c","target":"record","created_at":"2026-05-18T03:06:12Z","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":"26e7e99dbe2ad24888ecc92442f50de047a3a4a78ee9ce8fc308c1b7a4cc79d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T05:40:14Z","title_canon_sha256":"e66b769a45e9a205c3d59f467e9d9f7ee617f0cf807c465bf6c65a8217b4a363"},"schema_version":"1.0","source":{"id":"1311.6561","kind":"arxiv","version":1}},"canonical_sha256":"d86aeb26aae42380e7ad3c36d3cc1e5a74f9ce7dd6e7a2eb51cf194b398a8b38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d86aeb26aae42380e7ad3c36d3cc1e5a74f9ce7dd6e7a2eb51cf194b398a8b38","first_computed_at":"2026-05-18T03:06:12.356288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:12.356288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kp2MNHNuU2aMOVtVKmUlE2vTozGwVcJmf0Fokq/7oBX20NEJpGNzWpJ+ZbsgixbtmOy2DKCKpmnyLaiMOHnVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:12.356711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:104ff9ecd04e824ff571e874dd41126c4e2f4e8d4a33a259aa520b411af9de7c","sha256:1027cbd07187640d3c27d74f40a81017a7891bb2d7d25d4b365cbf01dfdbd2d8"],"state_sha256":"20e1a1dea8282ccda0dacc194bb23c9fb39fb0140ddbf86ffe2bd3fee9630c78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqmX6NDSJIHNoTW2IBcX7jfwzX9NQSSE1tJp7Y/KswJl3rPWWbw+5rqgIV+AwOShynmdIDUsCds3iY7DaCyHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:06:45.257307Z","bundle_sha256":"8a6ddffba380e436dea59a0169ab090aac1887a428177f271fbd903fca7bf082"}}