{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W23GCRAWTP6OCPKR2HMCYLNKCK","short_pith_number":"pith:W23GCRAW","canonical_record":{"source":{"id":"1605.03374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-11T11:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"b20e7a335f8d8ce83d5a5f57a9d1e75b5817afece95d4a616e9189f808507aa8","abstract_canon_sha256":"a182ad6570363fd5deb2a41283209247a712705cc7c42eb863d96e59a433f3c9"},"schema_version":"1.0"},"canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","source":{"kind":"arxiv","id":"1605.03374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03374","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03374v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03374","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"W23GCRAWTP6O","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W23GCRAWTP6OCPKR","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W23GCRAW","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W23GCRAWTP6OCPKR2HMCYLNKCK","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-11T11:05:30Z","cross_cats_sorted":[],"title_canon_sha256":"b20e7a335f8d8ce83d5a5f57a9d1e75b5817afece95d4a616e9189f808507aa8","abstract_canon_sha256":"a182ad6570363fd5deb2a41283209247a712705cc7c42eb863d96e59a433f3c9"},"schema_version":"1.0"},"canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:05.494756Z","signature_b64":"MAIEXUT5ttzQEsdmLvmhZ6lRj4wjiRD0CUkcFne8we8O5aSR2xURdN+itU+q48+ovax5oOrZZbnyBzmrwtU+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","last_reissued_at":"2026-05-18T01:15:05.494296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:05.494296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03374","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:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtfadN0LDQzk6ot6WzNrMHufdIocN1Ojxvt9BE6ln0RxAWVFOmNJ/pWSsLyO9udJ+3YHeiG1QW9hoUMmZfWXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:52:37.413058Z"},"content_sha256":"cad2b4d8b6b71363079ab34f9f35655cc476d4011c3013ed9c870c1491b3d63e","schema_version":"1.0","event_id":"sha256:cad2b4d8b6b71363079ab34f9f35655cc476d4011c3013ed9c870c1491b3d63e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W23GCRAWTP6OCPKR2HMCYLNKCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on Erd\\\"os-Faber-Lov\\'asz Conjecture and edge coloring of complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an V\\'azquez-\\'Avila, Gabriela Araujo-Pardo","submitted_at":"2016-05-11T11:05:30Z","abstract_excerpt":"A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an intersecting linear hypergraph with $n$ edges each one containing at most $n$ vertices and every vertex is contained in at least two edges. The Erd\\\"os-Faber-Lov\\'asz Conjecture states that the chromatic number of any $n$-quasicluster is at most $n$. In the present note we prove the correctness of the conjecture for a new infinite class of $n$-quasiclusters using a specific edge coloring of the complete graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03374","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:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQLvpB7yN7m5bbR71LmN+NM49qmAoT/1Lr9pHS0lIn+oG6PBr6nMIRL7Ln6dTTLzZkRM6YE0DW7WTOyKaNYWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:52:37.413726Z"},"content_sha256":"cde8c9c0454e29cd5505125943570247c83db0b8b89953108f3003643dd79e91","schema_version":"1.0","event_id":"sha256:cde8c9c0454e29cd5505125943570247c83db0b8b89953108f3003643dd79e91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/bundle.json","state_url":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/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-27T07:52:37Z","links":{"resolver":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK","bundle":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/bundle.json","state":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W23GCRAWTP6OCPKR2HMCYLNKCK","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":"a182ad6570363fd5deb2a41283209247a712705cc7c42eb863d96e59a433f3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-11T11:05:30Z","title_canon_sha256":"b20e7a335f8d8ce83d5a5f57a9d1e75b5817afece95d4a616e9189f808507aa8"},"schema_version":"1.0","source":{"id":"1605.03374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03374","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03374v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03374","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"W23GCRAWTP6O","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W23GCRAWTP6OCPKR","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W23GCRAW","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:cde8c9c0454e29cd5505125943570247c83db0b8b89953108f3003643dd79e91","target":"graph","created_at":"2026-05-18T01:15:05Z","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":"A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an intersecting linear hypergraph with $n$ edges each one containing at most $n$ vertices and every vertex is contained in at least two edges. The Erd\\\"os-Faber-Lov\\'asz Conjecture states that the chromatic number of any $n$-quasicluster is at most $n$. In the present note we prove the correctness of the conjecture for a new infinite class of $n$-quasiclusters using a specific edge coloring of the complete graph.","authors_text":"Adri\\'an V\\'azquez-\\'Avila, Gabriela Araujo-Pardo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-11T11:05:30Z","title":"A note on Erd\\\"os-Faber-Lov\\'asz Conjecture and edge coloring of complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03374","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:cad2b4d8b6b71363079ab34f9f35655cc476d4011c3013ed9c870c1491b3d63e","target":"record","created_at":"2026-05-18T01:15:05Z","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":"a182ad6570363fd5deb2a41283209247a712705cc7c42eb863d96e59a433f3c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-11T11:05:30Z","title_canon_sha256":"b20e7a335f8d8ce83d5a5f57a9d1e75b5817afece95d4a616e9189f808507aa8"},"schema_version":"1.0","source":{"id":"1605.03374","kind":"arxiv","version":1}},"canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","first_computed_at":"2026-05-18T01:15:05.494296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:05.494296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MAIEXUT5ttzQEsdmLvmhZ6lRj4wjiRD0CUkcFne8we8O5aSR2xURdN+itU+q48+ovax5oOrZZbnyBzmrwtU+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:05.494756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad2b4d8b6b71363079ab34f9f35655cc476d4011c3013ed9c870c1491b3d63e","sha256:cde8c9c0454e29cd5505125943570247c83db0b8b89953108f3003643dd79e91"],"state_sha256":"7cfb138a536ccb103f4851b95931fb4c3864481c24737197b32536f87a962fe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8ZkstgcKXalLrzRDOtnjLsdl3L4+I3FJodzw9LGUzIxc0LgUwB/gqj21n8X6hEsuzp/AuHipXZUfkwYVIIAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:52:37.416863Z","bundle_sha256":"19f28e4ada89436164c96708d3b0db8c33112834aa70086bc578a8f598c096e9"}}