{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TRXIKAEF3PECPVSHN4TDYHH7KX","short_pith_number":"pith:TRXIKAEF","canonical_record":{"source":{"id":"1608.02055","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T02:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"f3e637537dcf6d95c183341c08bcad981dc2113f8308faa5b8f6da8bbb0e0d2d","abstract_canon_sha256":"ff2b810a22095a8a9a4c27db07f3358c490644dd49179b77567819f9fd74a3ff"},"schema_version":"1.0"},"canonical_sha256":"9c6e850085dbc827d6476f263c1cff55e63c1f312e0191f1db98e1d31ff82e29","source":{"kind":"arxiv","id":"1608.02055","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02055","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02055v2","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02055","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"TRXIKAEF3PEC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRXIKAEF3PECPVSH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRXIKAEF","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TRXIKAEF3PECPVSHN4TDYHH7KX","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02055","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T02:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"f3e637537dcf6d95c183341c08bcad981dc2113f8308faa5b8f6da8bbb0e0d2d","abstract_canon_sha256":"ff2b810a22095a8a9a4c27db07f3358c490644dd49179b77567819f9fd74a3ff"},"schema_version":"1.0"},"canonical_sha256":"9c6e850085dbc827d6476f263c1cff55e63c1f312e0191f1db98e1d31ff82e29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:32.327993Z","signature_b64":"csJwx25QUAvasCK0r9xwjb5mWcN7rrx7mUh3g+1YVXXyk5fj2AqCGnNrS3hOhNLcaZrxgQxUI+iJQuufymDGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6e850085dbc827d6476f263c1cff55e63c1f312e0191f1db98e1d31ff82e29","last_reissued_at":"2026-05-18T01:03:32.327502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:32.327502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02055","source_version":2,"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-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSDWeg1iTlSzHXr48fufEMuMUPSDCglUmUJOTjaav4JE7mqin2K7mbpR14teeLUoAD8bjUs4BniD+QKJcIUKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:03:32.725682Z"},"content_sha256":"191a6f7487ba51d71d02547e7b0fe3fe2a0dd6590e7b645504d374ff5bf03b66","schema_version":"1.0","event_id":"sha256:191a6f7487ba51d71d02547e7b0fe3fe2a0dd6590e7b645504d374ff5bf03b66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TRXIKAEF3PECPVSHN4TDYHH7KX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized 3-(edge) connectivity of total graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yinkui Li","submitted_at":"2016-08-06T02:18:37Z","abstract_excerpt":"The generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a natural generalization of the concept of connectivity $\\kappa(G)$, which is just for $k=2$. Total graph is generalized line graph and a large graph which obtained by incidence relation between vertices and edges of original graph. T. Hamada and T. Nonaka et al., in \\cite{Hamada} determined the connectivity of the total graph $T(G)$ for a graph $G$. In this paper we determine the generalized $k$-(edge)-connectivity of total graph $T(G)$ for $k=3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02055","kind":"arxiv","version":2},"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-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDSTFbihuFOr45SOWULV+57EFm4EQNmxncNQP6hsrpqZxqjJHGyhS1tx6cyvOzxlsBXChRe+dNbgfZpjlho3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:03:32.726097Z"},"content_sha256":"5de37604e75371ca5c4ab93146b85600936efc56c1acf6b48713087e0589a2be","schema_version":"1.0","event_id":"sha256:5de37604e75371ca5c4ab93146b85600936efc56c1acf6b48713087e0589a2be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/bundle.json","state_url":"https://pith.science/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/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-26T11:03:32Z","links":{"resolver":"https://pith.science/pith/TRXIKAEF3PECPVSHN4TDYHH7KX","bundle":"https://pith.science/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/bundle.json","state":"https://pith.science/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRXIKAEF3PECPVSHN4TDYHH7KX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TRXIKAEF3PECPVSHN4TDYHH7KX","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":"ff2b810a22095a8a9a4c27db07f3358c490644dd49179b77567819f9fd74a3ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T02:18:37Z","title_canon_sha256":"f3e637537dcf6d95c183341c08bcad981dc2113f8308faa5b8f6da8bbb0e0d2d"},"schema_version":"1.0","source":{"id":"1608.02055","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02055","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02055v2","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02055","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"TRXIKAEF3PEC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRXIKAEF3PECPVSH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRXIKAEF","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5de37604e75371ca5c4ab93146b85600936efc56c1acf6b48713087e0589a2be","target":"graph","created_at":"2026-05-18T01:03:32Z","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 generalized $k$-connectivity $\\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a natural generalization of the concept of connectivity $\\kappa(G)$, which is just for $k=2$. Total graph is generalized line graph and a large graph which obtained by incidence relation between vertices and edges of original graph. T. Hamada and T. Nonaka et al., in \\cite{Hamada} determined the connectivity of the total graph $T(G)$ for a graph $G$. In this paper we determine the generalized $k$-(edge)-connectivity of total graph $T(G)$ for $k=3$.","authors_text":"Yinkui Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T02:18:37Z","title":"The generalized 3-(edge) connectivity of total graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02055","kind":"arxiv","version":2},"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:191a6f7487ba51d71d02547e7b0fe3fe2a0dd6590e7b645504d374ff5bf03b66","target":"record","created_at":"2026-05-18T01:03:32Z","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":"ff2b810a22095a8a9a4c27db07f3358c490644dd49179b77567819f9fd74a3ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T02:18:37Z","title_canon_sha256":"f3e637537dcf6d95c183341c08bcad981dc2113f8308faa5b8f6da8bbb0e0d2d"},"schema_version":"1.0","source":{"id":"1608.02055","kind":"arxiv","version":2}},"canonical_sha256":"9c6e850085dbc827d6476f263c1cff55e63c1f312e0191f1db98e1d31ff82e29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6e850085dbc827d6476f263c1cff55e63c1f312e0191f1db98e1d31ff82e29","first_computed_at":"2026-05-18T01:03:32.327502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:32.327502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"csJwx25QUAvasCK0r9xwjb5mWcN7rrx7mUh3g+1YVXXyk5fj2AqCGnNrS3hOhNLcaZrxgQxUI+iJQuufymDGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:32.327993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02055","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:191a6f7487ba51d71d02547e7b0fe3fe2a0dd6590e7b645504d374ff5bf03b66","sha256:5de37604e75371ca5c4ab93146b85600936efc56c1acf6b48713087e0589a2be"],"state_sha256":"70eaa4d63a49d85977fb8545f4c3d11e60983775d4586c83332348b7daf201ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPQyaUt08SyZePBMOifr9NXEcrbTINUtC0MItreyiLcit86X1AevmrP33b+GxZcn4EGJhc9okik7M7h2yA0iDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:03:32.728805Z","bundle_sha256":"8b14668df342456c533f6dedd601a84c6bc6611ee0e88e44938bf6f9755d87d7"}}