{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6RBOKJDPCDVRMBYZSHF4QVCAXX","short_pith_number":"pith:6RBOKJDP","canonical_record":{"source":{"id":"1806.04260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-06-11T22:39:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b04c146c311fc4f47602f3d92e15bd80d7814c660cef1505d977347f09c2dfe","abstract_canon_sha256":"6024e8bacf8f8e46dbd43d129e9929d5796c86c3754d4500839d216154c41ff6"},"schema_version":"1.0"},"canonical_sha256":"f442e5246f10eb16071991cbc85440bdf90f2c8cf3e5d9a28ee969802122ba11","source":{"kind":"arxiv","id":"1806.04260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04260","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04260v1","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04260","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"6RBOKJDPCDVR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6RBOKJDPCDVRMBYZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6RBOKJDP","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6RBOKJDPCDVRMBYZSHF4QVCAXX","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-06-11T22:39:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b04c146c311fc4f47602f3d92e15bd80d7814c660cef1505d977347f09c2dfe","abstract_canon_sha256":"6024e8bacf8f8e46dbd43d129e9929d5796c86c3754d4500839d216154c41ff6"},"schema_version":"1.0"},"canonical_sha256":"f442e5246f10eb16071991cbc85440bdf90f2c8cf3e5d9a28ee969802122ba11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.074921Z","signature_b64":"sNhyXQRBq8TFx8tpFbyPkAStti5ht0Aq/J25+WjTy11uFO+OKCEqMZYgQgIG8PL0dz60VrllUFhHhdu7MGrxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f442e5246f10eb16071991cbc85440bdf90f2c8cf3e5d9a28ee969802122ba11","last_reissued_at":"2026-05-18T00:13:36.074368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.074368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04260","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:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pHudduiMkJZBhVag/9XuWdt3n8ZB2LTw8ptfJcxnDpRidlinDUaCrEmKfkf8HfBZK8F8KKWRp/n85MUTMMgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:56:25.738099Z"},"content_sha256":"fb9a007ede15c1e5440b642df2722e57877c740a01efa4e5029d2e334ca33d75","schema_version":"1.0","event_id":"sha256:fb9a007ede15c1e5440b642df2722e57877c740a01efa4e5029d2e334ca33d75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6RBOKJDPCDVRMBYZSHF4QVCAXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the diameter and incidence energy of iterated total graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.SP","authors_text":"Eber Lenes, Exequiel Mallea-Zepeda, Jonnathan Rodr\\'iguez, Mar\\'ia Robbiano","submitted_at":"2018-06-11T22:39:25Z","abstract_excerpt":"The total graph of $G$, $\\mathcal T(G)$ is the graph whose set of vertices is the union of the sets of vertices and edges of $G$, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in $G$. Let $\\mathcal{T}^1(G)=\\mathcal{T}(G)$, the total graph of $G$. For $k\\geq2$, the $k\\text{-}th$ iterated total graph of $G$, $\\mathcal{T}^k(G)$, is defined recursively as $\\mathcal{T}^k(G)=\\mathcal{T}(\\mathcal{T}^{k-1}(G)).$ If $G$ is a connected graph its diameter is the maximum distance between any pair of vertices in $G$. The incidence energy $IE(G)$ of $G$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04260","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:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKc6hPU1mwa50moXhmjuwurFGe73h+HjA5eTOaXV7uTc73DX6Y7cZFdHwUJmEBNJTDyrheSZ7glDKycy1VNaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:56:25.738799Z"},"content_sha256":"7a1fa5340c4847318829f828faeb4ce37fe0072f035c0563f1f76647d56b09c7","schema_version":"1.0","event_id":"sha256:7a1fa5340c4847318829f828faeb4ce37fe0072f035c0563f1f76647d56b09c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/bundle.json","state_url":"https://pith.science/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/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-06T20:56:25Z","links":{"resolver":"https://pith.science/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX","bundle":"https://pith.science/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/bundle.json","state":"https://pith.science/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RBOKJDPCDVRMBYZSHF4QVCAXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6RBOKJDPCDVRMBYZSHF4QVCAXX","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":"6024e8bacf8f8e46dbd43d129e9929d5796c86c3754d4500839d216154c41ff6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-06-11T22:39:25Z","title_canon_sha256":"2b04c146c311fc4f47602f3d92e15bd80d7814c660cef1505d977347f09c2dfe"},"schema_version":"1.0","source":{"id":"1806.04260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04260","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04260v1","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04260","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"6RBOKJDPCDVR","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6RBOKJDPCDVRMBYZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6RBOKJDP","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:7a1fa5340c4847318829f828faeb4ce37fe0072f035c0563f1f76647d56b09c7","target":"graph","created_at":"2026-05-18T00:13:36Z","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":"The total graph of $G$, $\\mathcal T(G)$ is the graph whose set of vertices is the union of the sets of vertices and edges of $G$, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in $G$. Let $\\mathcal{T}^1(G)=\\mathcal{T}(G)$, the total graph of $G$. For $k\\geq2$, the $k\\text{-}th$ iterated total graph of $G$, $\\mathcal{T}^k(G)$, is defined recursively as $\\mathcal{T}^k(G)=\\mathcal{T}(\\mathcal{T}^{k-1}(G)).$ If $G$ is a connected graph its diameter is the maximum distance between any pair of vertices in $G$. The incidence energy $IE(G)$ of $G$ i","authors_text":"Eber Lenes, Exequiel Mallea-Zepeda, Jonnathan Rodr\\'iguez, Mar\\'ia Robbiano","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-06-11T22:39:25Z","title":"On the diameter and incidence energy of iterated total graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04260","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:fb9a007ede15c1e5440b642df2722e57877c740a01efa4e5029d2e334ca33d75","target":"record","created_at":"2026-05-18T00:13:36Z","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":"6024e8bacf8f8e46dbd43d129e9929d5796c86c3754d4500839d216154c41ff6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-06-11T22:39:25Z","title_canon_sha256":"2b04c146c311fc4f47602f3d92e15bd80d7814c660cef1505d977347f09c2dfe"},"schema_version":"1.0","source":{"id":"1806.04260","kind":"arxiv","version":1}},"canonical_sha256":"f442e5246f10eb16071991cbc85440bdf90f2c8cf3e5d9a28ee969802122ba11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f442e5246f10eb16071991cbc85440bdf90f2c8cf3e5d9a28ee969802122ba11","first_computed_at":"2026-05-18T00:13:36.074368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:36.074368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sNhyXQRBq8TFx8tpFbyPkAStti5ht0Aq/J25+WjTy11uFO+OKCEqMZYgQgIG8PL0dz60VrllUFhHhdu7MGrxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:36.074921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9a007ede15c1e5440b642df2722e57877c740a01efa4e5029d2e334ca33d75","sha256:7a1fa5340c4847318829f828faeb4ce37fe0072f035c0563f1f76647d56b09c7"],"state_sha256":"f88a3515d8264d934b4d37306e17f438933b539bb447958b1f647ba0d9a27a6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tl98MEM7L/hcqCLeKYtwWakMFQrocCIvsD36lVQa5zzE7ijI8L3qitBzakq5UzD8jUYvu4vXLhEfV40gRvpIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:56:25.742265Z","bundle_sha256":"7f841d004ee63c8727b96236bbe7d345453533edd7dce3d18bac6d069023d4ee"}}