{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SBBD3KLHUH42VEORUONGDYVL5N","short_pith_number":"pith:SBBD3KLH","canonical_record":{"source":{"id":"1901.09547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T08:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"5a8957f4d79bb22b217394dd81ae228df6690a6d8ba9accb84232ba13f52b477","abstract_canon_sha256":"ae66400717bf23365bdb2a76f5786f51a8a280e2f5e8b548317c900fa3a0f2bd"},"schema_version":"1.0"},"canonical_sha256":"90423da967a1f9aa91d1a39a61e2abeb6921f48bdd858517a0e20f18a847a14f","source":{"kind":"arxiv","id":"1901.09547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09547","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09547v1","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09547","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"SBBD3KLHUH42","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SBBD3KLHUH42VEOR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SBBD3KLH","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SBBD3KLHUH42VEORUONGDYVL5N","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T08:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"5a8957f4d79bb22b217394dd81ae228df6690a6d8ba9accb84232ba13f52b477","abstract_canon_sha256":"ae66400717bf23365bdb2a76f5786f51a8a280e2f5e8b548317c900fa3a0f2bd"},"schema_version":"1.0"},"canonical_sha256":"90423da967a1f9aa91d1a39a61e2abeb6921f48bdd858517a0e20f18a847a14f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:24.535829Z","signature_b64":"9GIPSIm3SuTVHgMYfh2R0L2PmiOipg0J6s/3YcUIfdEAb6Fuuf7eZ702aAN600bXLnwsY3nC2HsoThAm1Z2bBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90423da967a1f9aa91d1a39a61e2abeb6921f48bdd858517a0e20f18a847a14f","last_reissued_at":"2026-05-17T23:55:24.535341Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:24.535341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09547","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-17T23:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBzwqdNGFO8e040T7gqfz294M1N5DFqZXTmgWeLl2E7XsjII3i3S2kjc3jrnqXQv88pRu7Laeg81asOg22ZsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:46:10.277216Z"},"content_sha256":"78b3b0157b29154be6fe6fd4dfc417e66c34187755bb88392b2a10a53e890bdf","schema_version":"1.0","event_id":"sha256:78b3b0157b29154be6fe6fd4dfc417e66c34187755bb88392b2a10a53e890bdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SBBD3KLHUH42VEORUONGDYVL5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pairs of a tree and a nontree graph with the same status sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2019-01-28T08:29:24Z","abstract_excerpt":"The status of a vertex $x$ in a graph is the sum of the distances between $x$ and all other vertices. Let $G$ be a connected graph. The status sequence of $G$ is the list of the statuses of all vertices arranged in nondecreasing order. $G$ is called status injective if all the statuses of its vertices are distinct. Let $G$ be a member of a family of graphs $\\mathscr{F}$ and let the status sequence of $G$ be $s.$ $G$ is said to be status unique in $\\mathscr{F}$ if $G$ is the unique graph in $\\mathscr{F}$ whose status sequence is $s.$ In 2011, J.L. Shang and C. Lin posed the following two conjec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09547","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-17T23:55:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2wF1CpOl22JH2dB3FIeWwpOF+PKKpkHIDyIL/K5QWG0QCB/dys+ljakwpRw+IhwtHT+Nl9u/lDdYZxFcbXcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:46:10.277574Z"},"content_sha256":"a27618f2b4fb66f90514ee9e6d20e2f4d710ab128ddfb1ac500a0d8b87fcc5ff","schema_version":"1.0","event_id":"sha256:a27618f2b4fb66f90514ee9e6d20e2f4d710ab128ddfb1ac500a0d8b87fcc5ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBBD3KLHUH42VEORUONGDYVL5N/bundle.json","state_url":"https://pith.science/pith/SBBD3KLHUH42VEORUONGDYVL5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBBD3KLHUH42VEORUONGDYVL5N/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-25T23:46:10Z","links":{"resolver":"https://pith.science/pith/SBBD3KLHUH42VEORUONGDYVL5N","bundle":"https://pith.science/pith/SBBD3KLHUH42VEORUONGDYVL5N/bundle.json","state":"https://pith.science/pith/SBBD3KLHUH42VEORUONGDYVL5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBBD3KLHUH42VEORUONGDYVL5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SBBD3KLHUH42VEORUONGDYVL5N","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":"ae66400717bf23365bdb2a76f5786f51a8a280e2f5e8b548317c900fa3a0f2bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T08:29:24Z","title_canon_sha256":"5a8957f4d79bb22b217394dd81ae228df6690a6d8ba9accb84232ba13f52b477"},"schema_version":"1.0","source":{"id":"1901.09547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09547","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09547v1","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09547","created_at":"2026-05-17T23:55:24Z"},{"alias_kind":"pith_short_12","alias_value":"SBBD3KLHUH42","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SBBD3KLHUH42VEOR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SBBD3KLH","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a27618f2b4fb66f90514ee9e6d20e2f4d710ab128ddfb1ac500a0d8b87fcc5ff","target":"graph","created_at":"2026-05-17T23:55:24Z","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 status of a vertex $x$ in a graph is the sum of the distances between $x$ and all other vertices. Let $G$ be a connected graph. The status sequence of $G$ is the list of the statuses of all vertices arranged in nondecreasing order. $G$ is called status injective if all the statuses of its vertices are distinct. Let $G$ be a member of a family of graphs $\\mathscr{F}$ and let the status sequence of $G$ be $s.$ $G$ is said to be status unique in $\\mathscr{F}$ if $G$ is the unique graph in $\\mathscr{F}$ whose status sequence is $s.$ In 2011, J.L. Shang and C. Lin posed the following two conjec","authors_text":"Pu Qiao, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T08:29:24Z","title":"Pairs of a tree and a nontree graph with the same status sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09547","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:78b3b0157b29154be6fe6fd4dfc417e66c34187755bb88392b2a10a53e890bdf","target":"record","created_at":"2026-05-17T23:55:24Z","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":"ae66400717bf23365bdb2a76f5786f51a8a280e2f5e8b548317c900fa3a0f2bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T08:29:24Z","title_canon_sha256":"5a8957f4d79bb22b217394dd81ae228df6690a6d8ba9accb84232ba13f52b477"},"schema_version":"1.0","source":{"id":"1901.09547","kind":"arxiv","version":1}},"canonical_sha256":"90423da967a1f9aa91d1a39a61e2abeb6921f48bdd858517a0e20f18a847a14f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90423da967a1f9aa91d1a39a61e2abeb6921f48bdd858517a0e20f18a847a14f","first_computed_at":"2026-05-17T23:55:24.535341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:24.535341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9GIPSIm3SuTVHgMYfh2R0L2PmiOipg0J6s/3YcUIfdEAb6Fuuf7eZ702aAN600bXLnwsY3nC2HsoThAm1Z2bBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:24.535829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b3b0157b29154be6fe6fd4dfc417e66c34187755bb88392b2a10a53e890bdf","sha256:a27618f2b4fb66f90514ee9e6d20e2f4d710ab128ddfb1ac500a0d8b87fcc5ff"],"state_sha256":"84bc6786bb6b5e6ca715d0483d12778beba0f57dc37b3c651a082d9fd5ac37b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+B/sQpHA3clR0zJiAGhixX5AppQBiWB84ayPU6712UhNdpZLsnp6z59zCe9otkjDjqBXfqIsxV7eotsD2atDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:46:10.279635Z","bundle_sha256":"b3afdc0ef5c0be1031fdaaf256e380e602cc10fa7a9a02686db7c771db5cafd4"}}