{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DB4QGR32CJNLXQM3ODY3FJIANP","short_pith_number":"pith:DB4QGR32","canonical_record":{"source":{"id":"1304.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-19T16:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"8c01495c1ebaec0f62b5854fa24f4d7a2edb317a059be19cc229a7d761b1b89d","abstract_canon_sha256":"143b50ba8b1e208abdb83cf912d026c2101b08d0e6cdfcf3807fba7ce07e96cc"},"schema_version":"1.0"},"canonical_sha256":"187903477a125abbc19b70f1b2a5006bc4c503f96582a497e9673be14562ee79","source":{"kind":"arxiv","id":"1304.5468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5468","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5468v1","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5468","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"DB4QGR32CJNL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DB4QGR32CJNLXQM3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DB4QGR32","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DB4QGR32CJNLXQM3ODY3FJIANP","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-19T16:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"8c01495c1ebaec0f62b5854fa24f4d7a2edb317a059be19cc229a7d761b1b89d","abstract_canon_sha256":"143b50ba8b1e208abdb83cf912d026c2101b08d0e6cdfcf3807fba7ce07e96cc"},"schema_version":"1.0"},"canonical_sha256":"187903477a125abbc19b70f1b2a5006bc4c503f96582a497e9673be14562ee79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:33.414332Z","signature_b64":"kMiwcKidGyZqV1TYgr6umLmID0MoDTT2ZZwqhdK+CkvsZF+XyJPbT69KC0pvR5o3Uzlm6uvNTpfedtpc9AU5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187903477a125abbc19b70f1b2a5006bc4c503f96582a497e9673be14562ee79","last_reissued_at":"2026-05-18T03:27:33.413757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:33.413757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5468","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-18T03:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtEyIq3UOvRyMkICBrLIeQMy9wPRXtBjo29/1vGSSeilrKBsEq7HzjiRgCS1zxZaxfMp19dlMU5I2tPnw9V/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:49.407019Z"},"content_sha256":"40ec739595ffd1cc0eb3a2e6a04a87dbe9c668b784053ca838d361e5622ccc96","schema_version":"1.0","event_id":"sha256:40ec739595ffd1cc0eb3a2e6a04a87dbe9c668b784053ca838d361e5622ccc96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DB4QGR32CJNLXQM3ODY3FJIANP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On triangles in K_r-minor free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Albar, Daniel Gon\\c{c}alves","submitted_at":"2013-04-19T16:29:40Z","abstract_excerpt":"We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The second case settles a problem of Nevo (Nevo, 2007). Morevover if each edge of a graph belongs to 6 triangles then the graph contains a K_8-minor or contains K_{2,2,2,2,2} as an induced subgraph. We then show applications of these structural properties to stress freeness and coloration of graphs. In particular, motivated by Hadwiger's conjecture, we prove that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5468","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-18T03:27:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMdPTpneWWZOQvzZTW+1O3BDGKPA3f9tu0r5Lacrxbs8lq2doDDdyhT5d6GZ2c8SBVxoSMwOcnCNMfcUGJIqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:49.407411Z"},"content_sha256":"0673301095a6bc456e510753a475f1bff1ce2383563364477f9814562451ad14","schema_version":"1.0","event_id":"sha256:0673301095a6bc456e510753a475f1bff1ce2383563364477f9814562451ad14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB4QGR32CJNLXQM3ODY3FJIANP/bundle.json","state_url":"https://pith.science/pith/DB4QGR32CJNLXQM3ODY3FJIANP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB4QGR32CJNLXQM3ODY3FJIANP/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-06-01T14:39:49Z","links":{"resolver":"https://pith.science/pith/DB4QGR32CJNLXQM3ODY3FJIANP","bundle":"https://pith.science/pith/DB4QGR32CJNLXQM3ODY3FJIANP/bundle.json","state":"https://pith.science/pith/DB4QGR32CJNLXQM3ODY3FJIANP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB4QGR32CJNLXQM3ODY3FJIANP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DB4QGR32CJNLXQM3ODY3FJIANP","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":"143b50ba8b1e208abdb83cf912d026c2101b08d0e6cdfcf3807fba7ce07e96cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-19T16:29:40Z","title_canon_sha256":"8c01495c1ebaec0f62b5854fa24f4d7a2edb317a059be19cc229a7d761b1b89d"},"schema_version":"1.0","source":{"id":"1304.5468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5468","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5468v1","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5468","created_at":"2026-05-18T03:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"DB4QGR32CJNL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DB4QGR32CJNLXQM3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DB4QGR32","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:0673301095a6bc456e510753a475f1bff1ce2383563364477f9814562451ad14","target":"graph","created_at":"2026-05-18T03:27:33Z","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":"We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The second case settles a problem of Nevo (Nevo, 2007). Morevover if each edge of a graph belongs to 6 triangles then the graph contains a K_8-minor or contains K_{2,2,2,2,2} as an induced subgraph. We then show applications of these structural properties to stress freeness and coloration of graphs. In particular, motivated by Hadwiger's conjecture, we prove that","authors_text":"Boris Albar, Daniel Gon\\c{c}alves","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-19T16:29:40Z","title":"On triangles in K_r-minor free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5468","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:40ec739595ffd1cc0eb3a2e6a04a87dbe9c668b784053ca838d361e5622ccc96","target":"record","created_at":"2026-05-18T03:27:33Z","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":"143b50ba8b1e208abdb83cf912d026c2101b08d0e6cdfcf3807fba7ce07e96cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-19T16:29:40Z","title_canon_sha256":"8c01495c1ebaec0f62b5854fa24f4d7a2edb317a059be19cc229a7d761b1b89d"},"schema_version":"1.0","source":{"id":"1304.5468","kind":"arxiv","version":1}},"canonical_sha256":"187903477a125abbc19b70f1b2a5006bc4c503f96582a497e9673be14562ee79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"187903477a125abbc19b70f1b2a5006bc4c503f96582a497e9673be14562ee79","first_computed_at":"2026-05-18T03:27:33.413757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:33.413757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMiwcKidGyZqV1TYgr6umLmID0MoDTT2ZZwqhdK+CkvsZF+XyJPbT69KC0pvR5o3Uzlm6uvNTpfedtpc9AU5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:33.414332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40ec739595ffd1cc0eb3a2e6a04a87dbe9c668b784053ca838d361e5622ccc96","sha256:0673301095a6bc456e510753a475f1bff1ce2383563364477f9814562451ad14"],"state_sha256":"57d84af65e1557226869dfabc9a8cd344c59afb763b5d867b2d7603ba0c3d69a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXCSN9Bnz2MoGtAGBGSKW61fw0knklr0fvPqOSLdu/vbOFz8n3lvHVJLQR8XlW1F+a7YPJGRwWfmUxzx9u9EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:39:49.409418Z","bundle_sha256":"258bc6c24d0b4c82632dfd311f4da4d5dbc8a12a60503916cb08e8886a658627"}}