{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FG7TL7AXM5LSLHXLWI6T4T3MTE","short_pith_number":"pith:FG7TL7AX","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"},"canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","source":{"kind":"arxiv","id":"2603.28748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.28748","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"2603.28748v2","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28748","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"FG7TL7AXM5LS","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_16","alias_value":"FG7TL7AXM5LSLHXL","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_8","alias_value":"FG7TL7AX","created_at":"2026-07-02T01:18:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FG7TL7AXM5LSLHXLWI6T4T3MTE","target":"record","payload":{"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"},"canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","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"},"source_kind":"arxiv","source_id":"2603.28748","source_version":2,"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-02T01:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1lA533PGkElUX7+9alL4g/TMrFjkPBEOiU24m6SCg6B7VdJVHdTO3iHhdmx8F1TbumoCkgyKarexbwZU1XACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:55:05.705060Z"},"content_sha256":"7cb120956dc83fed5398270e6039c485e7f85ff038661c7bdac80cf7f94f2221","schema_version":"1.0","event_id":"sha256:7cb120956dc83fed5398270e6039c485e7f85ff038661c7bdac80cf7f94f2221"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FG7TL7AXM5LSLHXLWI6T4T3MTE","target":"graph","payload":{"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"},"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-02T01:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAdkOBBHfH70aR/aWGgK5Zy0rJOx+0oanBUJdx8Ipd+b3hbG/1PQ2Qh4mfw7X9IaAAJ29KKLXLcq50Udl9afDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:55:05.705450Z"},"content_sha256":"8cfc6ef4be18d85a7307b4d9434170909584bfe649cd33bd6cf1279765203c4b","schema_version":"1.0","event_id":"sha256:8cfc6ef4be18d85a7307b4d9434170909584bfe649cd33bd6cf1279765203c4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/bundle.json","state_url":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/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-02T08:55:05Z","links":{"resolver":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE","bundle":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/bundle.json","state":"https://pith.science/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG7TL7AXM5LSLHXLWI6T4T3MTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FG7TL7AXM5LSLHXLWI6T4T3MTE","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":"961dd152edbb5419f29c7f7a9d34ca4357b4f7b32d4b1b6d01bf96ab5267ef0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-30T17:53:34Z","title_canon_sha256":"d2ab43357e67ed34f5ce8bf50b9b569c518dff8bd357873fc617c05d7a9f7994"},"schema_version":"1.0","source":{"id":"2603.28748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.28748","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"2603.28748v2","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28748","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"FG7TL7AXM5LS","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_16","alias_value":"FG7TL7AXM5LSLHXL","created_at":"2026-07-02T01:18:07Z"},{"alias_kind":"pith_short_8","alias_value":"FG7TL7AX","created_at":"2026-07-02T01:18:07Z"}],"graph_snapshots":[{"event_id":"sha256:8cfc6ef4be18d85a7307b4d9434170909584bfe649cd33bd6cf1279765203c4b","target":"graph","created_at":"2026-07-02T01:18:07Z","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/2603.28748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Andrea Jim\\'enez, Daniel A. Quiroz, Henry Echeverr\\'ia, Mauricio Y\\'epez, Suchismita Mishra","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-30T17:53:34Z","title":"Odd Hadwiger number and graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.28748","kind":"arxiv","version":2},"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:7cb120956dc83fed5398270e6039c485e7f85ff038661c7bdac80cf7f94f2221","target":"record","created_at":"2026-07-02T01:18:07Z","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":"961dd152edbb5419f29c7f7a9d34ca4357b4f7b32d4b1b6d01bf96ab5267ef0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-30T17:53:34Z","title_canon_sha256":"d2ab43357e67ed34f5ce8bf50b9b569c518dff8bd357873fc617c05d7a9f7994"},"schema_version":"1.0","source":{"id":"2603.28748","kind":"arxiv","version":2}},"canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29bf35fc176757259eebb23d3e4f6c9931b371ce4f1e861dda4b2a8b9a98c458","first_computed_at":"2026-07-02T01:18:07.794577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:07.794577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"syf1Dy3sTmOX+UB5OWGNy8Ik/X463uA9fBDbd3nXkOigrSjUMqc/5lgcXGk9uxV58m0O3r1qW0H1sO4hFEvaDA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:07.795022Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.28748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cb120956dc83fed5398270e6039c485e7f85ff038661c7bdac80cf7f94f2221","sha256:8cfc6ef4be18d85a7307b4d9434170909584bfe649cd33bd6cf1279765203c4b"],"state_sha256":"1133e7be85d9680e06cc84a836c46c500b5e95a8f8062e9e787a6f1c88544afc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bci+ZLpBGFD6DYMU/oNtNv/uBx2biZ5xMSBfA82zCb8mAAZvofUSKnJoXBpfZkMmtd7S3u84VtuhaNuygdzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:55:05.707572Z","bundle_sha256":"7e47d3eca07819a283a0743f637ce5d3139bae784656557c0cbd8eb02696f879"}}