{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KVMCZRVB3QZWKSIMLHPWB3V4DY","short_pith_number":"pith:KVMCZRVB","canonical_record":{"source":{"id":"1405.7498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T08:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"46d89d0404b89692b2802f9c68acb0f3f17bfd71b3e6b2857f2c0089409edda0","abstract_canon_sha256":"bd37c92e7fcffd6015e9cc0bd561e9afe66165a937939377f2372ea9e6061393"},"schema_version":"1.0"},"canonical_sha256":"55582cc6a1dc3365490c59df60eebc1e35e35ebc8b48438475fd626587b9d55a","source":{"kind":"arxiv","id":"1405.7498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7498","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7498v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7498","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"KVMCZRVB3QZW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KVMCZRVB3QZWKSIM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KVMCZRVB","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KVMCZRVB3QZWKSIMLHPWB3V4DY","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T08:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"46d89d0404b89692b2802f9c68acb0f3f17bfd71b3e6b2857f2c0089409edda0","abstract_canon_sha256":"bd37c92e7fcffd6015e9cc0bd561e9afe66165a937939377f2372ea9e6061393"},"schema_version":"1.0"},"canonical_sha256":"55582cc6a1dc3365490c59df60eebc1e35e35ebc8b48438475fd626587b9d55a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.115344Z","signature_b64":"vu7u2kvENEEAQKdeJThDvkTDYRIALjemti2KFZaUN0c+VMKn1Nc2kB+BGmRJpi+avyUNE33ql7JFV7jhYPx1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55582cc6a1dc3365490c59df60eebc1e35e35ebc8b48438475fd626587b9d55a","last_reissued_at":"2026-05-18T02:50:51.114778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.114778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7498","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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouThzLoG92LAAd48v5xGi5Qp2p/3Sbr+T2VKzGyWmq2S69ziAXWONFqBh6BeBemTUJi3Ii4Yw0Ot8ey6TqS3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:21:30.059883Z"},"content_sha256":"e2117e9aac4d8b36cb7a9e3194c947b36fa5d31e2d04f8f89cb89a3ccd50518a","schema_version":"1.0","event_id":"sha256:e2117e9aac4d8b36cb7a9e3194c947b36fa5d31e2d04f8f89cb89a3ccd50518a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KVMCZRVB3QZWKSIMLHPWB3V4DY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randi\\'c Incidence Energy of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei Huang, Ran Gu, Xueliang Li","submitted_at":"2014-05-29T08:45:41Z","abstract_excerpt":"Let $G$ be a simple graph with vertex set $V(G) = \\{v_1, v_2,\\ldots, v_n\\}$ and edge set $E(G) = \\{e_1, e_2,\\ldots, e_m\\}$. Similar to the Randi\\'c matrix, here we introduce the Randi\\'c incidence matrix of a graph $G$, denoted by $I_R(G)$, which is defined as the $n\\times m$ matrix whose $(i, j)$-entry is $(d_i)^{-\\frac{1}{2}}$ if $v_i$ is incident to $e_j$ and $0$ otherwise. Naturally, the Randi\\'c incidence energy $I_RE$ of $G$ is the sum of the singular values of $I_R(G)$. We establish lower and upper bounds for the Randi\\'c incidence energy. Graphs for which these bounds are best possible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7498","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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNH/OctuSIOqnjplnnQNcWj9BHXK6qnpgI+CZm0ZM6BEce2Erc5NT0fr55m0456BMc5Mjzly6JR+t0DTkNjIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:21:30.060565Z"},"content_sha256":"8d350b02a393f5fa7af7435ccd0b781b30a688a92220310bf4242dddb7275181","schema_version":"1.0","event_id":"sha256:8d350b02a393f5fa7af7435ccd0b781b30a688a92220310bf4242dddb7275181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/bundle.json","state_url":"https://pith.science/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/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-26T06:21:30Z","links":{"resolver":"https://pith.science/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY","bundle":"https://pith.science/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/bundle.json","state":"https://pith.science/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVMCZRVB3QZWKSIMLHPWB3V4DY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KVMCZRVB3QZWKSIMLHPWB3V4DY","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":"bd37c92e7fcffd6015e9cc0bd561e9afe66165a937939377f2372ea9e6061393","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T08:45:41Z","title_canon_sha256":"46d89d0404b89692b2802f9c68acb0f3f17bfd71b3e6b2857f2c0089409edda0"},"schema_version":"1.0","source":{"id":"1405.7498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7498","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7498v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7498","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"KVMCZRVB3QZW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KVMCZRVB3QZWKSIM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KVMCZRVB","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:8d350b02a393f5fa7af7435ccd0b781b30a688a92220310bf4242dddb7275181","target":"graph","created_at":"2026-05-18T02:50:51Z","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":"Let $G$ be a simple graph with vertex set $V(G) = \\{v_1, v_2,\\ldots, v_n\\}$ and edge set $E(G) = \\{e_1, e_2,\\ldots, e_m\\}$. Similar to the Randi\\'c matrix, here we introduce the Randi\\'c incidence matrix of a graph $G$, denoted by $I_R(G)$, which is defined as the $n\\times m$ matrix whose $(i, j)$-entry is $(d_i)^{-\\frac{1}{2}}$ if $v_i$ is incident to $e_j$ and $0$ otherwise. Naturally, the Randi\\'c incidence energy $I_RE$ of $G$ is the sum of the singular values of $I_R(G)$. We establish lower and upper bounds for the Randi\\'c incidence energy. Graphs for which these bounds are best possible","authors_text":"Fei Huang, Ran Gu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T08:45:41Z","title":"Randi\\'c Incidence Energy of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7498","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:e2117e9aac4d8b36cb7a9e3194c947b36fa5d31e2d04f8f89cb89a3ccd50518a","target":"record","created_at":"2026-05-18T02:50:51Z","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":"bd37c92e7fcffd6015e9cc0bd561e9afe66165a937939377f2372ea9e6061393","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T08:45:41Z","title_canon_sha256":"46d89d0404b89692b2802f9c68acb0f3f17bfd71b3e6b2857f2c0089409edda0"},"schema_version":"1.0","source":{"id":"1405.7498","kind":"arxiv","version":1}},"canonical_sha256":"55582cc6a1dc3365490c59df60eebc1e35e35ebc8b48438475fd626587b9d55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55582cc6a1dc3365490c59df60eebc1e35e35ebc8b48438475fd626587b9d55a","first_computed_at":"2026-05-18T02:50:51.114778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.114778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vu7u2kvENEEAQKdeJThDvkTDYRIALjemti2KFZaUN0c+VMKn1Nc2kB+BGmRJpi+avyUNE33ql7JFV7jhYPx1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.115344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2117e9aac4d8b36cb7a9e3194c947b36fa5d31e2d04f8f89cb89a3ccd50518a","sha256:8d350b02a393f5fa7af7435ccd0b781b30a688a92220310bf4242dddb7275181"],"state_sha256":"44630da7a5ff71b4cd58624411c3a06f9dcb318afccd73b2d04fe3e0f911bd12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wPhwCKPdSBa/1UgvqT7zp25YsuliE1loJEwYEgOEIePyiLg9KOaRwdYbdozXH6Di/U3tFF83XtWBPsS9Fre4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:21:30.064040Z","bundle_sha256":"4472adeae2bd2284c33687dee3e478298ba8369fb45d4716c2595541f41caf2d"}}