{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E7MIXH4PCU2KM5FDZX4WWJQITF","short_pith_number":"pith:E7MIXH4P","canonical_record":{"source":{"id":"1507.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-07T14:08:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"56f4205c501cacbbc6a0ad6fc15dc6a5e96ef403962ca03677b8f5573125bdd1","abstract_canon_sha256":"da9ecc38bc2f20da4fb6cdfde0630d37fc16ded55f35a26b476f884a5db562d9"},"schema_version":"1.0"},"canonical_sha256":"27d88b9f8f1534a674a3cdf96b26089964b4863dd48d2a1f48dfe2638a8a177e","source":{"kind":"arxiv","id":"1507.01818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01818","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01818v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01818","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"E7MIXH4PCU2K","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7MIXH4PCU2KM5FD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7MIXH4P","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E7MIXH4PCU2KM5FDZX4WWJQITF","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-07T14:08:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"56f4205c501cacbbc6a0ad6fc15dc6a5e96ef403962ca03677b8f5573125bdd1","abstract_canon_sha256":"da9ecc38bc2f20da4fb6cdfde0630d37fc16ded55f35a26b476f884a5db562d9"},"schema_version":"1.0"},"canonical_sha256":"27d88b9f8f1534a674a3cdf96b26089964b4863dd48d2a1f48dfe2638a8a177e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.309958Z","signature_b64":"KQekaVrtglkuSpAlFXGKhVEi6v7o57Ql/PtfcBVajS6avrTRyEIkAGTWsSp8BoyAd2Xn8wxFk1AJbfRYIs5hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d88b9f8f1534a674a3cdf96b26089964b4863dd48d2a1f48dfe2638a8a177e","last_reissued_at":"2026-05-18T01:37:12.309135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.309135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01818","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onMgcHh/qe45liJD3wnCB98VBQ1Ed+vPFo+Qnje2AxJ6C/RYEK5MUAz0g9z3LHPFPRRapcJfa5i1//knl8JACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:24:20.367740Z"},"content_sha256":"df71c257b62745faed971ed8307f37b4ab72d5e9515279045a515522ceb3f4fa","schema_version":"1.0","event_id":"sha256:df71c257b62745faed971ed8307f37b4ab72d5e9515279045a515522ceb3f4fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E7MIXH4PCU2KM5FDZX4WWJQITF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Upper Bounds on $a'(G\\Box H)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Devanshi Vyas, Gaurav Patel, Om Thakkar, Punit Mehta, Rahul Muthu","submitted_at":"2015-07-07T14:08:08Z","abstract_excerpt":"The acyclic edge colouring problem is extensively studied in graph theory. The corner-stone of this field is a conjecture of Alon et. al.\\cite{alonacyclic} that $a'(G)\\le \\Delta(G)+2$. In that and subsequent work, $a'(G)$ is typically bounded in terms of $\\Delta(G)$. Motivated by this we introduce a term $gap(G)$ defined as $gap(G)=a'(G)-\\Delta(G)$. Alon's conjecture can be rephrased as $gap(G)\\le2$ for all graphs $G$. In \\cite{manusccartprod} it was shown that $a'(G\\Box H)\\le a'(G)+a'(H)$, under some assumptions. Based on Alon's conjecture, we conjecture that $a'(G\\Box H)\\le a'(G)+\\Delta(H)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01818","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eZDzai+TtiHDLiJa5IWlVhQ0d8JNhgFDO5TCh+s2zX4MB+1+dmcJchud66V3Qws2qo+n9SnbBr+gLi37ckTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:24:20.368296Z"},"content_sha256":"3eca2891b5a4253c25be2a5911b4f6e596692725616eecf5090d47e283480afc","schema_version":"1.0","event_id":"sha256:3eca2891b5a4253c25be2a5911b4f6e596692725616eecf5090d47e283480afc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/bundle.json","state_url":"https://pith.science/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/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-30T08:24:20Z","links":{"resolver":"https://pith.science/pith/E7MIXH4PCU2KM5FDZX4WWJQITF","bundle":"https://pith.science/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/bundle.json","state":"https://pith.science/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7MIXH4PCU2KM5FDZX4WWJQITF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E7MIXH4PCU2KM5FDZX4WWJQITF","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":"da9ecc38bc2f20da4fb6cdfde0630d37fc16ded55f35a26b476f884a5db562d9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-07T14:08:08Z","title_canon_sha256":"56f4205c501cacbbc6a0ad6fc15dc6a5e96ef403962ca03677b8f5573125bdd1"},"schema_version":"1.0","source":{"id":"1507.01818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01818","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01818v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01818","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"E7MIXH4PCU2K","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7MIXH4PCU2KM5FD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7MIXH4P","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3eca2891b5a4253c25be2a5911b4f6e596692725616eecf5090d47e283480afc","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"The acyclic edge colouring problem is extensively studied in graph theory. The corner-stone of this field is a conjecture of Alon et. al.\\cite{alonacyclic} that $a'(G)\\le \\Delta(G)+2$. In that and subsequent work, $a'(G)$ is typically bounded in terms of $\\Delta(G)$. Motivated by this we introduce a term $gap(G)$ defined as $gap(G)=a'(G)-\\Delta(G)$. Alon's conjecture can be rephrased as $gap(G)\\le2$ for all graphs $G$. In \\cite{manusccartprod} it was shown that $a'(G\\Box H)\\le a'(G)+a'(H)$, under some assumptions. Based on Alon's conjecture, we conjecture that $a'(G\\Box H)\\le a'(G)+\\Delta(H)$ ","authors_text":"Devanshi Vyas, Gaurav Patel, Om Thakkar, Punit Mehta, Rahul Muthu","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-07T14:08:08Z","title":"Improved Upper Bounds on $a'(G\\Box H)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01818","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:df71c257b62745faed971ed8307f37b4ab72d5e9515279045a515522ceb3f4fa","target":"record","created_at":"2026-05-18T01:37:12Z","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":"da9ecc38bc2f20da4fb6cdfde0630d37fc16ded55f35a26b476f884a5db562d9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-07T14:08:08Z","title_canon_sha256":"56f4205c501cacbbc6a0ad6fc15dc6a5e96ef403962ca03677b8f5573125bdd1"},"schema_version":"1.0","source":{"id":"1507.01818","kind":"arxiv","version":1}},"canonical_sha256":"27d88b9f8f1534a674a3cdf96b26089964b4863dd48d2a1f48dfe2638a8a177e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d88b9f8f1534a674a3cdf96b26089964b4863dd48d2a1f48dfe2638a8a177e","first_computed_at":"2026-05-18T01:37:12.309135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.309135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQekaVrtglkuSpAlFXGKhVEi6v7o57Ql/PtfcBVajS6avrTRyEIkAGTWsSp8BoyAd2Xn8wxFk1AJbfRYIs5hAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.309958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df71c257b62745faed971ed8307f37b4ab72d5e9515279045a515522ceb3f4fa","sha256:3eca2891b5a4253c25be2a5911b4f6e596692725616eecf5090d47e283480afc"],"state_sha256":"1bef785463de611cfa1ee849d5eb0f274a1215d2f1190643ab20e4515171b511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6IndFb3Bn9TsCjYcAgZoT7jHsVeICnOAHsLirtN1jKLlyjJiukHx5OwqJxnonj65u6eHvYCJT1Cr7s5q1wNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:24:20.371348Z","bundle_sha256":"f79bbfe882094aec45598cf9ba3e155d831a7070e08ebe3514785915f031639e"}}