{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XGS3Z3IOH5VTAU2DHHQ2KIJ57Z","short_pith_number":"pith:XGS3Z3IO","canonical_record":{"source":{"id":"1203.1158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T10:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"7882aa4cc87bba62fe750a816492f7152675d6607954a6464364bf474e672f2e","abstract_canon_sha256":"44145b0db5738192efceff952734d089bab9274d6f34e264fbc0d62ebd7a529c"},"schema_version":"1.0"},"canonical_sha256":"b9a5bced0e3f6b30534339e1a5213dfe5aa035f9d8acf2a9784cc47c36f37038","source":{"kind":"arxiv","id":"1203.1158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1158","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1158v1","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1158","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"XGS3Z3IOH5VT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XGS3Z3IOH5VTAU2D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XGS3Z3IO","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XGS3Z3IOH5VTAU2DHHQ2KIJ57Z","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T10:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"7882aa4cc87bba62fe750a816492f7152675d6607954a6464364bf474e672f2e","abstract_canon_sha256":"44145b0db5738192efceff952734d089bab9274d6f34e264fbc0d62ebd7a529c"},"schema_version":"1.0"},"canonical_sha256":"b9a5bced0e3f6b30534339e1a5213dfe5aa035f9d8acf2a9784cc47c36f37038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:40.202831Z","signature_b64":"3EOXp3iP4Gs00IGRSAuJnqmc2gACpbOXZ4gtkzD46z+JNzVkVdBQt2CGbTMf2BXl+8T5DvW1zbrtsYVTBWMQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a5bced0e3f6b30534339e1a5213dfe5aa035f9d8acf2a9784cc47c36f37038","last_reissued_at":"2026-05-18T04:00:40.202103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:40.202103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1158","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-18T04:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MellTpiJNHOWsCoR6CjDnOov03Glb5fX+e5f9LzZtgS4v2/KD6shlS6l6eNeDNotltIG9Vv4HaDSQ9YfloiuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:48:16.878676Z"},"content_sha256":"614fe808f94a3f99d38b35fb7876055fad370f72988dfa70025a1cbbc025ff09","schema_version":"1.0","event_id":"sha256:614fe808f94a3f99d38b35fb7876055fad370f72988dfa70025a1cbbc025ff09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XGS3Z3IOH5VTAU2DHHQ2KIJ57Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On homometric sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lale \\\"Ozkahya, Maria Axenovich","submitted_at":"2012-03-06T10:27:54Z","abstract_excerpt":"For a vertex set $S\\subseteq V(G)$ in a graph $G$, the {\\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\\em homometric} if their distance multisets are identical. For a graph $G$, the largest integer $h$, such that there are two disjoint homometric sets of order $h$ in $G$, is denoted by $h(G)$. We slightly improve the general bound on this parameter introduced by Albertson, Pach and Young (2010) and investigate it in more detail for trees and graphs of bounded diameter. In particular, we show that for any tree $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1158","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-18T04:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08zaJ1GT2pbiE636FvVUgkvj5v1SJ9fwdqovaSK2LTt4ZPwf+6+bALcVu9Pa9SRenq/Bt7q3fc17dlinG26nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:48:16.879253Z"},"content_sha256":"a21300709eb6d468d0871ae24f1874c738b0107d062c59ab22119b4aedb665dc","schema_version":"1.0","event_id":"sha256:a21300709eb6d468d0871ae24f1874c738b0107d062c59ab22119b4aedb665dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/bundle.json","state_url":"https://pith.science/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/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-24T15:48:16Z","links":{"resolver":"https://pith.science/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z","bundle":"https://pith.science/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/bundle.json","state":"https://pith.science/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGS3Z3IOH5VTAU2DHHQ2KIJ57Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XGS3Z3IOH5VTAU2DHHQ2KIJ57Z","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":"44145b0db5738192efceff952734d089bab9274d6f34e264fbc0d62ebd7a529c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T10:27:54Z","title_canon_sha256":"7882aa4cc87bba62fe750a816492f7152675d6607954a6464364bf474e672f2e"},"schema_version":"1.0","source":{"id":"1203.1158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1158","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1158v1","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1158","created_at":"2026-05-18T04:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"XGS3Z3IOH5VT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XGS3Z3IOH5VTAU2D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XGS3Z3IO","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a21300709eb6d468d0871ae24f1874c738b0107d062c59ab22119b4aedb665dc","target":"graph","created_at":"2026-05-18T04:00:40Z","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":"For a vertex set $S\\subseteq V(G)$ in a graph $G$, the {\\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\\em homometric} if their distance multisets are identical. For a graph $G$, the largest integer $h$, such that there are two disjoint homometric sets of order $h$ in $G$, is denoted by $h(G)$. We slightly improve the general bound on this parameter introduced by Albertson, Pach and Young (2010) and investigate it in more detail for trees and graphs of bounded diameter. In particular, we show that for any tree $","authors_text":"Lale \\\"Ozkahya, Maria Axenovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T10:27:54Z","title":"On homometric sets in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1158","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:614fe808f94a3f99d38b35fb7876055fad370f72988dfa70025a1cbbc025ff09","target":"record","created_at":"2026-05-18T04:00:40Z","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":"44145b0db5738192efceff952734d089bab9274d6f34e264fbc0d62ebd7a529c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-06T10:27:54Z","title_canon_sha256":"7882aa4cc87bba62fe750a816492f7152675d6607954a6464364bf474e672f2e"},"schema_version":"1.0","source":{"id":"1203.1158","kind":"arxiv","version":1}},"canonical_sha256":"b9a5bced0e3f6b30534339e1a5213dfe5aa035f9d8acf2a9784cc47c36f37038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a5bced0e3f6b30534339e1a5213dfe5aa035f9d8acf2a9784cc47c36f37038","first_computed_at":"2026-05-18T04:00:40.202103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:40.202103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3EOXp3iP4Gs00IGRSAuJnqmc2gACpbOXZ4gtkzD46z+JNzVkVdBQt2CGbTMf2BXl+8T5DvW1zbrtsYVTBWMQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:40.202831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:614fe808f94a3f99d38b35fb7876055fad370f72988dfa70025a1cbbc025ff09","sha256:a21300709eb6d468d0871ae24f1874c738b0107d062c59ab22119b4aedb665dc"],"state_sha256":"2b2731c5402fe52700b0ef4e2a9654f8b4adbe7292da531804469f7cd8690e0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKxvp7u3e6H3DX7bpfyfaVijRG2msgGCmTvcq2q319oT22HvqrnhmyiJQIIH/79Nm/BmYKSCZV7A6OA5HWaUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:48:16.882603Z","bundle_sha256":"5bc526f7218bf4d93c2bb13b1680fbd4947a6e5b6f1e87386f8e2bd9c5a04ab5"}}