{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B3ECGSLU6Z5EFYZEUF22Q22IVR","short_pith_number":"pith:B3ECGSLU","schema_version":"1.0","canonical_sha256":"0ec8234974f67a42e324a175a86b48ac67f0ebb4a7f47e6573cf2807bbfed830","source":{"kind":"arxiv","id":"1511.06378","version":1},"attestation_state":"computed","paper":{"title":"Characterizing graphs of maximum principal ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josh Tobin, Michael Tait","submitted_at":"2015-11-19T21:07:18Z","abstract_excerpt":"The principal ratio of a connected graph, denoted $\\gamma(G)$, is the ratio of the maximum and minimum entries of its first eigenvector. Cioab\\u{a} and Gregory conjectured that the graph on $n$ vertices maximizing $\\gamma(G)$ is a kite graph: a complete graph with a pendant path. In this paper we prove their conjecture."},"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":"1511.06378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-19T21:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"0d757f4cf749cedec9fe442989c15a633758aaeef5482efc187c71411e925e4e","abstract_canon_sha256":"a1b4bb56b4b1f6b862fd93cd11d93d1315262ea1fd17eadde32c8c4c60c0e436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.563707Z","signature_b64":"qA0FcLD9P9REQEXmmgwAAXS/J/6F+o2QMROGifhYbWCKdBAWqF4DveHyrlqGpTfmooZrMqdlJntOKH8gNUxbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ec8234974f67a42e324a175a86b48ac67f0ebb4a7f47e6573cf2807bbfed830","last_reissued_at":"2026-05-18T01:26:24.563278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.563278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing graphs of maximum principal ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josh Tobin, Michael Tait","submitted_at":"2015-11-19T21:07:18Z","abstract_excerpt":"The principal ratio of a connected graph, denoted $\\gamma(G)$, is the ratio of the maximum and minimum entries of its first eigenvector. Cioab\\u{a} and Gregory conjectured that the graph on $n$ vertices maximizing $\\gamma(G)$ is a kite graph: a complete graph with a pendant path. In this paper we prove their conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06378","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06378","created_at":"2026-05-18T01:26:24.563353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06378v1","created_at":"2026-05-18T01:26:24.563353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06378","created_at":"2026-05-18T01:26:24.563353+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3ECGSLU6Z5E","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3ECGSLU6Z5EFYZE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3ECGSLU","created_at":"2026-05-18T12:29:14.074870+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/B3ECGSLU6Z5EFYZEUF22Q22IVR","json":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR.json","graph_json":"https://pith.science/api/pith-number/B3ECGSLU6Z5EFYZEUF22Q22IVR/graph.json","events_json":"https://pith.science/api/pith-number/B3ECGSLU6Z5EFYZEUF22Q22IVR/events.json","paper":"https://pith.science/paper/B3ECGSLU"},"agent_actions":{"view_html":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR","download_json":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR.json","view_paper":"https://pith.science/paper/B3ECGSLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06378&json=true","fetch_graph":"https://pith.science/api/pith-number/B3ECGSLU6Z5EFYZEUF22Q22IVR/graph.json","fetch_events":"https://pith.science/api/pith-number/B3ECGSLU6Z5EFYZEUF22Q22IVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR/action/storage_attestation","attest_author":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR/action/author_attestation","sign_citation":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR/action/citation_signature","submit_replication":"https://pith.science/pith/B3ECGSLU6Z5EFYZEUF22Q22IVR/action/replication_record"}},"created_at":"2026-05-18T01:26:24.563353+00:00","updated_at":"2026-05-18T01:26:24.563353+00:00"}