{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J7BC7PIV2745Q3WM4C4XJGXXES","short_pith_number":"pith:J7BC7PIV","schema_version":"1.0","canonical_sha256":"4fc22fbd15d7f9d86ecce0b9749af724b63f80361664c0d7df493764fc0491f9","source":{"kind":"arxiv","id":"1510.04366","version":2},"attestation_state":"computed","paper":{"title":"Equitable Decompositions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Francis, Ben Webb, Wayne Barrett","submitted_at":"2015-10-15T00:53:54Z","abstract_excerpt":"We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\\phi$, it is possible to use $\\phi$ to decompose any matrix $M\\in\\mathbb{C}^{n \\times n}$ appropriately associated with the graph. The result of this decomposition is a number of strictly smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. Some of the matrices that can be decomposed are the graph's adjaceny matrix, Laplacian matrix, etc. Because this decomposition has conn"},"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.04366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-15T00:53:54Z","cross_cats_sorted":[],"title_canon_sha256":"e7ca244242624f41c0570548cb0672635c8099396679f1fc048443826ace5b9b","abstract_canon_sha256":"df122e0c93b13e52031bb4a1d7c7dab1cad3f89dc99a3e136b614181dc408fb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.400028Z","signature_b64":"SiHzb2EU+Su3JEn0oieZg5M96tytQv4qO6EVvWIEP6XHJJGNnzJPv6j+60TZcWG9pzULr9opMCMtR/yVMq4yAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc22fbd15d7f9d86ecce0b9749af724b63f80361664c0d7df493764fc0491f9","last_reissued_at":"2026-05-18T01:03:06.399405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.399405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable Decompositions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Francis, Ben Webb, Wayne Barrett","submitted_at":"2015-10-15T00:53:54Z","abstract_excerpt":"We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\\phi$, it is possible to use $\\phi$ to decompose any matrix $M\\in\\mathbb{C}^{n \\times n}$ appropriately associated with the graph. The result of this decomposition is a number of strictly smaller matrices whose collective eigenvalues are the same as the eigenvalues of the original matrix $M$. Some of the matrices that can be decomposed are the graph's adjaceny matrix, Laplacian matrix, etc. Because this decomposition has conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04366","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.04366","created_at":"2026-05-18T01:03:06.399504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04366v2","created_at":"2026-05-18T01:03:06.399504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04366","created_at":"2026-05-18T01:03:06.399504+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7BC7PIV2745","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7BC7PIV2745Q3WM","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7BC7PIV","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/J7BC7PIV2745Q3WM4C4XJGXXES","json":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES.json","graph_json":"https://pith.science/api/pith-number/J7BC7PIV2745Q3WM4C4XJGXXES/graph.json","events_json":"https://pith.science/api/pith-number/J7BC7PIV2745Q3WM4C4XJGXXES/events.json","paper":"https://pith.science/paper/J7BC7PIV"},"agent_actions":{"view_html":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES","download_json":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES.json","view_paper":"https://pith.science/paper/J7BC7PIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04366&json=true","fetch_graph":"https://pith.science/api/pith-number/J7BC7PIV2745Q3WM4C4XJGXXES/graph.json","fetch_events":"https://pith.science/api/pith-number/J7BC7PIV2745Q3WM4C4XJGXXES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES/action/storage_attestation","attest_author":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES/action/author_attestation","sign_citation":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES/action/citation_signature","submit_replication":"https://pith.science/pith/J7BC7PIV2745Q3WM4C4XJGXXES/action/replication_record"}},"created_at":"2026-05-18T01:03:06.399504+00:00","updated_at":"2026-05-18T01:03:06.399504+00:00"}