{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3V6RLTCY2WMJ73D5QYCYJJ6OPA","short_pith_number":"pith:3V6RLTCY","canonical_record":{"source":{"id":"1507.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"1ba8ced1691f602f3139141e0116c39de3ade7a3cd2136d667067ec702bfa462","abstract_canon_sha256":"a8c003e1f76c02df135b5955a587f3389dbfd2e54f8c4a5044da9ba7c4061a68"},"schema_version":"1.0"},"canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","source":{"kind":"arxiv","id":"1507.07083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07083","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07083v1","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07083","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"3V6RLTCY2WMJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3V6RLTCY2WMJ73D5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3V6RLTCY","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3V6RLTCY2WMJ73D5QYCYJJ6OPA","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"1ba8ced1691f602f3139141e0116c39de3ade7a3cd2136d667067ec702bfa462","abstract_canon_sha256":"a8c003e1f76c02df135b5955a587f3389dbfd2e54f8c4a5044da9ba7c4061a68"},"schema_version":"1.0"},"canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:17.259910Z","signature_b64":"60e9gdmdlFUecFHRDbeDuvnEauKGHxxBM44Oxm3WpPYy22taZGGYBGAmzIS6bQpCqfz+92aVj3Pa5P4AjKU2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","last_reissued_at":"2026-05-18T01:36:17.259305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:17.259305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07083","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-18T01:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7o3AIeji4UA/reZW7YzCMr3FVnN+QcfhC73IplCCbsn0Vq8KLpSwRzJ3eQS4jYHu4ifsdFQrj/kYuB5KzcgqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:41:31.169576Z"},"content_sha256":"a6b57e0c7931098de733c437a780cd2bd43671a022e7718dd2cbadde1c1ec96a","schema_version":"1.0","event_id":"sha256:a6b57e0c7931098de733c437a780cd2bd43671a022e7718dd2cbadde1c1ec96a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3V6RLTCY2WMJ73D5QYCYJJ6OPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Remoteness and distance eigenvalues of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Huiqiu Lin, Kinkar Ch. Das","submitted_at":"2015-07-25T09:17:29Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\\rho$ of $G$ is the maximum average distance from a vertex to all others and $\\partial_1\\geq\\cdots\\geq \\partial_n$ are the distance eigenvalues of $G$. In \\cite{AH}, Aouchiche and Hansen conjectured that $\\rho+\\partial_3>0$ when $d\\geq 3$ and $\\rho+\\partial_{\\lfloor\\frac{7d}{8}\\rfloor}>0.$ In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on $\\partial_n+\\rho$ and $\\partial_1-\\rho$ when $G\\ncong K_n$ and the extremal graphs are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07083","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-18T01:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBskLeswGaVi7d4TWTjngt5yfzXTZtk+Td0OIPjFsz/SxWXyp8tbkoy4ZZSd24juqvWOXBNqXw2Ev+EeHLbgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:41:31.169917Z"},"content_sha256":"e1d32937cf92f5768dde0843a4d81d47143e3358b3022bcbc6fcf4a11372c2da","schema_version":"1.0","event_id":"sha256:e1d32937cf92f5768dde0843a4d81d47143e3358b3022bcbc6fcf4a11372c2da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/bundle.json","state_url":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/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-02T21:41:31Z","links":{"resolver":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA","bundle":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/bundle.json","state":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3V6RLTCY2WMJ73D5QYCYJJ6OPA","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":"a8c003e1f76c02df135b5955a587f3389dbfd2e54f8c4a5044da9ba7c4061a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","title_canon_sha256":"1ba8ced1691f602f3139141e0116c39de3ade7a3cd2136d667067ec702bfa462"},"schema_version":"1.0","source":{"id":"1507.07083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07083","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07083v1","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07083","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"3V6RLTCY2WMJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3V6RLTCY2WMJ73D5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3V6RLTCY","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:e1d32937cf92f5768dde0843a4d81d47143e3358b3022bcbc6fcf4a11372c2da","target":"graph","created_at":"2026-05-18T01:36:17Z","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 connected graph of order $n$ with diameter $d$. Remoteness $\\rho$ of $G$ is the maximum average distance from a vertex to all others and $\\partial_1\\geq\\cdots\\geq \\partial_n$ are the distance eigenvalues of $G$. In \\cite{AH}, Aouchiche and Hansen conjectured that $\\rho+\\partial_3>0$ when $d\\geq 3$ and $\\rho+\\partial_{\\lfloor\\frac{7d}{8}\\rfloor}>0.$ In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on $\\partial_n+\\rho$ and $\\partial_1-\\rho$ when $G\\ncong K_n$ and the extremal graphs are characterized.","authors_text":"Baoyindureng Wu, Huiqiu Lin, Kinkar Ch. Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","title":"Remoteness and distance eigenvalues of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07083","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:a6b57e0c7931098de733c437a780cd2bd43671a022e7718dd2cbadde1c1ec96a","target":"record","created_at":"2026-05-18T01:36:17Z","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":"a8c003e1f76c02df135b5955a587f3389dbfd2e54f8c4a5044da9ba7c4061a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","title_canon_sha256":"1ba8ced1691f602f3139141e0116c39de3ade7a3cd2136d667067ec702bfa462"},"schema_version":"1.0","source":{"id":"1507.07083","kind":"arxiv","version":1}},"canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","first_computed_at":"2026-05-18T01:36:17.259305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:17.259305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60e9gdmdlFUecFHRDbeDuvnEauKGHxxBM44Oxm3WpPYy22taZGGYBGAmzIS6bQpCqfz+92aVj3Pa5P4AjKU2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:17.259910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6b57e0c7931098de733c437a780cd2bd43671a022e7718dd2cbadde1c1ec96a","sha256:e1d32937cf92f5768dde0843a4d81d47143e3358b3022bcbc6fcf4a11372c2da"],"state_sha256":"44a31352095672eec279fe22c9fbbb6fe4896ece6a7b74c11dddb578205d4c60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0c3yVwrFLWqk8f3B+eueyVCQM4RmYhivFOqROQEuYv0Sn+ehXF220Dxdgc/99I6pekaYNtw4CKWgFjEGIwtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:41:31.171847Z","bundle_sha256":"667678c7f2d4b7287a9584cb2a5b011ad68355805a0174a85fcb805ee7cae80d"}}