{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ME6AO36S4IDTY7BF7ENAAY2LDX","short_pith_number":"pith:ME6AO36S","canonical_record":{"source":{"id":"2211.06682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-12T15:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"6dae080d5ebf4b98dde833b18ec4ebcb947fbe29e60c22332b8e93d6980e60f0","abstract_canon_sha256":"0d92a1d6d0ecb9cd6ddc7fc4bb1dd6d3a4ed47246cfec550d4f0260bcf945be5"},"schema_version":"1.0"},"canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","source":{"kind":"arxiv","id":"2211.06682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06682","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06682v1","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06682","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"ME6AO36S4IDT","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_16","alias_value":"ME6AO36S4IDTY7BF","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_8","alias_value":"ME6AO36S","created_at":"2026-07-05T05:15:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ME6AO36S4IDTY7BF7ENAAY2LDX","target":"record","payload":{"canonical_record":{"source":{"id":"2211.06682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-12T15:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"6dae080d5ebf4b98dde833b18ec4ebcb947fbe29e60c22332b8e93d6980e60f0","abstract_canon_sha256":"0d92a1d6d0ecb9cd6ddc7fc4bb1dd6d3a4ed47246cfec550d4f0260bcf945be5"},"schema_version":"1.0"},"canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:27.970903Z","signature_b64":"0wKCzQqsEmuvIR2tn/QClHDTv/zfzu588AKjz+J4YE/kEWzC8g7Q5Jfhw1xk4P6yLWKMLyapfct4Ojeto0srAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","last_reissued_at":"2026-07-05T05:15:27.970426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:27.970426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.06682","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-07-05T05:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg/OykPIsZtnc/JVFdlLsfEnYFnOqvEO7ft0uqKZVtsDSZNszNJB0YxxjNAWzFU8O+Ux7abaERtmpVUi2GiIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:22:08.825409Z"},"content_sha256":"15cbb13870ef5c8032e95e1e41e37dc4849f6c37965e977c48bea6739d97160c","schema_version":"1.0","event_id":"sha256:15cbb13870ef5c8032e95e1e41e37dc4849f6c37965e977c48bea6739d97160c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ME6AO36S4IDTY7BF7ENAAY2LDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the Mostar index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Florian Werner, Johannes Pardey, \\v{S}tefko Miklavi\\v{c}","submitted_at":"2022-11-12T15:01:16Z","abstract_excerpt":"Do\\v{s}li\\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\\sum\\limits_{uv\\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$. They conjectured that $Mo(G)\\leq 0.\\overline{148}n^3$ for every graph $G$ of order $n$. As a natural upper bound on the Mostar index, Geneson and Tsai implicitly consider the parameter $Mo^\\star(G)=\\sum\\limits_{uv\\in E(G)}\\big(n-\\min\\{ d_G(u),d_G(v)\\}\\big)$. For a graph $G$ of order $n$, they show that $Mo^\\star(G)\\leq \\frac{5}{24}(1+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06682","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.06682/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwaVPifEo8DHVdkTU1IvhO3A98Q0zBW8yNltEk8HcD0gRHcV9k0ay7WTnU3jYFhHKpZPy1DQhyxzDhLKa4LoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:22:08.825782Z"},"content_sha256":"6562db330dc272c8f657fef723a10c8a337d114344e9f4167fafbb3a7e89aeeb","schema_version":"1.0","event_id":"sha256:6562db330dc272c8f657fef723a10c8a337d114344e9f4167fafbb3a7e89aeeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/bundle.json","state_url":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/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-07-07T08:22:08Z","links":{"resolver":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX","bundle":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/bundle.json","state":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ME6AO36S4IDTY7BF7ENAAY2LDX","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":"0d92a1d6d0ecb9cd6ddc7fc4bb1dd6d3a4ed47246cfec550d4f0260bcf945be5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-12T15:01:16Z","title_canon_sha256":"6dae080d5ebf4b98dde833b18ec4ebcb947fbe29e60c22332b8e93d6980e60f0"},"schema_version":"1.0","source":{"id":"2211.06682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.06682","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"2211.06682v1","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06682","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"ME6AO36S4IDT","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_16","alias_value":"ME6AO36S4IDTY7BF","created_at":"2026-07-05T05:15:27Z"},{"alias_kind":"pith_short_8","alias_value":"ME6AO36S","created_at":"2026-07-05T05:15:27Z"}],"graph_snapshots":[{"event_id":"sha256:6562db330dc272c8f657fef723a10c8a337d114344e9f4167fafbb3a7e89aeeb","target":"graph","created_at":"2026-07-05T05:15:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.06682/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Do\\v{s}li\\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\\sum\\limits_{uv\\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$. They conjectured that $Mo(G)\\leq 0.\\overline{148}n^3$ for every graph $G$ of order $n$. As a natural upper bound on the Mostar index, Geneson and Tsai implicitly consider the parameter $Mo^\\star(G)=\\sum\\limits_{uv\\in E(G)}\\big(n-\\min\\{ d_G(u),d_G(v)\\}\\big)$. For a graph $G$ of order $n$, they show that $Mo^\\star(G)\\leq \\frac{5}{24}(1+","authors_text":"Dieter Rautenbach, Florian Werner, Johannes Pardey, \\v{S}tefko Miklavi\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-12T15:01:16Z","title":"Bounding the Mostar index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06682","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:15cbb13870ef5c8032e95e1e41e37dc4849f6c37965e977c48bea6739d97160c","target":"record","created_at":"2026-07-05T05:15:27Z","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":"0d92a1d6d0ecb9cd6ddc7fc4bb1dd6d3a4ed47246cfec550d4f0260bcf945be5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-12T15:01:16Z","title_canon_sha256":"6dae080d5ebf4b98dde833b18ec4ebcb947fbe29e60c22332b8e93d6980e60f0"},"schema_version":"1.0","source":{"id":"2211.06682","kind":"arxiv","version":1}},"canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","first_computed_at":"2026-07-05T05:15:27.970426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:15:27.970426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0wKCzQqsEmuvIR2tn/QClHDTv/zfzu588AKjz+J4YE/kEWzC8g7Q5Jfhw1xk4P6yLWKMLyapfct4Ojeto0srAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:15:27.970903Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.06682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15cbb13870ef5c8032e95e1e41e37dc4849f6c37965e977c48bea6739d97160c","sha256:6562db330dc272c8f657fef723a10c8a337d114344e9f4167fafbb3a7e89aeeb"],"state_sha256":"0fb182787e7a3accc2d6e05e1fe4587890d4f3f0b86411c53d8939570828625c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMcHFmdfuiAAze1kx1Ur0nqpElQ4BO+O9lUfy2UmYAORFh4ZxV2K3uNgSvf8EhlQGUWu4Bh+e82XCrpoFk6KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:22:08.827702Z","bundle_sha256":"fdb227ec021bd1cedb578e21415d9017eee22b4cb2a7e43af228467e68889a0a"}}