{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7Y5ZQUYL3TZO52SD23FOPNJIER","short_pith_number":"pith:7Y5ZQUYL","schema_version":"1.0","canonical_sha256":"fe3b98530bdcf2eeea43d6cae7b528245d5b888d481db97b3723e5374572a455","source":{"kind":"arxiv","id":"1508.07357","version":1},"attestation_state":"computed","paper":{"title":"Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abolghasem Soltani, Boting Yang, Karen Meagher, Shaun Fallat","submitted_at":"2015-08-28T21:34:47Z","abstract_excerpt":"Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex coverings. Continuing along these lines, we investigate positive zero forcing within the context of certain clique coverings. A key object considered here is the compressed cliques graph. We study a number of properties associated with the compressed cliques graph, including: uniqueness, forbidden subgraphs, connections to Johnson graphs, and positive zero "},"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":"1508.07357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T21:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"ddb43c2c7af722b6d7ba2c74dfa54c15962100ef74a71d9c7bac91b71a1013eb","abstract_canon_sha256":"364ecafa65d7ce387e0cbd3a3ace1af7ba8c2bb559348549e4004785010e0485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:32.479780Z","signature_b64":"JS+wPteimeU8AHzUkyI9CapCqgoB4Td0bG/11hvVc+8MuH0YrVFgSSZs4L98xTynz2mwSrrKF2jL81eiLfYaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe3b98530bdcf2eeea43d6cae7b528245d5b888d481db97b3723e5374572a455","last_reissued_at":"2026-05-18T01:34:32.479255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:32.479255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abolghasem Soltani, Boting Yang, Karen Meagher, Shaun Fallat","submitted_at":"2015-08-28T21:34:47Z","abstract_excerpt":"Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is well-known that such parameters are related to certain vertex coverings. Continuing along these lines, we investigate positive zero forcing within the context of certain clique coverings. A key object considered here is the compressed cliques graph. We study a number of properties associated with the compressed cliques graph, including: uniqueness, forbidden subgraphs, connections to Johnson graphs, and positive zero "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07357","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":"1508.07357","created_at":"2026-05-18T01:34:32.479331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07357v1","created_at":"2026-05-18T01:34:32.479331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07357","created_at":"2026-05-18T01:34:32.479331+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Y5ZQUYL3TZO","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Y5ZQUYL3TZO52SD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Y5ZQUYL","created_at":"2026-05-18T12:29:10.953037+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/7Y5ZQUYL3TZO52SD23FOPNJIER","json":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER.json","graph_json":"https://pith.science/api/pith-number/7Y5ZQUYL3TZO52SD23FOPNJIER/graph.json","events_json":"https://pith.science/api/pith-number/7Y5ZQUYL3TZO52SD23FOPNJIER/events.json","paper":"https://pith.science/paper/7Y5ZQUYL"},"agent_actions":{"view_html":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER","download_json":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER.json","view_paper":"https://pith.science/paper/7Y5ZQUYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07357&json=true","fetch_graph":"https://pith.science/api/pith-number/7Y5ZQUYL3TZO52SD23FOPNJIER/graph.json","fetch_events":"https://pith.science/api/pith-number/7Y5ZQUYL3TZO52SD23FOPNJIER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER/action/storage_attestation","attest_author":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER/action/author_attestation","sign_citation":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER/action/citation_signature","submit_replication":"https://pith.science/pith/7Y5ZQUYL3TZO52SD23FOPNJIER/action/replication_record"}},"created_at":"2026-05-18T01:34:32.479331+00:00","updated_at":"2026-05-18T01:34:32.479331+00:00"}