{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W23GCRAWTP6OCPKR2HMCYLNKCK","short_pith_number":"pith:W23GCRAW","schema_version":"1.0","canonical_sha256":"b6b66144169bfce13d51d1d82c2daa12aca5a960171e969ef6894238b9320ead","source":{"kind":"arxiv","id":"1605.03374","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.03374","created_at":"2026-05-18T01:15:05.494368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03374v1","created_at":"2026-05-18T01:15:05.494368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03374","created_at":"2026-05-18T01:15:05.494368+00:00"},{"alias_kind":"pith_short_12","alias_value":"W23GCRAWTP6O","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W23GCRAWTP6OCPKR","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W23GCRAW","created_at":"2026-05-18T12:30:48.956258+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/W23GCRAWTP6OCPKR2HMCYLNKCK","json":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK.json","graph_json":"https://pith.science/api/pith-number/W23GCRAWTP6OCPKR2HMCYLNKCK/graph.json","events_json":"https://pith.science/api/pith-number/W23GCRAWTP6OCPKR2HMCYLNKCK/events.json","paper":"https://pith.science/paper/W23GCRAW"},"agent_actions":{"view_html":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK","download_json":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK.json","view_paper":"https://pith.science/paper/W23GCRAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03374&json=true","fetch_graph":"https://pith.science/api/pith-number/W23GCRAWTP6OCPKR2HMCYLNKCK/graph.json","fetch_events":"https://pith.science/api/pith-number/W23GCRAWTP6OCPKR2HMCYLNKCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/action/storage_attestation","attest_author":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/action/author_attestation","sign_citation":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/action/citation_signature","submit_replication":"https://pith.science/pith/W23GCRAWTP6OCPKR2HMCYLNKCK/action/replication_record"}},"created_at":"2026-05-18T01:15:05.494368+00:00","updated_at":"2026-05-18T01:15:05.494368+00:00"}