{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JZD2KMSK2BD4EWNLHOKFP54ANL","short_pith_number":"pith:JZD2KMSK","schema_version":"1.0","canonical_sha256":"4e47a5324ad047c259ab3b9457f7806ac0df80919ac4ff2d598eda31f07339f3","source":{"kind":"arxiv","id":"1412.8338","version":1},"attestation_state":"computed","paper":{"title":"Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Neethi K.S., Sanjeev Saxena","submitted_at":"2014-12-29T13:43:22Z","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"},"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":"1412.8338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T13:43:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d918da44b3da5b889e073c6c8645f2a0522be81d411500edc465097d3f05c563","abstract_canon_sha256":"f8280c7dad37714b7cf3b94af97033887efdf7b775bf78f7554f6cd6f237b927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.353765Z","signature_b64":"iPmbUZrygBBsFiFJ+PNZRPJAPzHefMcPmNzjtCqpkAN3E629eCau0vS/hvuDZqdDAsjbUABj0uJ6n+wgIislBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e47a5324ad047c259ab3b9457f7806ac0df80919ac4ff2d598eda31f07339f3","last_reissued_at":"2026-05-18T00:51:34.353347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.353347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Neethi K.S., Sanjeev Saxena","submitted_at":"2014-12-29T13:43:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8338","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":"1412.8338","created_at":"2026-05-18T00:51:34.353412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8338v1","created_at":"2026-05-18T00:51:34.353412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8338","created_at":"2026-05-18T00:51:34.353412+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZD2KMSK2BD4","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZD2KMSK2BD4EWNL","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZD2KMSK","created_at":"2026-05-18T12:28:35.611951+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/JZD2KMSK2BD4EWNLHOKFP54ANL","json":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL.json","graph_json":"https://pith.science/api/pith-number/JZD2KMSK2BD4EWNLHOKFP54ANL/graph.json","events_json":"https://pith.science/api/pith-number/JZD2KMSK2BD4EWNLHOKFP54ANL/events.json","paper":"https://pith.science/paper/JZD2KMSK"},"agent_actions":{"view_html":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL","download_json":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL.json","view_paper":"https://pith.science/paper/JZD2KMSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8338&json=true","fetch_graph":"https://pith.science/api/pith-number/JZD2KMSK2BD4EWNLHOKFP54ANL/graph.json","fetch_events":"https://pith.science/api/pith-number/JZD2KMSK2BD4EWNLHOKFP54ANL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL/action/storage_attestation","attest_author":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL/action/author_attestation","sign_citation":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL/action/citation_signature","submit_replication":"https://pith.science/pith/JZD2KMSK2BD4EWNLHOKFP54ANL/action/replication_record"}},"created_at":"2026-05-18T00:51:34.353412+00:00","updated_at":"2026-05-18T00:51:34.353412+00:00"}