{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FG7TL7AXM5LSLHXLWI6T4T3MTE","short_pith_number":"pith:FG7TL7AX","schema_version":"1.0","canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","source":{"kind":"arxiv","id":"2603.28748","version":2},"attestation_state":"computed","paper":{"title":"Odd Hadwiger number and graph products","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, Daniel A. Quiroz, Henry Echeverr\\'ia, Mauricio Y\\'epez, Suchismita Mishra","submitted_at":"2026-03-30T17:53:34Z","abstract_excerpt":"The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwiger number of the product of two graphs, when considering any of the four standard graph products: Cartesian, direct, lexicographic, strong. We provide an optimal lower bound in the cases of the strong and lexicographic products."},"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":"2603.28748","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-30T17:53:34Z","cross_cats_sorted":[],"title_canon_sha256":"d2ab43357e67ed34f5ce8bf50b9b569c518dff8bd357873fc617c05d7a9f7994","abstract_canon_sha256":"961dd152edbb5419f29c7f7a9d34ca4357b4f7b32d4b1b6d01bf96ab5267ef0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:07.795022Z","signature_b64":"syf1Dy3sTmOX+UB5OWGNy8Ik/X463uA9fBDbd3nXkOigrSjUMqc/5lgcXGk9uxV58m0O3r1qW0H1sO4hFEvaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","last_reissued_at":"2026-07-02T01:18:07.794577Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:07.794577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd Hadwiger number and graph products","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Jim\\'enez, Daniel A. Quiroz, Henry Echeverr\\'ia, Mauricio Y\\'epez, Suchismita Mishra","submitted_at":"2026-03-30T17:53:34Z","abstract_excerpt":"The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwiger number of the product of two graphs, when considering any of the four standard graph products: Cartesian, direct, lexicographic, strong. We provide an optimal lower bound in the cases of the strong and lexicographic products."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.28748","kind":"arxiv","version":2},"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/2603.28748/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":"2603.28748","created_at":"2026-07-02T01:18:07.794634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.28748v2","created_at":"2026-07-02T01:18:07.794634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28748","created_at":"2026-07-02T01:18:07.794634+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG7TL7AXM5LS","created_at":"2026-07-02T01:18:07.794634+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG7TL7AXM5LSLHXL","created_at":"2026-07-02T01:18:07.794634+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG7TL7AX","created_at":"2026-07-02T01:18:07.794634+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/FG7TL7AXM5LSLHXLWI6T4T3MTE","json":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE.json","graph_json":"https://pith.science/api/pith-number/FG7TL7AXM5LSLHXLWI6T4T3MTE/graph.json","events_json":"https://pith.science/api/pith-number/FG7TL7AXM5LSLHXLWI6T4T3MTE/events.json","paper":"https://pith.science/paper/FG7TL7AX"},"agent_actions":{"view_html":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE","download_json":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE.json","view_paper":"https://pith.science/paper/FG7TL7AX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.28748&json=true","fetch_graph":"https://pith.science/api/pith-number/FG7TL7AXM5LSLHXLWI6T4T3MTE/graph.json","fetch_events":"https://pith.science/api/pith-number/FG7TL7AXM5LSLHXLWI6T4T3MTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/action/storage_attestation","attest_author":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/action/author_attestation","sign_citation":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/action/citation_signature","submit_replication":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/action/replication_record"}},"created_at":"2026-07-02T01:18:07.794634+00:00","updated_at":"2026-07-02T01:18:07.794634+00:00"}