{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:D5JA2SZDHHIKAWERHXWDUJJHDL","short_pith_number":"pith:D5JA2SZD","canonical_record":{"source":{"id":"1807.02899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-07-08T23:49:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e295ae4f6e33c7103aa8ea99f943d3c73f65ed2f43fd10c9a5aa7f30114f83d4","abstract_canon_sha256":"e9e72eb6506287f88f4a25044b34caa5dd56c1c741901d80e36c56c9b002b898"},"schema_version":"1.0"},"canonical_sha256":"1f520d4b2339d0a058913dec3a25271ae8461ef43cfe1155fce060bdc89996dc","source":{"kind":"arxiv","id":"1807.02899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02899","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02899v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02899","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"D5JA2SZDHHIK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D5JA2SZDHHIKAWER","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D5JA2SZD","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:D5JA2SZDHHIKAWERHXWDUJJHDL","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-07-08T23:49:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e295ae4f6e33c7103aa8ea99f943d3c73f65ed2f43fd10c9a5aa7f30114f83d4","abstract_canon_sha256":"e9e72eb6506287f88f4a25044b34caa5dd56c1c741901d80e36c56c9b002b898"},"schema_version":"1.0"},"canonical_sha256":"1f520d4b2339d0a058913dec3a25271ae8461ef43cfe1155fce060bdc89996dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.397963Z","signature_b64":"nMfk8RX76ka59U9R2cdJTSHTjIXTPDnBGUFBPfGm8Xqs1T0yN8SFl5dh/79qpQJZsT8rSIgyY5Ps+x450zBsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f520d4b2339d0a058913dec3a25271ae8461ef43cfe1155fce060bdc89996dc","last_reissued_at":"2026-05-18T00:11:13.397276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.397276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02899","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:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QifGH22irmR1JQPgqRS5/04p0jYZeNppSMcDR634dgrCQGkgFwvaHsEeWjKBYIrxG0HVWFktn5LaesiQZ2/2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:01:30.772300Z"},"content_sha256":"9f46470cfd1d55a787d08aa9e1ab4649d405cbca5908e5c190995b6ee2062d29","schema_version":"1.0","event_id":"sha256:9f46470cfd1d55a787d08aa9e1ab4649d405cbca5908e5c190995b6ee2062d29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:D5JA2SZDHHIKAWERHXWDUJJHDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for Different Spreads of Line and Total Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.SP","authors_text":"E. Andrade, E. Lenes, E. Mallea, Jonnathan Rodr\\'iguez, M. Robbiano","submitted_at":"2018-07-08T23:49:14Z","abstract_excerpt":"In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \\geq 4$ the spread of $G$ is less than or equal to the spread of its line graph, where the equality holds if and only if $G$ is regular bipartite. A sufficient condition for the spread of the graph not be greater than the signless Laplacian spread for a class of non bipartite and non regular graphs is proved. Additionally, we derive an upper bound for the spread of the line graph of graphs on $n$ vertices h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02899","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:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mN8bsPgisWNtPHbfCl8kjNpbH+W102mgujJvPMxefAOrwEk/wF6JR4y5r/UVi/n1dEUI31PPEUbCOHhNxTtoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:01:30.772942Z"},"content_sha256":"fb8a9aea88555c23d5df3af3920418d7fa9008faa8d1b634f2da80b61606fdbe","schema_version":"1.0","event_id":"sha256:fb8a9aea88555c23d5df3af3920418d7fa9008faa8d1b634f2da80b61606fdbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/bundle.json","state_url":"https://pith.science/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/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-07T05:01:30Z","links":{"resolver":"https://pith.science/pith/D5JA2SZDHHIKAWERHXWDUJJHDL","bundle":"https://pith.science/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/bundle.json","state":"https://pith.science/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5JA2SZDHHIKAWERHXWDUJJHDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:D5JA2SZDHHIKAWERHXWDUJJHDL","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":"e9e72eb6506287f88f4a25044b34caa5dd56c1c741901d80e36c56c9b002b898","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-07-08T23:49:14Z","title_canon_sha256":"e295ae4f6e33c7103aa8ea99f943d3c73f65ed2f43fd10c9a5aa7f30114f83d4"},"schema_version":"1.0","source":{"id":"1807.02899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02899","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02899v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02899","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"D5JA2SZDHHIK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"D5JA2SZDHHIKAWER","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"D5JA2SZD","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:fb8a9aea88555c23d5df3af3920418d7fa9008faa8d1b634f2da80b61606fdbe","target":"graph","created_at":"2026-05-18T00:11:13Z","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":"In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \\geq 4$ the spread of $G$ is less than or equal to the spread of its line graph, where the equality holds if and only if $G$ is regular bipartite. A sufficient condition for the spread of the graph not be greater than the signless Laplacian spread for a class of non bipartite and non regular graphs is proved. Additionally, we derive an upper bound for the spread of the line graph of graphs on $n$ vertices h","authors_text":"E. Andrade, E. Lenes, E. Mallea, Jonnathan Rodr\\'iguez, M. Robbiano","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-07-08T23:49:14Z","title":"Bounds for Different Spreads of Line and Total Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02899","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:9f46470cfd1d55a787d08aa9e1ab4649d405cbca5908e5c190995b6ee2062d29","target":"record","created_at":"2026-05-18T00:11:13Z","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":"e9e72eb6506287f88f4a25044b34caa5dd56c1c741901d80e36c56c9b002b898","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2018-07-08T23:49:14Z","title_canon_sha256":"e295ae4f6e33c7103aa8ea99f943d3c73f65ed2f43fd10c9a5aa7f30114f83d4"},"schema_version":"1.0","source":{"id":"1807.02899","kind":"arxiv","version":1}},"canonical_sha256":"1f520d4b2339d0a058913dec3a25271ae8461ef43cfe1155fce060bdc89996dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f520d4b2339d0a058913dec3a25271ae8461ef43cfe1155fce060bdc89996dc","first_computed_at":"2026-05-18T00:11:13.397276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:13.397276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nMfk8RX76ka59U9R2cdJTSHTjIXTPDnBGUFBPfGm8Xqs1T0yN8SFl5dh/79qpQJZsT8rSIgyY5Ps+x450zBsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:13.397963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f46470cfd1d55a787d08aa9e1ab4649d405cbca5908e5c190995b6ee2062d29","sha256:fb8a9aea88555c23d5df3af3920418d7fa9008faa8d1b634f2da80b61606fdbe"],"state_sha256":"db6f88b2429be9d7a7e7facc5195426fed01f7ecc36a488bfe29ea58edac82bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zchIJFhur7kb2YtPPnQ/A5ANeWRrJfutk2hTCf1kGFaF7arblHYgxfBLPxB/hYRg3an1+EOp3rpTjI6rs5xrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:01:30.776220Z","bundle_sha256":"1261a9aa5987aa0afee9a73fa662999120c944e05e3969c96a8963379523b54b"}}