{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JZD2KMSK2BD4EWNLHOKFP54ANL","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":"f8280c7dad37714b7cf3b94af97033887efdf7b775bf78f7554f6cd6f237b927","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T13:43:22Z","title_canon_sha256":"d918da44b3da5b889e073c6c8645f2a0522be81d411500edc465097d3f05c563"},"schema_version":"1.0","source":{"id":"1412.8338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8338","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8338v1","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8338","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"JZD2KMSK2BD4","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JZD2KMSK2BD4EWNL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JZD2KMSK","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:2f2de7f2698bc4368715b8bb6e612b4b59d8231cfddf8d2a281eb62b73911559","target":"graph","created_at":"2026-05-18T00:51:34Z","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":"Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (M.Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, 118:239-248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an O(n^{11}) algorithm for the same (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in O(n^5) running time). In this paper we pro","authors_text":"Neethi K.S., Sanjeev Saxena","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T13:43:22Z","title":"Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8338","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:5b2cabfefa1bf1542a6f7126683c5410b35317a0257054b76edcb2a86a5fd857","target":"record","created_at":"2026-05-18T00:51:34Z","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":"f8280c7dad37714b7cf3b94af97033887efdf7b775bf78f7554f6cd6f237b927","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T13:43:22Z","title_canon_sha256":"d918da44b3da5b889e073c6c8645f2a0522be81d411500edc465097d3f05c563"},"schema_version":"1.0","source":{"id":"1412.8338","kind":"arxiv","version":1}},"canonical_sha256":"4e47a5324ad047c259ab3b9457f7806ac0df80919ac4ff2d598eda31f07339f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e47a5324ad047c259ab3b9457f7806ac0df80919ac4ff2d598eda31f07339f3","first_computed_at":"2026-05-18T00:51:34.353347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.353347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPmbUZrygBBsFiFJ+PNZRPJAPzHefMcPmNzjtCqpkAN3E629eCau0vS/hvuDZqdDAsjbUABj0uJ6n+wgIislBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.353765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b2cabfefa1bf1542a6f7126683c5410b35317a0257054b76edcb2a86a5fd857","sha256:2f2de7f2698bc4368715b8bb6e612b4b59d8231cfddf8d2a281eb62b73911559"],"state_sha256":"88ecc47fab45801f62f02751db4ad0efe746597dfe4b5bbfedffded562a49bc0"}