{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IASSX4ZNPYSFE65GLPXSHBR7LO","short_pith_number":"pith:IASSX4ZN","canonical_record":{"source":{"id":"1709.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T18:47:26Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"023eb68f97b0441359b908e73be014fa52ccbdd8175804d8a8a3391424cb662b","abstract_canon_sha256":"d8267175ae52d2625e4fdd037a07d4a0add2e10715248ed9bd6d8d9141094d02"},"schema_version":"1.0"},"canonical_sha256":"40252bf32d7e24527ba65bef23863f5bb6136b654c75398c081ec8262b7d34d3","source":{"kind":"arxiv","id":"1709.07907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07907","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07907v1","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07907","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"IASSX4ZNPYSF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IASSX4ZNPYSFE65G","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IASSX4ZN","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IASSX4ZNPYSFE65GLPXSHBR7LO","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T18:47:26Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"023eb68f97b0441359b908e73be014fa52ccbdd8175804d8a8a3391424cb662b","abstract_canon_sha256":"d8267175ae52d2625e4fdd037a07d4a0add2e10715248ed9bd6d8d9141094d02"},"schema_version":"1.0"},"canonical_sha256":"40252bf32d7e24527ba65bef23863f5bb6136b654c75398c081ec8262b7d34d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:28.593621Z","signature_b64":"4W75u78heEwXNPaldrT3k9WIaLOIcjS6+B7yUk4kr6fj9XPphE4z4KgRwkn6JjVx5OOBylT7pdgnuAyXfwlUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40252bf32d7e24527ba65bef23863f5bb6136b654c75398c081ec8262b7d34d3","last_reissued_at":"2026-05-18T00:34:28.593167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:28.593167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07907","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tO1/VGVeMc8+jK9+KYIiDm+tRKpap68iIKV+hpsZkkBqeniXPOombOL8sso7zp7fdXg4R1qRinPmmvxRTuUwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:33:25.878160Z"},"content_sha256":"abc0c4ca1ca2b7189084f7e8bee2c7ca78fd99ecf00aa05518aa8103f0fdcab0","schema_version":"1.0","event_id":"sha256:abc0c4ca1ca2b7189084f7e8bee2c7ca78fd99ecf00aa05518aa8103f0fdcab0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IASSX4ZNPYSFE65GLPXSHBR7LO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average mixing matrix of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Chris Godsil, John Sinkovic, Krystal Guo","submitted_at":"2017-09-22T18:47:26Z","abstract_excerpt":"We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on $n$ vertices with $n$ distinct eigenvalues is upper-bounded by $\\frac{n}{2}$. Computations on trees up to $20$ vertices suggest that the rank attains this upper bound most of the times. We give an infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound. We also give a lower bound on the rank of the average mixing matrix of a tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07907","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z5kB3f3tFG4ftHBeE9bNDjQkR9uSE9yQ6aY6PpDktFjhMFu/ouvJnCNddzCNsZff0R+M7wF/qyIdLTCjRShBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:33:25.878879Z"},"content_sha256":"750a65273cd9650884e689eace5bdae399627a2e4ca7fb663170bd5307aedac5","schema_version":"1.0","event_id":"sha256:750a65273cd9650884e689eace5bdae399627a2e4ca7fb663170bd5307aedac5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/bundle.json","state_url":"https://pith.science/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/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-26T02:33:25Z","links":{"resolver":"https://pith.science/pith/IASSX4ZNPYSFE65GLPXSHBR7LO","bundle":"https://pith.science/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/bundle.json","state":"https://pith.science/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IASSX4ZNPYSFE65GLPXSHBR7LO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IASSX4ZNPYSFE65GLPXSHBR7LO","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":"d8267175ae52d2625e4fdd037a07d4a0add2e10715248ed9bd6d8d9141094d02","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T18:47:26Z","title_canon_sha256":"023eb68f97b0441359b908e73be014fa52ccbdd8175804d8a8a3391424cb662b"},"schema_version":"1.0","source":{"id":"1709.07907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07907","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07907v1","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07907","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"IASSX4ZNPYSF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IASSX4ZNPYSFE65G","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IASSX4ZN","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:750a65273cd9650884e689eace5bdae399627a2e4ca7fb663170bd5307aedac5","target":"graph","created_at":"2026-05-18T00:34:28Z","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":"We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on $n$ vertices with $n$ distinct eigenvalues is upper-bounded by $\\frac{n}{2}$. Computations on trees up to $20$ vertices suggest that the rank attains this upper bound most of the times. We give an infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound. We also give a lower bound on the rank of the average mixing matrix of a tree.","authors_text":"Chris Godsil, John Sinkovic, Krystal Guo","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T18:47:26Z","title":"Average mixing matrix of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07907","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:abc0c4ca1ca2b7189084f7e8bee2c7ca78fd99ecf00aa05518aa8103f0fdcab0","target":"record","created_at":"2026-05-18T00:34:28Z","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":"d8267175ae52d2625e4fdd037a07d4a0add2e10715248ed9bd6d8d9141094d02","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T18:47:26Z","title_canon_sha256":"023eb68f97b0441359b908e73be014fa52ccbdd8175804d8a8a3391424cb662b"},"schema_version":"1.0","source":{"id":"1709.07907","kind":"arxiv","version":1}},"canonical_sha256":"40252bf32d7e24527ba65bef23863f5bb6136b654c75398c081ec8262b7d34d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40252bf32d7e24527ba65bef23863f5bb6136b654c75398c081ec8262b7d34d3","first_computed_at":"2026-05-18T00:34:28.593167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:28.593167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4W75u78heEwXNPaldrT3k9WIaLOIcjS6+B7yUk4kr6fj9XPphE4z4KgRwkn6JjVx5OOBylT7pdgnuAyXfwlUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:28.593621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abc0c4ca1ca2b7189084f7e8bee2c7ca78fd99ecf00aa05518aa8103f0fdcab0","sha256:750a65273cd9650884e689eace5bdae399627a2e4ca7fb663170bd5307aedac5"],"state_sha256":"b39b055965272ee83cf64d65558484076d0d0189f531b321257fd042f415a0b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SozQSm1sFkeRC05oiohEPbFz+xbzShR7MWB22EhP7b2HqkwA3IOz4fUCybuBEUQXQ9WmFPyo+vJtZ481Q2qCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:33:25.882610Z","bundle_sha256":"1cdce6145833fe60519bf177a1aab0f7d5a2b297b41dc584d1b159e55e75cb38"}}