{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ME6AO36S4IDTY7BF7ENAAY2LDX","short_pith_number":"pith:ME6AO36S","schema_version":"1.0","canonical_sha256":"613c076fd2e2073c7c25f91a00634b1dc6fe0d151352729c7b9fe18168cb7ee7","source":{"kind":"arxiv","id":"2211.06682","version":1},"attestation_state":"computed","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+"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.06682","created_at":"2026-07-05T05:15:27.970485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.06682v1","created_at":"2026-07-05T05:15:27.970485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06682","created_at":"2026-07-05T05:15:27.970485+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME6AO36S4IDT","created_at":"2026-07-05T05:15:27.970485+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME6AO36S4IDTY7BF","created_at":"2026-07-05T05:15:27.970485+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME6AO36S","created_at":"2026-07-05T05:15:27.970485+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX","json":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX.json","graph_json":"https://pith.science/api/pith-number/ME6AO36S4IDTY7BF7ENAAY2LDX/graph.json","events_json":"https://pith.science/api/pith-number/ME6AO36S4IDTY7BF7ENAAY2LDX/events.json","paper":"https://pith.science/paper/ME6AO36S"},"agent_actions":{"view_html":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX","download_json":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX.json","view_paper":"https://pith.science/paper/ME6AO36S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.06682&json=true","fetch_graph":"https://pith.science/api/pith-number/ME6AO36S4IDTY7BF7ENAAY2LDX/graph.json","fetch_events":"https://pith.science/api/pith-number/ME6AO36S4IDTY7BF7ENAAY2LDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/action/storage_attestation","attest_author":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/action/author_attestation","sign_citation":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/action/citation_signature","submit_replication":"https://pith.science/pith/ME6AO36S4IDTY7BF7ENAAY2LDX/action/replication_record"}},"created_at":"2026-07-05T05:15:27.970485+00:00","updated_at":"2026-07-05T05:15:27.970485+00:00"}