{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GPBQ2KP36ZHKA2IDX6KYGGU6OF","short_pith_number":"pith:GPBQ2KP3","canonical_record":{"source":{"id":"1809.07186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T02:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"72e05b6d8a36c43a8ae70e9187a6c4102bca3c42407fa101daed7504c02f6801","abstract_canon_sha256":"6468ca4ca785ffd20a1f376140a9d94d762d983e9d0059a89b67e7f6e5e9b28c"},"schema_version":"1.0"},"canonical_sha256":"33c30d29fbf64ea06903bf95831a9e71506f5f702b94486c9ff1e0803ec5a341","source":{"kind":"arxiv","id":"1809.07186","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07186","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07186v2","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07186","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"GPBQ2KP36ZHK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPBQ2KP36ZHKA2ID","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPBQ2KP3","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GPBQ2KP36ZHKA2IDX6KYGGU6OF","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T02:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"72e05b6d8a36c43a8ae70e9187a6c4102bca3c42407fa101daed7504c02f6801","abstract_canon_sha256":"6468ca4ca785ffd20a1f376140a9d94d762d983e9d0059a89b67e7f6e5e9b28c"},"schema_version":"1.0"},"canonical_sha256":"33c30d29fbf64ea06903bf95831a9e71506f5f702b94486c9ff1e0803ec5a341","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:13.375023Z","signature_b64":"zCFQnrGhxVnALY257biCbl+wnryWteZ9DBv9rYnhRZq63ZhkuDbNl6ptxpXoh57QUDAXg0Q+JSJ8U0b9vk0lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c30d29fbf64ea06903bf95831a9e71506f5f702b94486c9ff1e0803ec5a341","last_reissued_at":"2026-05-18T00:05:13.374416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:13.374416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07186","source_version":2,"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-18T00:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/odu49lUuJrAVrTgm9oqyrGzeLswqpuCQpbMIyAbM5Xr0dZnuD1OWXoe35A2rCkfPxh/iyVmVTHRPkKsYC/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:50:28.097573Z"},"content_sha256":"4bc38e6f81f67cffd7c9c7465dcd4f3993c666ba19987e8e340f48b4dffafb40","schema_version":"1.0","event_id":"sha256:4bc38e6f81f67cffd7c9c7465dcd4f3993c666ba19987e8e340f48b4dffafb40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GPBQ2KP36ZHKA2IDX6KYGGU6OF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Equitable Decompositions for Graphs with Symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Francis, Benjamin Webb, Dallas Smith","submitted_at":"2018-09-18T02:36:10Z","abstract_excerpt":"Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. This is done by decomposing the matrix over a graph symmetry. Previously it was shown that a matrix can be equitably decomposed over any uniform, basic, or separable automorphism. Here we extend this theory to show that it is possible to equitably decompose a matrix over any automorphism of a graph, without restriction. Moreover, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07186","kind":"arxiv","version":2},"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-18T00:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edyWE8pKMIYaSVKltoTUZ1Is16cZkW0hwnK5aieowdfAeTPdaaqjVSFwTFmyNjSk2P1aC9oEq1bF9CGmy/fFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:50:28.098038Z"},"content_sha256":"81b0a0b62abbea6ded015f219f3c1672ff3d612da4c52a7d1b3ec3c80be6842d","schema_version":"1.0","event_id":"sha256:81b0a0b62abbea6ded015f219f3c1672ff3d612da4c52a7d1b3ec3c80be6842d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/bundle.json","state_url":"https://pith.science/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/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-27T13:50:28Z","links":{"resolver":"https://pith.science/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF","bundle":"https://pith.science/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/bundle.json","state":"https://pith.science/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPBQ2KP36ZHKA2IDX6KYGGU6OF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GPBQ2KP36ZHKA2IDX6KYGGU6OF","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":"6468ca4ca785ffd20a1f376140a9d94d762d983e9d0059a89b67e7f6e5e9b28c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T02:36:10Z","title_canon_sha256":"72e05b6d8a36c43a8ae70e9187a6c4102bca3c42407fa101daed7504c02f6801"},"schema_version":"1.0","source":{"id":"1809.07186","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07186","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07186v2","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07186","created_at":"2026-05-18T00:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"GPBQ2KP36ZHK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPBQ2KP36ZHKA2ID","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPBQ2KP3","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:81b0a0b62abbea6ded015f219f3c1672ff3d612da4c52a7d1b3ec3c80be6842d","target":"graph","created_at":"2026-05-18T00:05:13Z","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":"Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. This is done by decomposing the matrix over a graph symmetry. Previously it was shown that a matrix can be equitably decomposed over any uniform, basic, or separable automorphism. Here we extend this theory to show that it is possible to equitably decompose a matrix over any automorphism of a graph, without restriction. Moreover, w","authors_text":"Amanda Francis, Benjamin Webb, Dallas Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T02:36:10Z","title":"General Equitable Decompositions for Graphs with Symmetries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07186","kind":"arxiv","version":2},"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:4bc38e6f81f67cffd7c9c7465dcd4f3993c666ba19987e8e340f48b4dffafb40","target":"record","created_at":"2026-05-18T00:05:13Z","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":"6468ca4ca785ffd20a1f376140a9d94d762d983e9d0059a89b67e7f6e5e9b28c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-18T02:36:10Z","title_canon_sha256":"72e05b6d8a36c43a8ae70e9187a6c4102bca3c42407fa101daed7504c02f6801"},"schema_version":"1.0","source":{"id":"1809.07186","kind":"arxiv","version":2}},"canonical_sha256":"33c30d29fbf64ea06903bf95831a9e71506f5f702b94486c9ff1e0803ec5a341","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33c30d29fbf64ea06903bf95831a9e71506f5f702b94486c9ff1e0803ec5a341","first_computed_at":"2026-05-18T00:05:13.374416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:13.374416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCFQnrGhxVnALY257biCbl+wnryWteZ9DBv9rYnhRZq63ZhkuDbNl6ptxpXoh57QUDAXg0Q+JSJ8U0b9vk0lCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:13.375023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07186","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bc38e6f81f67cffd7c9c7465dcd4f3993c666ba19987e8e340f48b4dffafb40","sha256:81b0a0b62abbea6ded015f219f3c1672ff3d612da4c52a7d1b3ec3c80be6842d"],"state_sha256":"a49e796dd28e569c61a7682b3109da60f2b3ab1eaeb2a7459e0adc5f6c8636ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/SCvLCU22hI11OIDVTP6fjQfQNJEMqv1X456uIr1MQspn7olSvC1etX8719qM6+VBddpEcUqLIMm3VblmudBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:50:28.100606Z","bundle_sha256":"048a10ab6a1f3b86d6a26336442617dcd0ceb240e5e06e0229298203dfeabd5c"}}