{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XWGZLAMG4QIVSMR6IIY7OOGTE6","short_pith_number":"pith:XWGZLAMG","canonical_record":{"source":{"id":"2605.22730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"95127cc3b6ec56cfedecd54a0b4c063b39d012a99be99afd189c691a71f809cc","abstract_canon_sha256":"d8638eae7f862351b7c487f227d8bc095468fbf0ee1823097ad5963cb9b56ecf"},"schema_version":"1.0"},"canonical_sha256":"bd8d958186e41159323e4231f738d32790506a86db43b9012d4e07e28745dca8","source":{"kind":"arxiv","id":"2605.22730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22730","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22730v1","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22730","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"XWGZLAMG4QIV","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"XWGZLAMG4QIVSMR6","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"XWGZLAMG","created_at":"2026-05-22T02:04:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XWGZLAMG4QIVSMR6IIY7OOGTE6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"95127cc3b6ec56cfedecd54a0b4c063b39d012a99be99afd189c691a71f809cc","abstract_canon_sha256":"d8638eae7f862351b7c487f227d8bc095468fbf0ee1823097ad5963cb9b56ecf"},"schema_version":"1.0"},"canonical_sha256":"bd8d958186e41159323e4231f738d32790506a86db43b9012d4e07e28745dca8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:52.323424Z","signature_b64":"i+MXQjUPKK556rqM479cxnxE4vLsAHreTMLReaetckcfldMVCwNanhHmtToNBm9I0b0pe7lfao37OOCK9UcIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd8d958186e41159323e4231f738d32790506a86db43b9012d4e07e28745dca8","last_reissued_at":"2026-05-22T02:04:52.322760Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:52.322760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22730","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-22T02:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHw9rlOFsnfDyyh+dkb8vgvdrqSF8sIPAOsxt0aKucXHxxLkgFpSHyXfLgNWuJ54N3k3tiqTGVttfc1JgycQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:35:41.487403Z"},"content_sha256":"f3e94425151b24f460a7a8d6826ee052b7b417516eaa1d66f4a6cd066169bae7","schema_version":"1.0","event_id":"sha256:f3e94425151b24f460a7a8d6826ee052b7b417516eaa1d66f4a6cd066169bae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XWGZLAMG4QIVSMR6IIY7OOGTE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path-Minimality of $p$-Energy for Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Quanyu Tang, Yinchen Liu","submitted_at":"2026-05-21T17:03:10Z","abstract_excerpt":"Let $G$ be a simple connected graph on $n$ vertices, and let $\\lambda_1(G),\\lambda_2(G),\\ldots,\\lambda_n(G)$ be the eigenvalues of its adjacency matrix $A(G)$. For $p>0$, define the $p$-energy of $G$ by $\\mathcal E_p(G)=\\sum_{i=1}^n |\\lambda_i(G)|^p$. We prove that, for every real number $p\\ge 2$ and every simple connected graph $G$ on $n$ vertices, $$ \\mathcal E_p(G)\\ge \\mathcal E_p(P_n), $$ where $P_n$ denotes the path on $n$ vertices. Moreover, for each fixed $p>2$, equality holds if and only if $G\\cong P_n$. Together with the previously known star-minimality results, this completes the sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22730","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22730/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-22T02:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFDua3jhV3AkAtUXPauCjOvJf3FgGt6/Ud8FhhzvTuVXSDJmNVcax1gg/oxrWTXbIAssREkgeDCSLm2Aes/sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:35:41.487799Z"},"content_sha256":"abe37c12bd9438b26bb0108ca44ce71c9279e117c29785fd58e13c4899cdd069","schema_version":"1.0","event_id":"sha256:abe37c12bd9438b26bb0108ca44ce71c9279e117c29785fd58e13c4899cdd069"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/bundle.json","state_url":"https://pith.science/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/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-06-04T15:35:41Z","links":{"resolver":"https://pith.science/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6","bundle":"https://pith.science/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/bundle.json","state":"https://pith.science/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWGZLAMG4QIVSMR6IIY7OOGTE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XWGZLAMG4QIVSMR6IIY7OOGTE6","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":"d8638eae7f862351b7c487f227d8bc095468fbf0ee1823097ad5963cb9b56ecf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:03:10Z","title_canon_sha256":"95127cc3b6ec56cfedecd54a0b4c063b39d012a99be99afd189c691a71f809cc"},"schema_version":"1.0","source":{"id":"2605.22730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22730","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22730v1","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22730","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"XWGZLAMG4QIV","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"XWGZLAMG4QIVSMR6","created_at":"2026-05-22T02:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"XWGZLAMG","created_at":"2026-05-22T02:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:abe37c12bd9438b26bb0108ca44ce71c9279e117c29785fd58e13c4899cdd069","target":"graph","created_at":"2026-05-22T02:04:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.22730/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple connected graph on $n$ vertices, and let $\\lambda_1(G),\\lambda_2(G),\\ldots,\\lambda_n(G)$ be the eigenvalues of its adjacency matrix $A(G)$. For $p>0$, define the $p$-energy of $G$ by $\\mathcal E_p(G)=\\sum_{i=1}^n |\\lambda_i(G)|^p$. We prove that, for every real number $p\\ge 2$ and every simple connected graph $G$ on $n$ vertices, $$ \\mathcal E_p(G)\\ge \\mathcal E_p(P_n), $$ where $P_n$ denotes the path on $n$ vertices. Moreover, for each fixed $p>2$, equality holds if and only if $G\\cong P_n$. Together with the previously known star-minimality results, this completes the sol","authors_text":"Quanyu Tang, Yinchen Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:03:10Z","title":"Path-Minimality of $p$-Energy for Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22730","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:f3e94425151b24f460a7a8d6826ee052b7b417516eaa1d66f4a6cd066169bae7","target":"record","created_at":"2026-05-22T02:04:52Z","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":"d8638eae7f862351b7c487f227d8bc095468fbf0ee1823097ad5963cb9b56ecf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T17:03:10Z","title_canon_sha256":"95127cc3b6ec56cfedecd54a0b4c063b39d012a99be99afd189c691a71f809cc"},"schema_version":"1.0","source":{"id":"2605.22730","kind":"arxiv","version":1}},"canonical_sha256":"bd8d958186e41159323e4231f738d32790506a86db43b9012d4e07e28745dca8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd8d958186e41159323e4231f738d32790506a86db43b9012d4e07e28745dca8","first_computed_at":"2026-05-22T02:04:52.322760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T02:04:52.322760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i+MXQjUPKK556rqM479cxnxE4vLsAHreTMLReaetckcfldMVCwNanhHmtToNBm9I0b0pe7lfao37OOCK9UcIDA==","signature_status":"signed_v1","signed_at":"2026-05-22T02:04:52.323424Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e94425151b24f460a7a8d6826ee052b7b417516eaa1d66f4a6cd066169bae7","sha256:abe37c12bd9438b26bb0108ca44ce71c9279e117c29785fd58e13c4899cdd069"],"state_sha256":"5d770f6fd194febb41ec081bec2690b8b005e49c9bf826274a347384bd29fb35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4emLUYGAb96YazRBrioTxjV7Ycn2NfyOAJJH3yV8fL3B1hZmatdLM3Dk5iI0LCuJnEpL0jsVxQA1eCMSe6P4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:35:41.490056Z","bundle_sha256":"240525609a3a962662a25f5a286bf2447c40a62b4c4f34b1b73ebbd3224ce961"}}